An algebraic technique for context-sensitive parsing
From MaRDI portal
Publication:4185837
DOI10.1007/BF00991838zbMath0401.68063MaRDI QIDQ4185837
Publication date: 1976
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00991838
Semiring; Context-Free Grammar; Context-Sensitive Languages; Algebraic Parsing Technique; State Grammar
68N20: Theory of compilers and interpreters
Cites Work
- Unnamed Item
- Normal forms for context-sensitive grammars
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Scattered context grammars
- A hierarchy between context-free and context-sensitive languages
- Phrase structure grammars generating context-free languages
- Programmed Grammars and Classes of Formal Languages
- Simple matrix languages
- Periodically time-variant context-free grammars
- Matrix grammars with a leftmost restriction
- Some restrictive devices for context-free grammars
- Discontinuity and asymmetry in phrase structure grammars