Top-down parsing of conjunctive languages
From MaRDI portal
Publication:1604833
Recommendations
Cited in
(15)- A recognition and parsing algorithm for arbitrary conjunctive grammars.
- Run-time extensible deterministic top-down parsing
- LR parsing for conjunctive grammars
- Conjunctive grammars and alternating pushdown automata
- Recursive descent parsing for Boolean grammars
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- scientific article; zbMATH DE number 512887 (Why is no real title available?)
- scientific article; zbMATH DE number 1962782 (Why is no real title available?)
- scientific article; zbMATH DE number 2050923 (Why is no real title available?)
- scientific article; zbMATH DE number 6851912 (Why is no real title available?)
- Applying classical concepts to parsing expression grammar
- Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
- Grammar semantics, analysis and parsing by abstract interpretation
- LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
This page was built for publication: Top-down parsing of conjunctive languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604833)