Functional Parsers

Article View: comp.lang.functional

Article #17

Back to comp.lang.functional Previous Next

#17

From: Tobias Nipkow
Date: Thu, 29 Oct 1992 09:55

13 lines
998 bytes

I am looking for work on parsers/parser generators for arbitrary context free
grammars (or large subclasses) which are suitable for implementation in a
functional language. My experience is that, for example, Earley's algorithm
is difficult to implement efficiently in a functional language.

I am interested both in literature references and existing code.

The responses will be summarized and posted on this list.

Thanks a lot in advance,

Tobias Nipkow

Technical Details

Message-ID: <1992Oct29.095529.17894@Informatik.TU-Muenchen.DE>

Path:

arc1-ca.pugleaf.net!sparky!uunet!gatech!destroyer!sol.ctr.columbia.edu!ira.uka.de!math.fu-berlin.de!informatik.tu-muenchen.de!nipkow

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.functional
Path: arc1-ca.pugleaf.net!sparky!uunet!gatech!destroyer!sol.ctr.columbia.edu!ira.uka.de!math.fu-berlin.de!informatik.tu-muenchen.de!nipkow
From: nipkow@Informatik.TU-Muenchen.DE (Tobias Nipkow)
Subject: Functional Parsers
Originator: nipkow@sunbroy29.informatik.tu-muenchen.de
Sender: news@Informatik.TU-Muenchen.DE (USENET Newssystem)
Organization: Technische Universitaet Muenchen, Germany
Date: Thu, 29 Oct 1992 09:55:29 GMT
Message-ID: <1992Oct29.095529.17894@Informatik.TU-Muenchen.DE>
Lines: 15