On Mar 10, 2009, at 11:01 PM, Jake Donham wrote:

> An approach
> that works for me is to think "recursive descent" and always give
> rules that check at least one token before branching to another rule.


Something like this then?

   sellMethod:
   [
     [ "Next"; "Bar"; at = OPT "At$"; e = expr;
       f = [ [ "Stop" | "Lower" ] -> fun x -> Stop x
           | [ "Limit" | "Higher" ] -> fun x -> Limit x
           ] -> (f e, at)
     ]
   ];


---
http://tinyco.de
--- Mac & iPhone