Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

TCS
1998

favoriteEmaildiscussreport

100views Theoretical Computer Science» more TCS 1998»

Parsing Schemata and Correctness of Parsing Algorithms

13 years 4 months ago

Parsing Schemata and Correctness of Parsing Algorithms

Download wwwhome.cs.utwente.nl

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.

Klaas Sikkel

Real-time Traffic

Parsers | Parsing | Parsing Schema | TCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» A Deductive Approach to Dependency Parsing

» Generation of Indexes for Compiling Efficient Parsers from Formal Specifications

» Compiling Declarative Specifications of Parsing Algorithms

» Parsing Schemata for Grammars with Variable Number and Order of Constituents

» Errorrepair parsing schemata

» Verified Executable Parsing

» A parsing machine for PEGs

» Detecting and Parsing Architecture at City Scale from Range Data

» Semantics and Algorithms for Datadependent Grammars

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TCS
Authors	Klaas Sikkel

Comments (0)