Class org.as2lib.regexp.node.Prolog

Description

Prolog sets up a loop to handle a recursive quantifier structure.

Method Index

new Prolog()
getLoop(), match(), study()

Inherited from Node

Inherited from BasicClass

Constructor Detail

Prolog

public function Prolog(loop:Loop)

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

getLoop

public function getLoop(Void):Loop