Re: Token sequences

[Frank Heckenbach]

Carl Cerecke wrote:

> Frank Heckenbach wrote:
> > Is there some way (using Bison, Bison's verbose output and/or
> > additional tools) to find out whether some given sequence of tokens
> > can occur in the language defined by a given grammar)?
> > 
> > Ideally, such a tool would construct an input sentence that contains
> > this sequence, but that's not so important for me. Actually I'm more
> > interested in the negative answers -- confirming my assumption that
> > some sequences do not occur to get a better understanding of a given
> > grammar.
> > 
> > (E.g., the sequence `+', `*' does not occur in arithmetic
> > expressions, but it does in C because of the several meanings of
> > `*'.)
> 
> You could try the paper:
> 
> "Recognizing Substrings of LR(k) Languages in Linear Time"
> by Joseph Bates and Alon Lavie.
> ACM Transactions on Programming Languages and Systems
> 1994
> Vol. 16, No. 4, p 1051-1077

Thanks, I'll try to get it.

Frank

-- 
Frank Heckenbach, address@hidden
http://fjf.gnu.de/
GnuPG and PGP keys: http://fjf.gnu.de/plan (7977168E)