Lower Bounds and Reductions Between Grammar Problems

DOI10.1145/322047.322051zbMath0365.68073OpenAlexW2022313290MaRDI QIDQ4140408

Thomas G. Szymanski, Harry B. III Hunt

Publication date: 1978

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (3)

A parsing automata approach to LR theory ⋮ On the relationship between the LL(k) and LR(k) grammars ⋮ On comparingLL(k) andLR(k) grammars

This page was built for publication: Lower Bounds and Reductions Between Grammar Problems