implementation for Parsing Expression Grammar?

[Barb Knox]

In article <48257ab7$0$29576$c83e3ef6 at nn1-read.tele2.net>,
 Lars Rune Nøstdal <larsnostdal at gmail.com> wrote:

> Hi,
> Finite automata works for "nested things".

Only in the special case when the depth of nesting is bounded ahead of 
time.  If it's unbounded then there is an unbounded amount of "stack" 
information that the automaton needs to remember, therefore a finite 
automaton cannot do it.

<pedantry>
That should be "Finite automata WORK ...", since "automata" is plural.
</pedantry>

> http://en.wikipedia.org/wiki/Automata_theory

-- 
---------------------------
|  BBB                b    \     Barbara at LivingHistory stop co stop uk
|  B  B   aa     rrr  b     |
|  BBB   a  a   r     bbb   |    Quidquid latine dictum sit,
|  B  B  a  a   r     b  b  |    altum viditur.
|  BBB    aa a  r     bbb   |   
-----------------------------