Parsing schemata and correctness of parsing algorithms
From MaRDI portal
Publication:1129124
DOI10.1016/S0304-3975(97)00269-7zbMath0902.68113MaRDI QIDQ1129124
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (6)
Parsing schemata and correctness of parsing algorithms ⋮ Natural Language Processing, Moving from Rules to Data ⋮ Model Theoretic Syntax and Parsing ⋮ Error-repair parsing schemata ⋮ An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem ⋮ Tabular parsing and algebraic transformations
Cites Work
- Parsing schemata and correctness of parsing algorithms
- The Logic of Typed Feature Structures
- Recognition and parsing of context-free languages in time n3
- An efficient context-free parsing algorithm
- Simple LR(k) grammars
- On the translation of languages from left to right
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parsing schemata and correctness of parsing algorithms
