S. Hill. Combinators for parsing expressions. J. Functional Programming, 6(3):445-464, May 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....data structures and formal language semantics, are reported. With respect to the use of functional languages in compiling, most of the publications are related to parsing, an area where functional languages have shown to be very expressive [Hut92] LAA92] Lee93] ST95] Fok95] SD96] Hil96] KP98] Bir98] Also, lexical and syntactical analyzer generators, such as Alex [Dor97] and Happy [GM96] producing functional code have been written. This facilitates that practical work of students can be done in a functional setting. The only work known to the author where a complete ....

....a DFA can be used as a source of inspiration or as study material. More will be said about it in Section 5. 3.3 Parsing A lot of written material material about using FL s for parsing exists. Part of it refers to the parser combinator technique in its various versions [Hut92] Fok95] SD96] Hil96] KP98] Bir98] As we are more interested in expressing concepts in a compact and easy way than in getting very efficient compilers, we use [Fok95] as the basis for explaining the functional implementation of recursive descent parsers for LL(1) grammars. The main advantage of this technique is, ....

S. Hill. Combinators for Parsing Expressions. Journal on Functional Programming, 6(3):445--463, 1996.

....sequential process and incorporate, at the same time, the flow of information. Complex parsers are constructed by combining the atomic parsers given in the library using special higher order functions. Several extensions on the basic library exist, most notably a support to parse expressions ([16]) The main advantage of the parser monad approach is that it is easy to use. A formal definition of a context free grammar is very close to the resulting Haskell code. We have therefore chosen parser monads for implementing the syntactic part of the SLC specification language compiler. Given a ....

S. Hill. Combinators for parsing expressions. Journal of Functional Programming, 6(3):445--463, May 1996.

....1: Definition in SDF of the syntax of (highly simplified) Haskell types. and the semantic actions in terms of the underlying programming language. All parser combinator libraries known to us enable the construction of top down parsers. These are either deterministic [20] or non deterministic [10, 6, 9]. Hence, they are restricted to LL(1) or LL(k) grammars. They are unable to handle left recursive rules or cyclic grammars. As syntax definition formalisms, combinator libraries are highly impure. Happy [15] and ML Yacc [18] are parser generators for Haskell and ML, respectively. They are both ....

.... Conid Conop B.2 Module Haskell Lexical Syntax imports Haskell Layout exports sorts Small ASCsmall Large ASClarge Symbol ASCsymbol Digit lexical syntax ASCsmall Small [a z] ASCsmall ASClarge Large [A Z] ASClarge ASCsymbol Symbol [ # . nnjn ] ASCsymbol [0 9] Digit B.3 Module Haskell Layout imports Layout exports lexical syntax [ nn] nn] nn] LAYOUT [nn] LAYOUT [n ] H CChar [g] H CChar f H CChar g LAYOUT 15 C Syntax Definition of HASDF This appendix contains the syntax definition of HASDF. This syntax ....

Steve Hill. Combinators for parsing expressions. Journal of Functional Programming, 6(3):445-- 463, 1996.

....sequential process and incorporate, at the same time, the flow of information. Complex parsers are constructed by combining the atomic parsers given in the library using special higher order functions. Several extensions on the basic library exist, most notably a support to parse expressions ([16]) The main advantage of the parser monad approach is that it is easy to use. A formal definition of a context free grammar is very close to the resulting Haskell code. We have therefore chosen parser monads for implementing the syntactic part of the SLC specification language compiler. Given a ....

S. Hill. Combinators for parsing expressions. Journal of Functional Programming, 6(3):445--463, May 1996.

....implementing parsers from given grammars has been legendary in the functional programming community for quite a while. We have actually used this principle successfully in the teaching of parsing concepts to students for many years [23] Detailed descriptions of such techniques are given e.g. in [13, 14, 12, 22] (where further references can be found as well) 2 We essentially use the notation of the functional language Opal [24, 10, 11, 26] slightly enriched in order to increase flexibility. But it should be noted that the code would look essentially the same in other functional languages such as Ml, ....

S. Hill. Combinators for parsing expressions. J. Functional Programming, 6(3):445--464, May 1996.

....part of the definition where both the rewrite rules and the equations employ the syntax of the specification language. Both parsers are implemented using the parser combinator library ( 24] and the extensions for operator precedences and automatic elimination of left linear rules proposed in [25]. Using the transient parser, the semantic rules and equations of the definition are parsed. Instead of generating code for rewriting according to the given rules, we employ ELAN ( 26] for our prototype implementation. ELAN is a general purpose rewrite system which supports AC rewriting. Thus ....

Steve Hill, "Combinators for parsing expressions," Journal of Functional Programming, vol. 6, no. 3, pp. 445--463, May 1996.

No context found.

S. Hill. Combinators for parsing expressions. J. Functional Programming, 6(3):445-464, May 1996.

No context found.

Hill, S., Combinators for parsing expressions, Journal of Functional Programming 6 (1996), pp. 445--463. 18

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