Field Detail

• recPrimaryAlts

  public List<LeftRecursiveRuleAltInfo> recPrimaryAlts

• recOpAlts

  public OrderedHashMap<Integer,LeftRecursiveRuleAltInfo> recOpAlts

• originalAST

  public RuleAST originalAST

• leftRecursiveRuleRefLabels

  public List<<any>> leftRecursiveRuleRefLabels

  Did we delete any labels on direct left-recur refs? Points at ID of ^(= ID el)

Constructor Detail

• LeftRecursiveRule

  public LeftRecursiveRule(Grammar g,
                           String name,
                           RuleAST ast)

Method Detail

• hasAltSpecificContexts

  public boolean hasAltSpecificContexts()

• getOriginalNumberOfAlts

  public int getOriginalNumberOfAlts()

  Description copied from class: Rule
  Used for recursive rules (subclass), which have 1 alt, but many original alts

• getOriginalAST

  public RuleAST getOriginalAST()

• getUnlabeledAltASTs

  public List<AltAST> getUnlabeledAltASTs()

• getPrimaryAlts

  public int[] getPrimaryAlts()

  Return an array that maps predicted alt from primary decision to original alt of rule. For following rule, return [0, 2, 4] e : e '*' e | INT | e '+' e | ID ; That maps predicted alt 1 to original alt 2 and predicted 2 to alt 4.

  Since:

  4.5.1

• getRecursiveOpAlts

  public int[] getRecursiveOpAlts()

  Return an array that maps predicted alt from recursive op decision to original alt of rule. For following rule, return [0, 1, 3] e : e '*' e | INT | e '+' e | ID ; That maps predicted alt 1 to original alt 1 and predicted 2 to alt 3.

  Since:

  4.5.1

• getAltLabels

  public Map<String,List<<any>>> getAltLabels()

  Get -> labels from those alts we deleted for left-recursive rules.