Sciweavers

1942 search results - page 22 / 389
» Parse
Sort
View
ICFP
2002
ACM
14 years 11 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
DLT
2010
14 years 12 days ago
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm
Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer a...
Alexander Okhotin
CASCON
2006
117views Education» more  CASCON 2006»
14 years 10 days ago
A backtracking LR algorithm for parsing ambiguous context-dependent languages
Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous co...
Adrian D. Thurston, James R. Cordy
ACL
1993
14 years 8 days ago
Towards History-Based Grammars: Using Richer Models for Probabilistic Parsing
We describe a generative probabilistic model of natural language, which we call HBG, that takes advantage of detailed linguistic information to resolve ambiguity. HBG incorporates...
Ezra Black, Frederick Jelinek, John D. Lafferty, D...
ACL
1990
14 years 3 days ago
Deterministic Left to Right Parsing of Tree Adjoining Languages
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
Yves Schabes, K. Vijay-Shanker