Simon L. Peyton Jones. Yacc in Sasl -- an exercise in functional programming. Software-- Practice and Experience, 15(8):807--820, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Bottom-Up Grammar Analysis - A Functional Formulation - - Jeuring, Swierstra (1994) (3 citations) (Correct)
....of a fixed point solution emerge as a byproduct of this derivation. Finally we give the implementation of the derived algorithm in the functional language Gofer [5, 3] Incorporating the functions for solving grammar analysis problems in parser generators such as a functional version of Yacc [10] and Ratatosk [8] would reduce the amount of code used in, and very likely increase the speed of, these parser generators. This paper is organised as follows. Section 2 defines the datatypes that are used in manipulating grammars in Gofer. Section 3 introduces some necessary concepts of lattice ....
Simon L. Peyton Jones. Yacc in Sasl -- an exercise in functional programming. Software-- Practice and Experience, 15(8):807--820, 1985.
A Trace Browser for a Lazy Functional Language - Watson, Salzman (1997) (Correct)
....to learn and debug. While the conciseness, strong typing and expressiveness of these languages eases program development and reduces the probability of program errors, debugging an erroneous program can be difficult, a problem recognised early in the development of lazy functional languages [18, 15]. For instance, side effects are prohibited in a pure language so adding debugging statements, a typical imperative language approach, is not possible. Debugging at the underlying evaluation machine level [24, 20] is also difficult as the structures encountered there are often unrelated to the ....
Simon L. Peyton Jones. Yacc in Sasl -- an exercise in functional programming. Software-- Practice and Experience, Volume 15, Number 8, pages 807--820, August 1985.
Bottom-up Grammar Analysis - A Functional Formulation - Jeuring, Swierstra (1994) (3 citations) (Correct)
....of a fixed point solution emerge as a byproduct of this derivation. Finally we give the implementation of the derived algorithm in the functional language Gofer [5, 3] Incorporating the functions for solving grammar analysis problems in parser generators such as a functional version of Yacc [10] and Ratatosk [8] would reduce the amount of code used in, and very likely increase the speed of, these parser generators. This paper is organised as follows. Section 2 defines the datatypes that are used in manipulating grammars in Gofer. Section 3 introduces some necessary concepts of lattice ....
Simon L. Peyton Jones. Yacc in Sasl -- an exercise in functional programming. Software-- Practice and Experience, 15(8):807--820, 1985.
TIP in Haskell - another exercise in functional programming - Runciman (1991) (1 citation) (Correct)
.... in Haskell another exercise in functional programming Colin Runciman University of York 1 Introduction Several years ago, Peyton Jones [3] tested some of the claims made for functional programming by re implementing a well known parser generator (YACC) in a lazy functional language (SASL) and comparing the result with the original imperative implementation. His conclusions were positive so far as the expressive power of functional ....
S. L. Peyton Jones. YACC in SASL --- an exercise in functional programming. Software --- Practice and Experience, 15(8):807--20, 1985.
Constructing Functional Programs for Grammar Analysis Problems - Jeuring, Swierstra (1995) (2 citations) (Correct)
....this transformation are constructor classes [9] and anamorphisms [13] Since we use constructor classes, we have used Gofer [10] to implement the functions we have derived. Incorporating the functions for solving grammar analysis problems in parser generators such as a functional version of Yacc [20], Ratatosk [15] and Happy [5] would reduce the amount of code used in these parser generators. The complete code constructed in this paper is available by ftp from ftp.cs. chalmers.se. The code can be found in the file pub users johanj ga.gs. This paper is organised as follows. Section 2 ....
Simon L. Peyton Jones. Yacc in Sasl -- an exercise in functional programming. Software--Practice and Experience, 15(8):807--820, 1985.
Bottom-up Grammar Analysis - A Functional Formulation - Jeuring, Swierstra (1994) (3 citations) (Correct)
....why and where conditions are imposed upon the components of the program. Finally we give the implementation of the derived algorithm in the functional language Gofer [7, 3] Incorporating the functions for solving grammar analysis problems in parser generators such as a functional version of Yacc [12], Ratatosk [10] and Happy [4] would reduce the amount of code used in these parser generators. This paper is organised as follows. Section 2 defines the datatypes that are used in manipulating grammars in Gofer. Section 3 introduces the concepts of lattice theory needed in the subsequent ....
Simon L. Peyton Jones. Yacc in Sasl -- an exercise in functional programming. Software--Practice and Experience, 15(8):807--820, 1985.
User Manual - Meurig Sage December (Correct)
No context found.
SL Peyton-Jones, Yacc in Sasl - an Exercise in Functional Programming, Software-Practice and Experience, Vol 15(8), Aug 1985.
Non-Strict Languages - Programming and Implementation - Wray, Fairbairn (1994) (17 citations) (Correct)
No context found.
, 807--820, August 1985
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