Re: Functional Parsers

Article View: comp.lang.functional

Article #23

Back to comp.lang.functional Previous Next

#23

From: Horst Hogenkamp
Date: Fri, 30 Oct 1992 10:41

12 lines
1085 bytes

In article <1992Oct29.095529.17894@Informatik.TU-Muenchen.DE>, nipkow@Informatik.TU-Muenchen.DE (Tobias Nipkow) writes:
> 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.

lazy or eager?

I am considering to implement an LR(0) parser generator.

Horst Hogenkamp
.

Technical Details

Message-ID: <BwxKCs.3KF@hermes.hrz.uni-bielefeld.de>

Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!Germany.EU.net!news.uni-bielefeld.de!techfak.uni-bielefeld.de!horst

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

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.functional
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!Germany.EU.net!news.uni-bielefeld.de!techfak.uni-bielefeld.de!horst
From: horst@techfak.uni-bielefeld.de (Horst Hogenkamp)
Subject: Re: Functional Parsers
Sender: news@hermes.hrz.uni-bielefeld.de (News Administrator)
Message-ID: <BwxKCs.3KF@hermes.hrz.uni-bielefeld.de>
Date: Fri, 30 Oct 1992 10:41:16 GMT
References:  <1992Oct29.095529.17894@Informatik.TU-Muenchen.DE>
Nntp-Posting-Host: rose.techfak.uni-bielefeld.de
Organization: Universitaet Bielefeld, Technische Fakultaet.
Lines: 12

Reply to Parent Message