Some properties of precedence languages
From MaRDI portal
Recommendations
- Precedence automata and languages
- Precedences in specifications and implementations of programming languages
- An Iteration Theorem for Simple Precedence Languages
- Operator precedence languages: their automata-theoretic and logic characterization
- Beyond operator-precedence grammars and languages
- On the descriptive power of simple precedence grammars
- Language preorder as a precongruence
- Higher-order operator precedence languages
- Publication:3033350
- Some properties of iterated languages
Cited in
(22)- A note on weak operator precedence grammars
- Soft precedence
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Precedence technique is not worse than SLR(1)
- Generalizing input-driven languages: theoretical and practical benefits
- Precedence automata and languages
- An Iteration Theorem for Simple Precedence Languages
- scientific article; zbMATH DE number 3757742 (Why is no real title available?)
- Operator precedence and the visibly pushdown property
- Generalized overlap resolvable grammars and their parsers
- On the 'correct prefix property' in precedence parsers
- scientific article; zbMATH DE number 3902059 (Why is no real title available?)
- Precedence-regular grammars
- First-order logic definability of free languages
- Epsilon weak precedence grammars and languages
- Weighted operator precedence languages
- Beyond operator-precedence grammars and languages
- A note on weak operator precedence grammars
- scientific article; zbMATH DE number 4085054 (Why is no real title available?)
- Multipass precedence analysis
- On the descriptive power of simple precedence grammars
- Experience with a conversational parser generating system
This page was built for publication: Some properties of precedence languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402517)
