11 search results - page 1 / 3 » Compiling Declarative Specifications of Parsing Algorithms |
DEXA
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
EUROCAST
2007
Springer
13 years 8 months ago
2007
Springer
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...
AI
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
POPL
2010
ACM
14 years 1 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
ICOODB
2009
13 years 2 months ago
2009
The integration of database and programming languages is made difficult by the different data models and type systems prevalent in each field. Functional-object query languages con...