Re: substring parsing

Jan.Rekers@cwi.nl (Jan Rekers)
Tue, 2 Jun 1992 09:47:33 GMT

          From comp.compilers
Related articles
Convincing an LR parser to emit fragments? miles@minster.york.ac.uk (1992-05-26)
substring parsing miles@minster.york.ac.uk (1992-05-29)
Re: substring parsing Jan.Rekers@cwi.nl (1992-06-02)
| List of all articles for this month |
Newsgroups: comp.compilers
From: Jan.Rekers@cwi.nl (Jan Rekers)
Keywords: parse, LALR
Organization: CWI, Amsterdam
References: 92-05-139 92-05-154
Date: Tue, 2 Jun 1992 09:47:33 GMT

You should also have a look at:
@article{RK91,
    author = {J. Rekers and W. Koorn},
    title = {Substring Parsing for Arbitrary Context-Free Grammars},
    journal = {SIGPLAN Notices}, volume = 26, number = 5, pages = {59-66},
     year = 1991}


>From the abstract:


The algorithm for substring recognition presented here accepts general
context-free grammars and uses the same parse tables as the general
context-free parsing algorithm from which it is derived. Substring
recognition can be useful for noncorrecting syntax error recovery and for
incremental parsing. By extending the substring {\em recognizer} with the
ability to generate trees for the possible contextual completions of the
substring, we obtain a substring {\em parser}, which can be used in a
syntax-directed editor to complete fragments of sentences.


This method would allow you to use the LALR states you already have...
--
Jan Rekers (Jan.Rekers@cwi.nl) Centrum voor Wiskunde en Informatica (CWI)
                                                P.O. Box 4079, 1009 AB Amsterdam, The Netherlands
--

Post a followup to this message

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