Name
Abstract | ||
|---|---|---|
Attribute grammars (AGs) are a suitable formalism for de- velopment of language processing systems. However, for languages includ- ing unrestricted labeled jumps, like "goto" in C, optimizers in compilers are hard to write in AGs. This is due to two problems which few previ- ous researches could deal with simultaneously, i.e., references of attribute values on distant nodes and circularity in attribute dependency. This pa- per proposes circular remote attribute grammars (CRAGs), an extension of AGs which allows (1) direct relations between two distant attribute instances through pointers referring to other nodes in the derivation tree, and (2) circular dependencies under certain conditions including those which arise from remote references. This extension gives AG program- mers a natural way to describe language processors and programming environments for languages including any type of jump structures. We will also show a way to construct an ecient evaluator for CRAGs called a mostly static evaluator. Performance of the proposed evaluator has been measured and compared with dynamic and static evaluators. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/BF03037280 | New Generation Comput. |
Keywords | Field | DocType |
Attribute Grammars,Circular Attribute Grammars,Attribute Evaluators,Declarative Languages,Compiler Construction | Rule-based machine translation,Pointer (computer programming),Programming language,L-attributed grammar,Computer science,Circular dependency,Theoretical computer science,Compiler,Compiler construction,Attribute domain,Goto | Journal |
Volume | Issue | ISSN |
22 | 1 | 0288-3635 |
Citations | PageRank | References |
1 | 0.37 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akira Sasaki | 1 | 7 | 7.22 |
| Masataka Sassa | 2 | 60 | 11.09 |