Parsing schemata and correctness of parsing algorithms
From MaRDI portal
Publication:1129124
DOI10.1016/S0304-3975(97)00269-7zbMATH Open0902.68113MaRDI QIDQ1129124FDOQ1129124
Authors: Klaas Sikkel 
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Publication:4714447
- Error-repair parsing schemata
- scientific article; zbMATH DE number 1696588
- Parsing beyond context-free grammars
- Parsing schemata for practical text analysis.
- Parsing as abstract interpretation of grammar semantics
- Principles and implementation of deductive parsing
- Certified parsing of regular languages
Cites Work
- An efficient context-free parsing algorithm
- Recognition and parsing of context-free languages in time n3
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the translation of languages from left to right
- The Logic of Typed Feature Structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simple LR(k) grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parsing schemata and correctness of parsing algorithms
Cited In (6)
- Tabular parsing and algebraic transformations
- An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem
- Parsing schemata and correctness of parsing algorithms
- Error-repair parsing schemata
- Natural language processing, moving from rules to data
- Model Theoretic Syntax and Parsing
This page was built for publication: Parsing schemata and correctness of parsing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129124)
