Package org.rascalmpl.parser.gtd.util

Examples of org.rascalmpl.parser.gtd.util.IntegerList

316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
  /**
   * Part of the hidden-right-recursion fix.
   * Executes absent reductions.
   */
  private void propagateReductions(AbstractStackNode<P> node, AbstractNode nodeResultStore, AbstractStackNode<P> next, AbstractNode nextResultStore, int potentialNewEdges){
    IntegerList propagatedReductions = next.getPropagatedReductions();
   
    IntegerObjectList<EdgesSet<P>> edgesMap = node.getEdges();
    ArrayList<Link>[] prefixes = node.getPrefixesMap();
   
    P production = next.getParentProduction();
    String name = edgesMap.getValue(0).get(0).getName();
   
    boolean hasNestingRestrictions = hasNestingRestrictions(name);
    IntegerList filteredParents = null;
    if(hasNestingRestrictions){
      filteredParents = getFilteredParents(next.getId());
    }
   
    int fromIndex = edgesMap.size() - potentialNewEdges;
View Full Code Here
518
519
520
521
522
523
524
525
526
527
528
    P production = node.getParentProduction();
    String name = edgesMap.getValue(0).get(0).getName();
   
    // Check for nesting restrictions.
    boolean hasNestingRestrictions = hasNestingRestrictions(name);
    IntegerList filteredParents = null;
    if(hasNestingRestrictions){
      filteredParents = getFilteredParents(node.getId());
    }
   
    for(int i = edgesMap.size() - 1; i >= 0; --i){
View Full Code Here
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
 
  /**
   * Initiates the handling of reductions for nullable symbols.
   */
  private void updateNullableEdges(AbstractStackNode<P> node, AbstractNode result){
    IntegerList propagatedReductions = node.getPropagatedReductions();
   
    int initialSize = propagatedReductions.size();
   
    IntegerObjectList<EdgesSet<P>> edgesMap = node.getEdges();
    ArrayList<Link>[] prefixesMap = node.getPrefixesMap();
   
    P production = node.getParentProduction();
    String name = edgesMap.getValue(0).get(0).getName();
   
    // Check for nesting restrictions.
    boolean hasNestingRestrictions = hasNestingRestrictions(name);
    IntegerList filteredParents = null;
    if(hasNestingRestrictions){
      filteredParents = getFilteredParents(node.getId());
    }
   
    for(int i = edgesMap.size() - 1; i >= 0; --i){
View Full Code Here
717
718
719
720
721
722
723
724
725
  /**
   * Returns the list of start location for which the results have already
   * been propagated (hidden-right-recursion specific).
   */
  public IntegerList getPropagatedReductions(){
    if(propagatedReductions == null) propagatedReductions = new IntegerList();
   
    return propagatedReductions;
  }
View Full Code Here
TOP

Related Classes of org.rascalmpl.parser.gtd.util.IntegerList

  • org.rascalmpl.parser.gtd.SGTDBF
  • org.rascalmpl.parser.gtd.stack.AbstractStackNode
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.