论文信息 - Interpreters From Functions and Grammars

Interpreters From Functions and Grammars

Abstract The addition of context free grammar rules to a functional language simplifies the construction of interpreters from denotational semantic language definitions. Functional abstraction over grammar rules enables the specification and processing of context sensitive language syntax aspects in a functional style.

Greg Michaelson | G. Michaelson

[1] Seymour Ginsburg,et al. Dynamic Syntax Specification Using Grammar Forms , 1978, IEEE Transactions on Software Engineering.

[2] Peter Wegner,et al. The Vienna Definition Language , 1972, CSUR.

[3] Michael J. C. Gordon,et al. The Denotational Description of Programming Languages , 1979, Springer New York.

[4] Murray Hill,et al. Yacc: Yet Another Compiler-Compiler , 1978 .

[5] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[6] Ralph E. Griswold,et al. The Icon programming language , 1983 .

[7] William F. Clocksin,et al. Programming in Prolog , 1987, Springer Berlin Heidelberg.

[8] Cliff B. Jones,et al. Dynamic Syntax: A Concept for the Definition of the Syntax of Programming Languages , 1973 .

[9] Daniel P. Friedman,et al. CONS Should Not Evaluate its Arguments , 1976, ICALP.

[10] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[11] John McCarthy,et al. Recursive functions of symbolic expressions and their computation by machine, Part I , 1959, Commun. ACM.

[12] Friedrich L. Bauer,et al. Revised report on the algorithm language ALGOL 60 , 1963, CACM.

[13] David Gries,et al. Compiler Construction for Digital Computers , 1971 .

[14] Ravi Sethi,et al. Control Flow Aspects of Semantics-Directed Compiling , 1983, TOPL.