A new analysis of LALR formalisms

A new analysis of LALR formalisms

The traditional LALR analysis is reexamined using a new operator and an associated graph. An improved method that allows factoring out a crucial part of the computation for defining states of LR(0) canonical collection and for computing LALR(1) lookahead sets is presented. This factorization leads t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on programming languages and systems 1985-01, Vol.7 (1), p.159-175
Hauptverfasser: Park, Joseph C.H., Choe, K. M., Chang, C. H.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Compilers
Computer science
control theory
systems
Contextual software domains
Exact sciences and technology
Formal language definitions
Formal languages and automata theory
Grammars and context-free languages
Language theory and syntactical analysis
Operating systems
Parsers
Parsing
Program reasoning
Semantics and reasoning
Software and its engineering
Software notations and tools
Software organization and properties
Syntax
Theoretical computing
Theory of computation
Translator writing systems and compiler generators
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The traditional LALR analysis is reexamined using a new operator and an associated graph. An improved method that allows factoring out a crucial part of the computation for defining states of LR(0) canonical collection and for computing LALR(1) lookahead sets is presented. This factorization leads to significantly improved algorithms with respect to execution time as well as storage requirements. Experimental results including comparison with other known methods are presented.
ISSN:0164-0925
1558-4593
DOI:10.1145/2363.2527