Sciweavers

73 search results - page 8 / 15
» Recursion and grammars for CS2
Sort
View
PASTE
2010
ACM
13 years 11 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
ENTCS
2000
103views more  ENTCS 2000»
13 years 9 months ago
Combinator Parsers - From Toys to Tools
We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left...
S. Doaitse Swierstra
ACL
1997
13 years 11 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
AMAI
1998
Springer
13 years 9 months ago
Generalization and Specialization Strategies for Learning r.e. Languages
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...
Sanjay Jain, Arun Sharma
EPIA
1995
Springer
14 years 1 months ago
Using Stochastic Grammars to Learn Robotic Tasks
Abstract. The paper introduces a reinforcement learning-based methodology for performance improvement of Intelligent Controllers. The translation interfaces of a 3-level Hierarchic...
Pedro U. Lima, George N. Saridis