Tests for the LR-, LL-, and LC-regular conditions

DOI10.1016/0022-0000(83)90026-0zbMath0512.68070OpenAlexW2085629288MaRDI QIDQ1050124

Stephan Heilbrunner

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90026-0

zbMATH Keywords

parsing algorithmdecidable criterioninclusion theorems for grammars

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (1)

An experimental ambiguity detection tool

Cites Work

• Unnamed Item
• Unnamed Item
• A method for transforming grammars into LL(k) form
• A parsing automata approach to LR theory
• LL-regular grammars
• On LL-regular grammars
• LR-regular grammars - an extension of LR(k) grammars

This page was built for publication: Tests for the LR-, LL-, and LC-regular conditions