Related articles |
---|
LL information d95-nll@sm.luth.se (Niklas Lundell) (1999-03-09) |
Re: LL information jamz@my-dejanews.com (1999-03-10) |
Re: LL information napi@cel.mimos.my (1999-03-10) |
Re: LL information adrian@dcs.rhbnc.ac.uk (1999-03-22) |
Re: LL information cspt@giraffe.ru.ac.za (Pat Terry) (1999-03-23) |
From: | adrian@dcs.rhbnc.ac.uk (A Johnstone) |
Newsgroups: | comp.compilers |
Date: | 22 Mar 1999 01:14:03 -0500 |
Organization: | Royal Holloway, University of London |
References: | 99-03-032 |
Keywords: | LL(1) |
Niklas Lundell (d95-nll@sm.luth.se) wrote:
: I am using a LL grammar for my project and was wondering if there exist
: a tool that given a LL grammar outputs the FIRST and FOLLOW sets?
Our RDP parser generator has a -E (extended listing) option that
(amongst other things) gives the First and Follow sets for each
rule. RDP also supports a highly extended BNF. Look at
http://www.dcs.rhbnc.ac.uk.ac/research/languages
Adrian
--
Dr Adrian Johnstone, Senior Lecturer in Computing, Computer Science Dep,
Royal Holloway, University of London, Egham, Surrey, TW20 0EX, England.
Email a.johnstone@rhbnc.ac.uk Tel:+44(0)1784 443425 Fax:+44(0)1784 439786
Return to the
comp.compilers page.
Search the
comp.compilers archives again.