Design, implementation and evaluation of the FNC-2 attribute grammar system

1 June 1990

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices

Vol. 25 (6) , 209-222
https://doi.org/10.1145/93548.93568

Abstract

FNC-2 is a new attribute grammar processing system aiming at expressive power, efficiency, ease of use and versatility. Its development at INRIA started in 1986, and a first running prototype is available since early 1989. Its most important features are: efficient exhaustive and incremental visit-sequence-based evaluation of strongly (absolutely) non-circular AGs; extensive space optimizations; a specially-designed AG-description language, with provisions for true modularity; portability and versatility of the generated evaluators; complete environment for application development. This paper briefly describes the design and implementation of FNC-2 and its peripherals. Then preliminary experience with the system is reported.

Keywords

This publication has 16 references indexed in Scilit:

Using rewriting techniques to produce code generators and proving them correct
Science of Computer Programming, 1990
Improvements of an incremental evaluation algorithm for ordered attribute grammars
ACM SIGPLAN Notices, 1988
Classical and incremental attribute evaluation by means of recursive procedures
Theoretical Computer Science, 1987
A comparison of storage optimizations in automatically-generated attribute evaluators
Acta Informatica, 1986
Automatic generation of fixed-point-finding evaluators for circular, but well-defined, attribute grammars
ACM SIGPLAN Notices, 1986
Sub-protocol-evaluators for attribute grammars
Published by Association for Computing Machinery (ACM) ,1984
Generation of Compiler Symbol Processing Mechanisms from Specifications
ACM Transactions on Programming Languages and Systems, 1983
Ordered attributed grammars
Acta Informatica, 1980
A unified approach to global program optimization
Published by Association for Computing Machinery (ACM) ,1973
Semantics of context-free languages
Theory of Computing Systems, 1968