splitting grammars in LL / LR / Backtrack / ...

Michiel Koens <koens@natlab.research.philips.com>
29 Apr 1996 23:15:26 -0400

          From comp.compilers

Related articles
splitting grammars in LL / LR / Backtrack / ... koens@natlab.research.philips.com (Michiel Koens) (1996-04-29)
Re: splitting grammars in LL / LR / Backtrack / ... solution@gate.net (1996-04-30)
Re: splitting grammars in LL / LR / Backtrack / ... k3is@unb.ca (1996-04-30)
Re: splitting grammars in LL / LR / Backtrack / ... clark@zk3.dec.com (Chris Clark USG) (1996-05-01)
Re: splitting grammars in LL / LR / Backtrack / ... dodd@csl.sri.com (1996-05-01)
Re: splitting grammars in LL / LR / Backtrack / ... parrt@lonewolf.parr-research.com (1996-05-10)
Re: splitting grammars in LL / LR / Backtrack / ... jlilley@ix.netcom.com (1996-05-19)
| List of all articles for this month |

From: Michiel Koens <koens@natlab.research.philips.com>
Newsgroups: comp.compilers
Date: 29 Apr 1996 23:15:26 -0400
Organization: Philips Research Laboratories
Keywords: parse, question

I wonder if it is possible to split a grammar into seperately parsable
parts to 'isolate' the parts that are not parsable with an LL(1) or
LR(1) parser. This way, a parse-function could parse a grammar mainly
using a cheap parsing strategy and call more general (=expensive)
parse-functions only for those parts that need the more general
techniques. Are there any tools for this?


I know that several tools generate C or C++ functions that parse a
part of a grammar and that different tools use different parse
strategies, but probably functions generated by different tools are
hard to combine. Does anyone know more about this? Or are there any
helpful links to pages/articles/books?


Thanks in advance,
Mic


        M.J. Koens Philips Research Laboratories
        Phone: +31-40-2742026 E-mail: koens@natlab.research.philips.com
[Sounds intractable to me. -John]


--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.