J. Jeuring and S.D. Swierstra. Bottom-up grammar analysis -a functional formulation-. In Donald Sannella, editor, Proceedings Programming Languages and SystemsESOP '94, pages 317--332. Springer-Verlag, LNCS 788, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and then providing alternative implementations of these for the various grammar wide operations, such as validity checking, lookahead calculation and parsing. Our approach is a hybrid of ordinary combinatorbased approaches and those which choose to represent the grammar explicitly, such as [8, 9]. We use the combinators as a front end to the representation of the grammar as an object in our program, and it is this object which is then used as a basis for the remaining grammatical operations. The representation of grammars in our system is given in figure 1. Each grammar consists of a ....

J. Jeuring and D. Swierstra. Bottom-up grammar analysis - a functional formulation. In Donald Sannella, editor, 5th European Symposium on Programming (ESOP '94), volume 788 of Lecture Notes in Computer Science, pages 317-- 332, Edinburgh, UK, April 1994.

No context found.

J. Jeuring and S.D. Swierstra. Bottom-up grammar analysis -a functional formulation-. In Donald Sannella, editor, Proceedings Programming Languages and SystemsESOP '94, pages 317--332. Springer-Verlag, LNCS 788, 1994.

....can derive the empty string, and determining the set of symbols that can appear as the first symbol in a derivation from a nonterminal. These programs are examples of programs that interpret grammars abstractly. More extensive (and complicated) treatments of grammar analysis can be found in [3, 4]. 5 Conclusions and future work We have developed a course on grammars and parsing in which we introduce several advanced abstract programming concepts. Each of these concepts is illustrated or explained with Haskell code. Higher order functions play a crucial role in the course, and it would ....

J. Jeuring and S.D. Swierstra. Bottom-up grammar analysis -a functional formulation-. In Donald Sannella, editor, Proceedings Programming Languages and SystemsESOP '94, pages 317--332. Springer-Verlag, LNCS 788, 1994.

....the solution is a fixed point of this equational system. Moncke and Wilhelm [16] observe this, and give several solutions, depending on the conditions that are satisfied, for such problems. One of the goals of this paper is to derive the solutions given by Moncke and Wilhelm. In a previous paper [7] we study bottom up grammar analysis problems. We derive a function of which the fixed point gives the solution of a bottom up grammar analysis problem. This function is obtained by applying correctness preserving transformations to components of the expression occurring in the specification of ....

....of fixed points. Section 4 defines both top down and bottom up grammar analysis problems, and gives some examples. Section 5 derives a program that can be used to solve top down grammar analysis problems. Section 6 briefly reviews the solution to bottom up grammar analysis problems as described in [7]. Section 7 applies the transformation that avoids rearranging the information to the programs for solving bottom up and top down grammar analysis problems. Section 8 concludes the paper. 2 Datatypes and functions for grammars in Gofer This section defines various functions and datatypes in ....

[Article contains additional citation context not shown here]

J. Jeuring and S.D. Swierstra. Bottom-up grammar analysis --- a functional formulation ---. In Donald Sannella, editor, Proceedings Programming Languages and Systems-ESOP '94, pages 317--332. Springer-Verlag, 1994. LNCS 788.

....the concepts of lattice theory needed in the subsequent sections. Section 4 defines the class of bottom up grammar analysis problems, and gives some examples. Section 5 sketches a derivation of an algorithm that can be used to solve bottom up problems. The complete derivation is given in [6]. Section 6 gives an implementation in Gofer of the datatypes and functions constructed in the previous sections. Section 7 concludes the paper. 2 Datatypes for Grammars in Gofer This section defines various datatypes in Gofer used in analysing and representing grammars. Most of the non standard ....

....False) nt ) r x nt = at x nt r x (N a) N a, r x a) firsts : Eq [ a,Bool) r x (T b) T b, pl b) There are a number of ways in which a more efficient program can be obtained, for example by changing the definition of function lfp. For a discussion on this subject the reader is referred to [6]. 7 Conclusions This paper discusses bottom up grammar analysis problems. We give a very general specification of bottom up grammar analysis problems, and from this specification we derive, by means of program transformation applying laws to the components of the intermediate expressions, an ....

J. Jeuring and S.D. Swierstra. Bottom-up grammar analysis ---a functional formulation---. Technical Report UU-CS-1994-01, Utrecht University, 1994.

No context found.

J. Jeuring and D. Swierstra. Bottom-up grammar analysis---A functional formulation. In D. Sannella, editor, Proc. European Symposium on Programming Languages and Systems (ESOP'94, volume 788 of LNCS, pages 317--332. Springer-Verlag, 1994.

No context found.

J. Jeuring and S.D. Swierstra. Bottom-up grammar analysis | a functional formulation |. In Donald Sannella, editor, Proceedings Programming Languages and Systems, ESOP '94, volume 788 of LNCS, pages 317-332, 1994.

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