Sciweavers

TCS
1998
13 years 4 months ago
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 pars...
Klaas Sikkel
ACL
1989
13 years 6 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
13 years 8 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...