Premium
A programmer‐friendly LL(1) parser generator
Author(s) -
Grune Dick,
Jacobs Ceriel J. H.
Publication year - 1988
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380180105
Subject(s) - computer science , programming language , parsing , compiler , programmer , lr parser , syntax , generator (circuit theory) , rule based machine translation , grammar , natural language processing , simple (philosophy) , top down parsing , artificial intelligence , linguistics , power (physics) , physics , philosophy , epistemology , quantum mechanics
Abstract LL(1) grammars have the conceptual and practical advantage that they allow the compiler writer to view the grammar as a program; this allows a more natural positioning of semantic actions and a simple attribute mechanism. Resulting parsers can be constructed that achieve fully automatic error‐recovery, which allows the compiler writer to ignore totally the issue of syntax errors. Measurement shows that such parsers can be reasonably efficient.