GroupCurly
handles the curly-brace style repetition with a
specified minimum and maximum occurrences in deterministic cases.
This is an iterative optimization over the Prolog and Loop system
which would handle this in a recursive way. The * quantifier is
handled as a special case. This class saves group settings so that
the groups are unset when backing off of a group match.
public function GroupCurly(node:Node, cmin:Number, cmax:Number, type:Number, local:Number, group:Number)
public function match(matcher:Object, i:Number, seq:String):Boolean