824 search results - page 4 / 165 » Constructing Functional Programs for Grammar Analysis Proble... |
ASE
2004
13 years 7 months ago
2004
Abstract. The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory acce...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntaxdirected analysis and translation. In particular, we address the pro...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
GECCO
2009
Springer
13 years 5 months ago
2009
Springer
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...
WIA
1997
Springer
13 years 11 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...