摘要:

AbstractThis paper describes our approach to the problem of specifying formatting information in computer‐based text processing. We distinguish between local and global formatting decisions, adopt natural conventions for representing each, and separate them. Our system, cast as a preprocessor to an available formatter, hides annoying formatter dependencies, and leads to a document representation which can be processed under several operating systems. After initially implementing our system, we produced a second version for another formatter/operating system in less than 2 man‐we

ISSN:0038-0644    

DOI:10.1002/spe.4380100502

出版商:John Wiley&Sons, Ltd.    

年代:1980

数据来源: WILEY

摘要:

AbstractFour systems of bibliographic manipulation are described and evaluated. Two are interactive programming languages which provide key word information retrieval in real time, while two are batch packages which produce catalogues, indexes and bibliographies. Two are specifically designed for text analysis, while two are general purpose software. It is considered that the former provide a more flexible and more powerful tool than the latter.

ISSN:0038-0644    

DOI:10.1002/spe.4380100503

出版商:John Wiley&Sons, Ltd.    

年代:1980

数据来源: WILEY

摘要:

AbstractThe present paper discusses a method of program construction based on the specification of the data types. The input and output data types and the mapping between them are specified at a high level of abstraction and this non‐procedural specification is used to develop a program schema. The data type and mapping specifications are modified to include a concrete representation of the data and these are used to expand the program schema into a program. A graphical representation for data and program specifications is also introduced and it is shown how this can simplify the techniques and be very useful in program construction. The method is illustrated by developing two programs—the line justifier program described by Gries and the bubbles

ISSN:0038-0644    

DOI:10.1002/spe.4380100504

出版商:John Wiley&Sons, Ltd.    

年代:1980

数据来源: WILEY

摘要:

AbstractIt has become fashionable to criticize nested conditionals, which are supposed to tax the human mind, and to recommend that they should be ‘un‐nested’, turning if‐then‐if into if‐then‐else‐if. Experiment casts doubt on this, however, and suggests that indeed the unnested form is only slightly better in the best conditions and is much worse in unsuitable conditions. Rather than hypothesizing about how the programmer's mind works a much more important principle seems to be to provideperceptual cuesthat will make program structure manifest rat

ISSN:0038-0644    

DOI:10.1002/spe.4380100505

出版商:John Wiley&Sons, Ltd.    

年代:1980

数据来源: WILEY

摘要:

AbstractThe steps necessary to extend the UNIXUNIX is a trademark of Bell Laboratories.time sharing system to a network which includes a central processor and a set of satellite processors is described. Software interfaces permit a program in the satellite processor to behave as if it were running in the central processor. Tasks are executed in parallel in several processors resulting in improved reliability and response time. The economics of such systems becomes more feasible with the reduction of the cost of CPUs and memories and the increasing demand for dedicated local computers.

ISSN:0038-0644    

DOI:10.1002/spe.4380100506

出版商:John Wiley&Sons, Ltd.    

年代:1980

数据来源: WILEY

摘要:

AbstractThis paper describes a general purpose optimizer used to construct a new code generator for an existing Coral 66 compiler. The optimizer is recursive and gives the one pass code generator some of the advantages of a multiple pass scheme by ‘pipelining’ short sequences of linear intermediate code at each activation le

ISSN:0038-0644    

DOI:10.1002/spe.4380100507

出版商:John Wiley&Sons, Ltd.    

年代:1980

数据来源: WILEY

摘要:

AbstractA method for inventing algorithms and several examples are presented. The Julian conversion is useful for all date calculations and for switching to daylight saving time. The algorithm rotates the calendar by 2 months and performs a few straightforward calculations on the new month‐day‐year to produce the Julian date (and back again).The butterfly sort is based on the work on Woodrum. The algorithm repeatedly delivers two linked lists to a merge machine that produces a single linked list for further use. The length of the two lists going into the merge machine never differs by more than one. This accounts for the theoretical minimal number of comparisons5.The algorithm uses patterns within a simple binary counter to schedule the delivery of these lists. This accounts for the minimal number of steps between each comparis

ISSN:0038-0644    

DOI:10.1002/spe.4380100508

出版商:John Wiley&Sons, Ltd.    

年代:1980

数据来源: WILEY

ISSN:0038-0644    

DOI:10.1002/spe.4380100509

出版商:John Wiley&Sons, Ltd.    

年代:1980

数据来源: WILEY

ISSN:0038-0644    

DOI:10.1002/spe.4380100501

出版商:John Wiley&Sons, Ltd.    

年代:1980

数据来源: WILEY