> Consider making use of this segment pattern matching in a recursive
> function
> analyzing a define like construct. you would have something like
> [@Args -> Code where Where @Rest] -> ...
> I think that the @Rest segment can be optimized and should be treated
> specially
> by the underlying segment matcher (just like a |L]) there is some more
> options
> to make it speedier but I think that this is the most common case and
> that the rest
> of the cases can be well served by Marks code.
> /Stefan
> On 4 July, 23:43, Mark Tarver <dr.mtar...@ukonline.co.uk> wrote:
> > Yep; saw that one a few days ago but have been involved in other
> > things. I'll look it over. Looks like it should have a G on it.
> > Mark
> > On 4 July, 21:58, snorgers <stefan.ta...@spray.se> wrote:
> > > Nice work,
> > > But I have to point to
> > > Fun [G | Rule] -> (let Yacc (yacc-function2 Fun)
> > > (s-y-r [G | Rule])) where (=
> > > (qi::grammar_symbol? G) T)
> > > and
> > > define yacc-function2
> > > Fun G -
> > > You have two arguments to yacc-function2 but calls it with one
> > > argument!
> > > /Stefan
> > > On 29 June, 14:09, Mark Tarver <dr.mtar...@ukonline.co.uk> wrote:
> > > >http://www.lambdassociates.org/Lib/libraries.htm
> > > > look at 'Patterns'
> > > > Mark- Hide quoted text -
> > > - Show quoted text -
|
