Name
Abstract | ||
|---|---|---|
Ordered attributed grammars are defined as a large subclass of semantically well-defined attributed grammars proposed by Knuth. An attributed grammar is ordered if for each symbol a partial order over the associated attributes can be given, such that in any context of the symbol the attributes are evaluable in an order which includes that partial order. The definition does not refer to a predefined strategy for attribute evaluation, e.g. several passes from left to right. For each attributed grammar evaluable by any predefined evaluation strategy such an order exists. The ordering property can be checked by an algorithm, which depends polynomially in time on the size of the input grammar. \"Visit-sequences\" are computed from the attribute dependencies given by an ordered attributed grammar. They describe the control flow of an algorithm for attribute evaluation which can be part of an automatically generated compiler. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1007/BF00288644 | Acta Inf. |
Keywords | Field | DocType |
Information System,Operating System,Data Structure,Communication Network,Information Theory | Context-sensitive grammar,Rule-based machine translation,Tree-adjoining grammar,Attribute grammar,Data structure,Discrete mathematics,Combinatorics,L-attributed grammar,Context-free grammar,Computer science,Grammar | Journal |
Volume | Issue | ISSN |
13 | 3 | 0001-5903 |
Citations | PageRank | References |
121 | 16.23 | 11 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Uwe Kastens | 1 | 406 | 55.65 |