We have defined a parser which makes efficient use of the wealth of syntactic information available in the attributes of an attributed grammar. Moreover, we have found that, with contextual predicates, ALL(k) grammars can naturally express context-sensitive syntax, and, with disambiguating predicates, can significantly reduce the size of context-free grammars. A compiler generator (the Aparse system) based on ALL(k) grammars has now been implemented. In combining the traditional usage of attributed grammars as a method for organizing translations) with their new role as a technique for structuring syntactic analysis, Aparse has been found to be a system of considerable flexibility and power ([MKR 79]).
CITATION STYLE
Milton, D. R., & Fischer, C. N. (1979). LL(k) parsing for attributed grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 71 LNCS, pp. 422–430). Springer Verlag. https://doi.org/10.1007/3-540-09510-1_33
Mendeley helps you to discover research relevant for your work.