Parsing Schemata and Correctness of Parsing Algorithms

Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a parser. A parser is correct if it duely implements a parsing schema that is known to be correct. In this paper it is discussed how the correctness of a parsing schema can be proven and how parsing schemata relate to some well-known classes of parsers, viz. chart parsers and LR-type parsers.

• Type: Journal
• Year: 1998
• Where: TCS
• Authors: Klaas Sikkel
• Keywords: Parsers, Parsing, Parsing Schema, TCS 1998, Theoretical Computer Science