public boolean isParserRuleCallOptional() { if (ruleCallOptional == null) ruleCallOptional = isParserRuleCall() && isOptional(((RuleCall) element).getRule().getAlternatives()); return ruleCallOptional; } }
protected List<MatcherTransition> findTransitionsToToken(MatcherState from, Set<MatcherState> targets, boolean returning, boolean canReturn, Set<MatcherState> visited) { if (!visited.add(from)) return Collections.emptyList(); if (targets != null && targets.contains(from)) targets = null; List<MatcherTransition> result = Lists.newArrayList(); for (MatcherTransition transition : returning ? from.getOutgoingAfterReturn() : from.getOutgoing()) { if (transition.getTarget().isParserRuleCall()) result.addAll(findTransitionsToToken(transition.getTarget(), targets, false, transition.getTarget() .isParserRuleCallOptional(), visited)); else if (targets == null || targets.contains(transition.getTarget())) result.add(transition); } if (canReturn && from.isEndState()) for (MatcherState caller : findRuleCallsTo(GrammarUtil.containingRule(from.getGrammarElement()), Sets.<AbstractRule> newHashSet())) result.addAll(findTransitionsToToken(caller, targets, true, true, visited)); return result; }
if (transition.getTarget().getGrammarElement() == to) return Tuples.create(Collections.singletonList(transition), Collections.singletonList(from)); else if (transition.getTarget().isParserRuleCall()) { ruleCallStack.push(transition.getTarget()); Pair<List<MatcherTransition>, List<MatcherState>> next = findTransitionPath(
protected void installBetween(IBetweenElements pattern, AbstractElement first, AbstractElement second) { Set<MatcherState> sources = getAllStates(first); Set<MatcherState> targets = getAllStates(second); for (MatcherState target : targets) target.getBeforeBetweenElements().add(pattern); for (MatcherState source : sources) { source.getAfterBetweenElements().add(pattern); for (MatcherTransition transition : findTransitionsToToken(source, targets, source.isParserRuleCall(), true, Sets.<MatcherState> newHashSet())) { if (transition.getSource() == source) transition.addPattern(pattern); else transition.addPattern(source, pattern); } } }
protected void installAfter(IAfterElement pattern) { Set<MatcherState> states = getAllStates(pattern.matchAfter()); AbstractRule rule = GrammarUtil.containingRule(pattern.matchAfter()); for (MatcherState state : states) { state.getAfterPatterns().add(pattern); for (MatcherTransition out : state.isParserRuleCall() ? state.getOutgoingAfterReturn() : state .getOutgoing()) if (pattern.matchAfter() == out.getLoopCenter() || !states.contains(out.getTarget())) out.addPattern(pattern); if (state.isEndState()) for (MatcherState caller : findRuleCallsTo(rule, Sets.<AbstractRule> newHashSet())) for (MatcherTransition afterReturn : caller.getOutgoingAfterReturn()) afterReturn.addPattern(state, pattern); } }