On LLP(k) grammars and languages

DOI10.1016/0304-3975(81)90073-6zbMath0489.68072OpenAlexW1969145355MaRDI QIDQ1166936

Jan Pittl

Publication date: 1981

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(81)90073-6

zbMATH Keywords

grammatical characterizationsextension of strict deterministic grammars

Mathematics Subject Classification ID

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

Related Items (2)

On LLP(k) parsers ⋮ On the relationship between the LL(k) and LR(k) grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On LLP(k) parsers
• Normal forms of deterministic grammars
• On LR(k) grammars and languages
• Characteristic parsing: A framework for producing compact deterministic parsers. I
• Strict deterministic grammars
• On the Parsing of Deterministic Languages
• Data Flow Analysis in the Presence of Procedure Calls
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Deterministic context free languages
• Two Complete Axiom Systems for the Extended Language of Regular Expressions
• Properties of deterministic top-down grammars
• On the translation of languages from left to right
• A Formalization of Transition Diagram Systems

This page was built for publication: On LLP(k) grammars and languages