Recursive descent parsing for Boolean grammars
From MaRDI portal
Publication:2641876
DOI10.1007/S00236-007-0045-0zbMATH Open1119.68101OpenAlexW2072827730MaRDI QIDQ2641876FDOQ2641876
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
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
- Notes on top-down languages
- Boolean grammars
- Title not available (Why is that?)
- Syntax-Directed Transduction
- Two Families of Languages Related to ALGOL
- Title not available (Why is that?)
- GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
- Top-down parsing of conjunctive languages
- Top-down syntax nalysis
- The dual of concatenation
- Mathematical Foundations of Computer Science 2005
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- Properties of deterministic top-down grammars
- Parsing algorithms with backtrack
- Parsing expression grammars: a recognition-based syntactic foundation
- Well-Founded Semantics for Boolean Grammars
- The theory of left factored languages: part 2
- The theory of left factored languages: Part 1
Cited In (13)
- A simple P-complete problem and its language-theoretic representations
- One-nonterminal conjunctive grammars over a unary alphabet
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- Unambiguous Boolean grammars
- Conjunctive grammars with restricted disjunction
- Developments in Language Theory
- An extension of context-free grammars with one-sided context specifications
- Boolean grammars and gsm mappings
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Language equations with complementation: expressive power
- Title not available (Why is that?)
- Parsing by matrix multiplication generalized to Boolean grammars
- GENERALIZED LR PARSING ALGORITHM FOR BOOLEAN GRAMMARS
Uses Software
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)
