[Date Prev][Date Next][Thread Prev][Thread Next]
[Date Index]
[Thread Index]
- Subject: Re: LPEG and token lists
- From: spir <denis.spir@...>
- Date: Tue, 16 Mar 2010 12:28:30 +0100
On Tue, 16 Mar 2010 03:49:19 -0700
Wesley Smith <wesley.hoke@gmail.com> wrote:
> actually, that's not quite what I'm looking for. I realized that I'm
> not going to be able to do what I was trying and have instead
> restructured the problem by writing 2 grammars and combining/operating
> on them before running any matching.
>
> wes
Note that PEG grammars can be composed. Meaning that a higher level grammar building on lower level ones simply is a bigger grammar. (The same is true for patterns: a grammar is [equivalent to] a top level pattern.)
Denis
________________________________
vit e estrany
spir.wikidot.com