Re: Can awk easily simulate an AFSM

Jürgen Kahrs wrote:
> problems@[EMAIL PROTECTED]
 schrieb:
> 
>>As I remember, at the branch-points a one token look ahead
>>only was needed for the pascal-like syntax. 
> 
> Yes, it was called the LL(1). Wirth always designed
> his languages so that they can be parsed with a
> lookahead of one symbol.

Not sure what you are referring to when saying "it" (since that is a
parser type I assume the one that Wirth predominantly used? - as done
in his little booklet about compiler construction), but note that a
(more powerful) LR(1) parser has also a lookahead of one (and can be
used to parse a larger set of grammers than with the LL(1) parsers).
The LL(1) grammar allows to use a primitive recursive descent parser;
that was primarily the simplifying part of the approach, not so much
the lookahead per se.

Janis