Recursive descent parsing for Boolean grammars

DOI10.1007/S00236-007-0045-0MaRDI QIDQ2641876zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Developments in Language Theory
• GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
• Parsing by matrix multiplication generalized to Boolean grammars
• Fast parsing for Boolean grammars: a generalization of Valiant's algorithm
• scientific article; zbMATH DE number 5201499
• On a recursive ascent parser
• scientific article; zbMATH DE number 22366
• scientific article; zbMATH DE number 2040923
• Boolean grammars

Cites work

• scientific article; zbMATH DE number 1747449 (Why is no real title available?)
• scientific article; zbMATH DE number 5254145 (Why is no real title available?)
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Boolean grammars
• GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
• Mathematical Foundations of Computer Science 2005
• Notes on top-down languages
• Parsing algorithms with backtrack
• Parsing expression grammars: a recognition-based syntactic foundation
• Properties of deterministic top-down grammars
• Syntax-Directed Transduction
• The dual of concatenation
• The theory of left factored languages: Part 1
• The theory of left factored languages: part 2
• Top-down parsing of conjunctive languages
• Top-down syntax nalysis
• Two Families of Languages Related to ALGOL
• Well-Founded Semantics for Boolean Grammars

Cited in

(13)

• scientific article; zbMATH DE number 5201499 (Why is no real title available?)
• Boolean grammars and gsm mappings
• Conjunctive grammars with restricted disjunction
• Language equations with complementation: expressive power
• GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
• Expressive power of \(\text{LL}(k)\) Boolean grammars
• Unambiguous Boolean grammars
• 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
• Developments in Language Theory
• One-nonterminal conjunctive grammars over a unary alphabet
• An extension of context-free grammars with one-sided context specifications

Describes a project that uses

Uses Software

• ANTLR
• ALGOL 60

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641876)