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

....combination of both improvements turn parser combinators from a beautiful toy to a practically applicable tool which can be used for real world applications. The improved parser combinators remain very easy to use and are still able to handle ambiguous grammars. 1 Introduction Parser combinators [3, 6, 5, 8] are a beautiful illustration of the use of higher order functions and currying. By using a small set of parser combinators it becomes possible to construct parsers for ambiguous grammars in a very elegant and clear way. The basis of parser combinators is the list of successes method introduced by ....

....is available to construct parsers, this implies for instance that it is possible to use second order grammars. Finally, there are no problems to transfer parsed items from the parser to the manipulations functions. Conventional parser combinators are described at many places in the literature e.g. [3, 6, 5, 8]. Here we follow the approach outlined in [8] using the functional programming language Clean [11] We restrict ourselves to a small, but complete set of parser combinators to illustrate our improvements. A Parser is a function that takes a list of input symbols as argument and produces a ....

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

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