73 search results - page 4 / 15 » Recursion and grammars for CS2 |
IMCSIT
2010
13 years 7 months ago
2010
This paper describes an application for computing first-order semantic representations of English texts. It is based on a combination of hybrid shallow-deep components arranged wit...
FLAIRS
2003
13 years 11 months ago
2003
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
SAS
1999
Springer
14 years 2 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
GPEM
2006
13 years 9 months ago
2006
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software ree...
ANLP
2000
13 years 11 months ago
2000
A long-standing issue regarding algorithms that manipulate context-free grammars (CFGs) in a "top-down" leftto-right fashion is that left recursion can lead to nontermin...