The Complexity of LALR (k) Testing

DOI10.1145/322374.322376zbMath0512.68069DBLPjournals/jacm/SippuSU83OpenAlexW2091729906WikidataQ58054203 ScholiaQ58054203MaRDI QIDQ3657462

Eljas Soisalon-Soininen, Seppo Sippu, Esko Ukkonen

Publication date: 1983

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322374.322376

zbMATH Keywords

context-free grammarsLALR(k) grammars

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of compilers and interpreters (68N20)

Related Items (4)

Practical arbitrary lookahead LR parsing ⋮ A general model for fixed look-ahead lr parsers ⋮ Lar(m, c, l) grammars ⋮ On the complexity of LL(k) testing

This page was built for publication: The Complexity of LALR (k) Testing