M. Sperber and P. Thiemann. Generation of LR parsers by partial evaluation. ACM Transactions on Programming Languages and Systems, 22(2):224--264, Mar. 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Constructing Tournament Representations: An exercise in pointwise.. - Hinze (2002) (4 citations) (Correct)
....pre x of a sentential form. In the case of an expression grammar this stack corresponds to the right spine representation of a tree. Our algorithm can be seen as a stack free implementation of the parsing algorithm, where the stack is implicitly represented by the recursion stack, see also [21, 13]. List comprehensions, which are due to Burstall and Darlington, were incorporated in several non strict functional languages such as KRC, Miranda, and Haskell. Wadler generalized list comprehensions to monad comprehensions [27] List and set comprehensions also appear in several textbooks on ....
Michael Sperber and Peter Thiemann. Generation of LR parsers by partial evaluation. ACM Transactions on Programming Languages and Systems, 22(3):224-264, 2000.
Program Generation, Termination, and Binding-time Analysis - Jones, Glenstrup (2002) (Correct)
.... Tempo systems [16] Further, Schultz has succeeded in doing Java specialization by translating to C, using the Tempo system, and the translating back [61] There have been a number of practically useful applications of partial evaluation, many exploiting its ability to build program generators [32, 40, 52, 45, 67]. Partial evaluation also has some weaknesses. One is that speedups are at most linear in the subject program s runtime (although the size of the constant coecient can be a function of the static input data. Further, its use can be delicate: Obtaining good speedups requires a close knowledge of ....
Michael Sperber and Peter Thiemann. Generation of LR parsers by partial evaluation. ACM Transactions on Programming Languages and Systems, 22(2):224-264, March 2000.
Parameterized LR Parsing - Thiemann, Neubauer (2004) Self-citation (Thiemann) (Correct)
No context found.
M. Sperber and P. Thiemann. Generation of LR parsers by partial evaluation. ACM Transactions on Programming Languages and Systems, 22(2):224--264, Mar. 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC