Beyond operator-precedence grammars and languages
From MaRDI portal
Publication:2186819
DOI10.1016/j.jcss.2020.04.006zbMath1444.68092OpenAlexW3021676532MaRDI QIDQ2186819
Stefano Crespi Reghizzi, Matteo Pradella
Publication date: 9 June 2020
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11311/1136684
deterministic context-free languagesvisibly pushdown languagesinput-driven languagesoperator precedence languagesBoolean closurelocally testable languageslocal parsabilitygrammar inferencesyntactic tags
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Toward a theory of input-driven locally parsable languages
- Families of locally testable languages
- Generalizing input-driven languages: theoretical and practical benefits
- Operator precedence and the visibly pushdown property
- Fast deterministic parsers for transition networks
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Adding nesting structure to words
- Identification in the Limit of k,l-Substitutable Context-Free Languages
- PAC-Learning Unambiguous k,l-NTS ≤ Languages
- Operator Precedence Grammars and the Noncounting Property
- Algebraic properties of operator precedence languages
- Noncounting Context-Free Languages
- Tinput-Driven Pushdown, Counter, and Stack Automata
- Syntactic Analysis and Operator Precedence
- Parsing Techniques
- Some properties of precedence languages
- EULER: A generalization of ALGOL and its formal definition: Part 1
- Parenthesis Grammars
- A characterization of parenthesis languages
- The use of grammatical inference for designing programming languages
- Bounded context syntactic analysis
- Formal languages and compilation
