Class org.as2lib.regexp.node.GroupCurly

Description

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.

Method Index

new GroupCurly()
match(), study()

Inherited from Node

Inherited from BasicClass

Constructor Detail

GroupCurly

public function GroupCurly(node:Node, cmin:Number, cmax:Number, type:Number, local:Number, group:Number)

Method Detail

match

public function match(matcher:Object, i:Number, seq:String):Boolean

Description copied from Node

This method implements the classic accept node.

Overrides

match() in org.as2lib.regexp.node.Node

study

public function study(info:TreeInfo):Boolean

Description copied from Node

This method is good for all zero length assertions.

Overrides

study() in org.as2lib.regexp.node.Node