Chuck Liang. A deterministic shift-reduce parser generator for a logic programming language. In J. Lloyd et al., editors, Proceedings of the First International Conference on Computational Logic --- CL 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Compiler Construction in Higher Order Logic Programming - Liang (2002) (4 citations) Self-citation (Liang) (Correct)
....general compiler writing, they must still be extended to the higher order case, with richer constructs. Attempts to thus extend DCGs exist [8, 19] but they have not led to any usable tools. A deterministic, bottom up parser generator has recently been developed for Prolog, and is described in [23]. The parser generator requires a di erent restriction of LR grammars than the LALR grammars used in other Yacc style tools. It requires the user to write a few more productions: the grammar used in our compiler required eight more productions (out of approximately seventy) compared to traditional ....
C. Liang. A deterministic shift-reduce parser generator for a logic programming language. In Computational Logic - CL
Reasoning About Logic Programs Using Definitions And Induction - Wajs (2002) (2 citations) (Correct)
No context found.
Chuck Liang. A deterministic shift-reduce parser generator for a logic programming language. In J. Lloyd et al., editors, Proceedings of the First International Conference on Computational Logic --- CL 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