Parsing Schemata and Correctness of Parsing Algorithms


Sikkel, Klaas (1998) Parsing Schemata and Correctness of Parsing Algorithms. Theoretical Computer Science, 199 (1-2). pp. 87-103. ISSN 0304-3975

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:Parsing schemata give a high-level formal description of parsers. These can be used, among others, as an intermediate level of abstraction for deriving the formal correctness of a parser. A parser is correct if it duly implements a parsing schema that is known to be correct. We discuss 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.
Item Type:Article
Copyright:© 1998 Elsevier Science
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page