home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!decwrl!sdd.hp.com!zaphod.mps.ohio-state.edu!saimiri.primate.wisc.edu!ames!agate!doc.ic.ac.uk!uknet!glasgow!jl
- From: jl@dcs.glasgow.ac.uk (John Launchbury)
- Newsgroups: comp.lang.functional
- Subject: Re: Functional Parsers
- Keywords: parsers
- Message-ID: <Bx923M.K82@dcs.glasgow.ac.uk>
- Date: 5 Nov 92 15:38:09 GMT
- References: <BEVAN.92Nov1141304@otter.cs.man.ac.uk> <1992Nov3.145117.21227@eng.cam.ac.uk> <1992Nov3.160104.5305@odin.diku.dk> <1992Nov4.153220.8174@eng.cam.ac.uk>
- Organization: Glasgow University Computing Science Dept.
- Lines: 15
-
- I am amazed that after more than half a dozen articles on functional
- parsers that no-one has referred to the literature. The standard
- technique goes back to Landin and Burge and is described in Burge's
- old book 'Recursive Programming Techniques'. Phil Wadler explored
- it in the setting of a more modern functional language in 'How
- to Replace Failure with a List of Successes' (FPCA 85, LNCS 201, S-V).
- An application of the technique to parsing natural language occurs
- in a joint paper by Frost and Launchbury, 'Constructing Natural
- Language Interpreters in a Lazy Functional Language' (Computer
- Journal - special issue on Lazy Evaluation ed. P.Wadler, Vol 3
- No. 2, 1989). The technique has continued to be developed and
- used by many people, and I believe the Journal of Functional
- Programming is about to publish something by Hutton.
-
- John.
-