J. Cohen and T. J. Hickey, "Parsing and Compiling Using Prolog." ACM Trans. on Prog. Lang. and Sys. 9, 2 (April 1987), pp. 125-163. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Translator-Based Multiparadigm Programming - Horspool, Levy (1993) (4 citations) (Correct)
....for a conventional target 14 computer turn out to be very easy to express as logic programming rules. Furthermore, most standard peephole optimizations can be described using additional rules. Simple Prolog implementations for both code generation and peephole optimization are given in [5]. A less direct approach for code generation has been described by Ganapathi [9] He gives a two phase technique which has the advantage of allowing the code generation rules to be given independently of the AST format. Some sample Prolog rules that might be used to define translation of the ....
J. Cohen and T. J. Hickey, "Parsing and Compiling Using Prolog." ACM Trans. on Prog. Lang. and Sys. 9, 2 (April 1987), pp. 125-163.
Logic and the Structure of Space - Towards a Visual Logic for.. - Meyer (1993) (Correct)
....their early days logic programming techniques have been used as a tool for the description, specification, and analysis of languages, in the area of formal languages as well as for natural languages. Even entire compilers have been built on the basis of techniques like Definite Clause Grammars [War80, CH87]. In the last decade the range of languages used for human computer interaction has been broadened. Today visual languages, i.e. languages that utilize diagrams or other spatial, graphical representations, are becoming more and more important. Clearly, a formal framework for the development of ....
Jacques Cohen and Timothy J. Hickey. Parsing and Compiling Using Prolog. In ACM Transactions on Programming Languages and Systems, Vol. 9, No. 2, 1987, pp. 125 --- 163.
Functional-Logic Parsers In TOY - Roldán, Fraguas (1998) (Correct)
....FP and LP) have considered different approaches to the parsing problem. We will first survey the main characteristics of parsing in each paradigm. 1.2 The Logic Programming approach. Language processing has been very related to LP since its origins. There is a more or less standard approach [War80, CH87, SS86] to the construction of parsers in LP, which is based on a specific representation for grammars, the socalled Definite Clause Grammars (DCG s) PW80, SS86] DCG s are not logic programs, although they are readily translated to them. With DCG s, one can hide the details of handling the input ....
J. Cohen, T. Hickey. Parsing and Compiling using Prolog, ACM TOPLAS 9 (2), 1987, 125--163.
Declarative Internet Programming Constraint-based Optimization of .. - Hickey (1999) Self-citation (Hickey) (Correct)
....most likely go into developing a rigorous foundation for partial evaluation of JS and implementing these ideas in a JS optimizer. We will also consider other optimizations and in particular will apply some of the abstract interpretation techniques that we have used successfully in other contexts [16, 32, 3] to the problem of JS type inference. Time permitting, we may also investigate the problem of developing tools to estimate JS program performance using techniques developed in our work on microanalysis [2, 9, 11] 9 1.7 Applications of JS to Undergraduate SMET Education The JS project has grown ....
J. Cohen, T. Hickey, "Parsing and Compiling Using Prolog," ACM Transactions on Programming Languages and Systems, 125-163, 1987
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