摘要:

AbstractIn this note, we show how a few UNIX™ commands can be combined to create a flexible reference assembler that automatically maintains the consistency of cross references in manuscripts. The reference assembler can be used in conjunction with any text formatte

ISSN:0038-0644    

DOI:10.1002/spe.4380180103

出版商:John Wiley&Sons, Ltd.    

年代:1988

数据来源: WILEY

摘要:

AbstractThe UNIX 4.3 operating system, like its predecessor UNIX 4.2, is designed to allow interprocess communications between pairs of processes using sockets — pairs of integers identifying specific hosts and ports — which are associated with a process. In this paper a software package which allows interprocess communications between many UNIX processes (as opposed to two) is presen

ISSN:0038-0644    

DOI:10.1002/spe.4380180104

出版商:John Wiley&Sons, Ltd.    

年代:1988

数据来源: WILEY

摘要:

AbstractLL(1) grammars have the conceptual and practical advantage that they allow the compiler writer to view the grammar as a program; this allows a more natural positioning of semantic actions and a simple attribute mechanism. Resulting parsers can be constructed that achieve fully automatic error‐recovery, which allows the compiler writer to ignore totally the issue of syntax errors. Measurement shows that such parsers can be reasonably efficien

ISSN:0038-0644    

DOI:10.1002/spe.4380180105

出版商:John Wiley&Sons, Ltd.    

年代:1988

数据来源: WILEY

摘要:

AbstractCertain types of computer language popular in areas such as decision support systems have the property that language statements need not be written in execution sequence, as the correct evaluation order can be established by dependency analysis. The uncontrolled use of these ‘nonsequential’ languages can lead to the development of programs and systems that are difficult to comprehend and maintain. This paper describes a method of clustering such code statements into sequential (procedural) modules to clarify visual presentation. The technique is based on depth‐first search of directed graphs and will group those statements which are most strongly related to each other into a m

ISSN:0038-0644    

DOI:10.1002/spe.4380180106

出版商:John Wiley&Sons, Ltd.    

年代:1988

数据来源: WILEY

摘要:

AbstractA programming standard is described, with the emphasis on the visual aspects of the final product rather than on how the programs are engineered.

ISSN:0038-0644    

DOI:10.1002/spe.4380180107

出版商:John Wiley&Sons, Ltd.    

年代:1988

数据来源: WILEY

摘要:

AbstractA micro‐coded interpreter has been written for the occam programming language that runs on the fully microprogrammable HLH Orion mini‐computers. The resulting software gives performance which is comparable with native‐code operation on similar hardware, and is able to be extended easily to support new instructions as the language is developed fu

ISSN:0038-0644    

DOI:10.1002/spe.4380180108

出版商:John Wiley&Sons, Ltd.    

年代:1988

数据来源: WILEY

摘要:

AbstractTagging of objects produced by generators is a simple mechanism for the synchronization of generators. Such tagging is proposed as a reliable software design technique for problems based on data streams. It is used to develop programs for two‐way merge and file updat

ISSN:0038-0644    

DOI:10.1002/spe.4380180109

出版商:John Wiley&Sons, Ltd.    

年代:1988

数据来源: WILEY

摘要:

AbstractDatabase systems are becoming increasingly popular for answering queries. Partial‐match search queries are an important class of queries in such a system. Several storage structures have been proposed to answer these queries efficiently. The BD tree is an example of such a storage structure. A previous study indicated that the k‐d tree performance is better than that of the BD tree for partial‐match search queries. A recent paper reported some improved algorithms. However, it is unclear whether the improved algorithms show the BD tree in a favourable light for partial‐match search queries. This paper explores the performance of these algorithms and compares their performance to that of the k‐d tree. Since the BD tree construction process uses some heuristics to make it a better balanced tree, this paper also evaluates the effect of these heuristics on the partial‐match search algorithms. The major conclusions of this study are that the BD tree performance for partial‐match search is better than that of the k‐d tree when an improved algorithm is used for partial‐match search, and only the DZ expression rearrangement heuristic has substantial effect on partial‐match

ISSN:0038-0644    

DOI:10.1002/spe.4380180110

出版商:John Wiley&Sons, Ltd.    

年代:1988

数据来源: WILEY

ISSN:0038-0644    

DOI:10.1002/spe.4380180102

出版商:John Wiley&Sons, Ltd.    

年代:1988

数据来源: WILEY