1  /*
     2   * Copyright the original author or authors.
     3   * 
     4   * Licensed under the MOZILLA PUBLIC LICENSE, Version 1.1 (the "License");
     5   * you may not use this file except in compliance with the License.
     6   * You may obtain a copy of the License at
     7   * 
     8   *      http://www.mozilla.org/MPL/MPL-1.1.html
     9   * 
    10   * Unless required by applicable law or agreed to in writing, software
    11   * distributed under the License is distributed on an "AS IS" BASIS,
    12   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    13   * See the License for the specific language governing permissions and
    14   * limitations under the License.
    15   */
    16   
    17  import org.as2lib.regexp.node.Node; 
    18  import org.as2lib.regexp.node.Loop;
    19  import org.as2lib.regexp.node.TreeInfo;
    20  
    21  /**
    22   * {@code Prolog} sets up a loop to handle a recursive quantifier structure.
    23   * 
    24   * @author Igor Sadovskiy
    25   */
    26  
    27  class org.as2lib.regexp.node.Prolog extends Node {
    28      
    29      private var loop:Loop;
    30      
    31      public function Prolog(loop:Loop) {
    32          this.loop = loop;
    33      }
    34      
    35      public function match(matcher:Object, i:Number, seq:String):Boolean {
    36          return loop.matchInit(matcher, i, seq);
    37      }
    38      
    39      public function study(info:TreeInfo):Boolean {
    40          return loop.study(info);
    41      }
    42      
    43      public function getLoop(Void):Loop {
    44      	return loop;
    45      }
    46  }
    47  
    48
as2api