The equivalence problem for LL- and LR-regular grammars

DOI10.1016/0022-0000(82)90044-7zbMath0482.68070OpenAlexW1987076568MaRDI QIDQ1162821

Anton Nijholt

Publication date: 1982

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

Full work available at URL: https://research.utwente.nl/en/publications/the-equivalence-problem-for-ll-and-lrregular-grammars(8b69ffc3-cabf-42ff-8c10-b428b026a68e).html

zbMATH Keywords

decidabilitycontext-free languagesLL(k) grammarsstrict deterministic grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items (3)

On linear languages recognized by deterministic biautomata ⋮ Look-ahead on pushdowns ⋮ \(L(A)=L(B)\)? decidability results from complete formal systems

Cites Work

• On the relationship between the LL(k) and LR(k) grammars
• LL-regular grammars
• A direct algorithm for checking equivalence of LL(k) grammars
• On equivalence of grammars through transformation trees
• On LL-regular grammars
• LR-regular grammars - an extension of LR(k) grammars
• Strict deterministic grammars
• The equivalence problem for real-time strict deterministic languages
• Ll-regular grammars
• Some remarks on the KH algorithm fors-grammars
• Properties of deterministic top-down grammars
• Real-Time Strict Deterministic Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The equivalence problem for LL- and LR-regular grammars