|
1. |
Toward complete programming language descriptions that are both formal and understandable |
|
Software: Practice and Experience,
Volume 14,
Issue 3,
1984,
Page 199-206
Frank G. Pagan,
Preview
|
PDF (456KB)
|
|
摘要:
AbstractWe describe an approach to, and a case study of, the construction of complete programming language descriptions that are at the same time formal and readily understandable. Such a description includes integrated specifications for abstract and textual syntax, context conditions (static semantics) and dynamic semantics. The imetalanguage is a powerful program design language based on a real general‐purpose programming language. The specifications are presented not as a monolithic block but as an intellectually manageable sequence of sections and subsections with a carefully designed format and cross‐referencing scheme. The approach could reduce the need to choose between formality and understandability in a language reference man
ISSN:0038-0644
DOI:10.1002/spe.4380140302
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
2. |
Implementation of predicate‐based protection in multisafe |
|
Software: Practice and Experience,
Volume 14,
Issue 3,
1984,
Page 207-234
H. Rex Hartson,
Preview
|
PDF (1601KB)
|
|
摘要:
AbstractThis paper brings together a formal predicate‐based model of protection and a relational approach to a protection database within the modular architecture of MULTISAFE. An implementation model is developed for the management of stored representations of authorization information. Classes of access decision dependency are reviewed, and protection policies, design decisions, and some implementation problems are discussed. Detailed examples are used to illustrate the use of this flexible and generalized approach to database security within the MULTISAFE system architectur
ISSN:0038-0644
DOI:10.1002/spe.4380140303
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
3. |
A semantically‐based formatting discipline for Pascal |
|
Software: Practice and Experience,
Volume 14,
Issue 3,
1984,
Page 235-251
Paul A. Bailes,
Antonio Salvadori,
Preview
|
PDF (594KB)
|
|
摘要:
AbstractThe abstract (or semantic) syntax of the Pascal language is identified, and a linear representation for the trees so formed within the framework of the concrete syntax for that language is imposed. The indentation scheme so formed, augmented with a small number of pragmatic considerations, is compared with several previously proposed formatting schemes for Pascal and an example of the use of this new method is given.
ISSN:0038-0644
DOI:10.1002/spe.4380140304
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
4. |
A LIS compiler for GCOS‐7 |
|
Software: Practice and Experience,
Volume 14,
Issue 3,
1984,
Page 253-261
Bernard Henin,
Daniel Couprie,
Pierre Douspis,
Preview
|
PDF (675KB)
|
|
摘要:
AbstractThis paper describes the implementation of a LIS compiler for GCOS‐7. LIS is a high level system implementation language developed at CII‐Honeywell Bull during the middle 1970s, and experience with the language and its implementation have largely influenced the design of Ada. The design of the compiler was particularly aimed at efficient code generation. Design decisions concerning the run‐time organization in relation to procedure call and separate compilation are discussed. The structure of the compiler is described. The articulation between the different phases of the code generator is emphasized. Experience with the bootstrap is re
ISSN:0038-0644
DOI:10.1002/spe.4380140305
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
5. |
The Application of Halstead's software science. Theory to Algol 68 programs |
|
Software: Practice and Experience,
Volume 14,
Issue 3,
1984,
Page 263-276
M. R. Woodward,
Preview
|
PDF (682KB)
|
|
摘要:
AbstractM. H. Halstead has argued that all computer programs are composed entirely of operators and operands. By counting these entities the software science theory then enables program properties such as vocabulary, length, volume, program level and language level to be calculated. For well written, or so‐called ‘pure programs’, one would expect, according to the theory, good agreement between certain observed and predicted values. Also, one might expect an intuitive ordering of language levels to be confirmed by the theory, with for example, Algol 68 having a higher language level than Fortran. In this paper two different counting strategies have been applied to one implementation of the Numerical Algorithms Group (NAG) Algol 68 library. The results do not entirely match expect
ISSN:0038-0644
DOI:10.1002/spe.4380140306
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
6. |
An interactive data visualization system |
|
Software: Practice and Experience,
Volume 14,
Issue 3,
1984,
Page 277-290
Daniel Thalmann,
Preview
|
PDF (502KB)
|
|
摘要:
AbstractGRAFANA is an interactive program, which allows the user to produce drawings based on data stored on a disk file. The major advantage and originality of the system is that the user can interactively determine the visual effect of a drawing and immediately see it on the screen. Moreover, any drawing produced by GRAFANA can still be edited by a generalpurpose graphics editor. This system allows the user to obtain precisely the right drawing for any book, paper or report.GRAFANA has been implemented in MIRA‐2D, a graphical Pascal extension. It is available for different machines and kinds of graphical device
ISSN:0038-0644
DOI:10.1002/spe.4380140307
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
7. |
Preprocessing embedded actions |
|
Software: Practice and Experience,
Volume 14,
Issue 3,
1984,
Page 291-297
Ravi Sethi,
Preview
|
PDF (363KB)
|
|
摘要:
AbstractSome parser generators allow the user to attach actions, consisting of executable code, to syntax rules. Actions are usually in the local programming language, so they are simply copied into the generated parser. However, we show two situations in which it is convenient to allow actions to be in a different notation. A preprocessor is used to translate such notations into the local programming language. A preprocessor must know where to find actions and how to translate them. We show how these two activities can be programmed separately. Often, the user only has to worry about the second part: once the parser generator is known, the placement of the actions is known as well, so routines for finding actions can be separately compiled and linked in. Examples in the paper are based on the parser generator Yacc, but the approach is not limited to Yacc, or even to parser generators. Certain compositions of syntax‐directed translations can be implemented by preprocessing action
ISSN:0038-0644
DOI:10.1002/spe.4380140308
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
8. |
Masthead |
|
Software: Practice and Experience,
Volume 14,
Issue 3,
1984,
Page -
Preview
|
PDF (50KB)
|
|
ISSN:0038-0644
DOI:10.1002/spe.4380140301
出版商:John Wiley&Sons, Ltd.
年代:1984
数据来源: WILEY
|
|