Sciweavers

212 search results - page 9 / 43
» Second-Order Simple Grammars
Sort
View
ICFP
2002
ACM
15 years 9 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
CORR
2006
Springer
132views Education» more  CORR 2006»
14 years 9 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
WWW
2002
ACM
14 years 9 months ago
A Query Language for XML Based on Graph Grammars
In this paper we present a graphical query language for XML. The language, based on a simple form of graph grammars, permits us to extract data and reorganize information in a new...
Sergio Flesca, Filippo Furfaro, Sergio Greco
LACL
2005
Springer
15 years 3 months ago
A Polynomial Time Extension of Parallel Multiple Context-Free Grammar
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
Peter Ljunglöf
ACL
1996
14 years 11 months ago
Efficient Normal-Form Parsing for Combinatory Categorial Grammar
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
Jason Eisner