Recursive descent parsing for Boolean grammars

DOI10.1007/s00236-007-0045-0zbMath1119.68101OpenAlexW2072827730MaRDI QIDQ2641876

Alexander Okhotin

Publication date: 17 August 2007

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-007-0045-0

zbMATH Keywords

context-free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (10)

Parsing by matrix multiplication generalized to Boolean grammars ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ A simple P-complete problem and its language-theoretic representations ⋮ One-nonterminal conjunctive grammars over a unary alphabet ⋮ Unambiguous Boolean grammars ⋮ An extension of context-free grammars with one-sided context specifications ⋮ Conjunctive grammars with restricted disjunction ⋮ Expressive power of \(\text{LL}(k)\) Boolean grammars ⋮ BOOLEAN GRAMMARS AND GSM MAPPINGS ⋮ Language equations with complementation: expressive power

Uses Software

• ANTLR
• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Top-down parsing of conjunctive languages
• Boolean grammars
• Top-down syntax nalysis
• The dual of concatenation
• Parsing expression grammars
• Well-Founded Semantics for Boolean Grammars
• Parsing algorithms with backtrack
• GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
• Mathematical Foundations of Computer Science 2005
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Syntax-Directed Transduction
• Notes on top-down languages
• The theory of left factored languages: Part 1
• The theory of left factored languages: part 2
• Two Families of Languages Related to ALGOL
• Properties of deterministic top-down grammars

This page was built for publication: Recursive descent parsing for Boolean grammars