Two-sided context specifications in formal grammars
From MaRDI portal
Publication:2354409
DOI10.1016/J.TCS.2015.05.004zbMath1408.68086OpenAlexW617375748MaRDI QIDQ2354409
Mikhail Barash, Alexander Okhotin
Publication date: 13 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.004
Related Items (5)
Generalized LR parsing algorithm for grammars with one-sided contexts ⋮ The hardest language for grammars with context operators ⋮ Linear-space recognition for grammars with contexts ⋮ Hardest languages for conjunctive and Boolean grammars ⋮ The Hardest Language for Conjunctive Grammars
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parsing by matrix multiplication generalized to Boolean grammars
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- Well-founded semantics for Boolean grammars
- On multiple context-free grammars
- General context-free recognition in less than cubic time
- Conjunctive grammars and systems of language equations
- Boolean grammars
- An extension of context-free grammars with one-sided context specifications
- Improved Normal Form for Grammars with One-Sided Contexts
- LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata
- Generalized LR Parsing for Grammars with Contexts
- On certain formal properties of grammars
- BOOLEAN FUZZY SETS
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
- Recognizing Two-Sided Contexts in Cubic Time
- Two Families of Languages Related to ALGOL
This page was built for publication: Two-sided context specifications in formal grammars
