Package org.stringtemplate.v4.test

Examples of org.stringtemplate.v4.test.TestGroups

166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
        }

        markedStates.add(s); // mark this node as completed.

        // first add this node
        ST stateST;
        if ( s.isAcceptState() ) {
            stateST = stlib.getInstanceOf("stopstate");
        }
        else {
            stateST = stlib.getInstanceOf("state");
        }
        stateST.add("name", getStateLabel(s));
        dot.add("states", stateST);

        if ( s.isAcceptState() )  {
            return; // don't go past end of rule node to the follow states
        }

        // special case: if decision point, then line up the alt start states
        // unless it's an end of block
    if ( ((NFAState)s).isDecisionState() ) {
      GrammarAST n = ((NFAState)s).associatedASTNode;
      if ( n!=null && n.getType()!=ANTLRParser.EOB ) {
        ST rankST = stlib.getInstanceOf("decision-rank");
        NFAState alt = (NFAState)s;
        while ( alt!=null ) {
          rankST.add("states", getStateLabel(alt));
          if ( alt.transition[1] !=null ) {
            alt = (NFAState)alt.transition[1].target;
          }
          else {
            alt=null;
          }
        }
        dot.add("decisionRanks", rankST);
      }
    }

        // make a DOT edge for each transition
    ST edgeST;
    for (int i = 0; i < s.getNumberOfTransitions(); i++) {
            Transition edge = s.transition(i);
            if ( edge instanceof RuleClosureTransition ) {
                RuleClosureTransition rr = ((RuleClosureTransition)edge);
                // don't jump to other rules, but display edge to follow node
                edgeST = stlib.getInstanceOf("edge");
        if ( rr.rule.grammar != grammar ) {
          edgeST.add("label", "<" + rr.rule.grammar.name + "." + rr.rule.name + ">");
        }
        else {
          edgeST.add("label", "<" + rr.rule.name + ">");
        }
        edgeST.add("src", getStateLabel(s));
        edgeST.add("target", getStateLabel(rr.followState));
        edgeST.add("arrowhead", arrowhead);
                dot.add("edges", edgeST);
        walkRuleNFACreatingDOT(dot, rr.followState);
                continue;
            }
      if ( edge.isAction() ) {
        edgeST = stlib.getInstanceOf("action-edge");
      }
      else if ( edge.isEpsilon() ) {
        edgeST = stlib.getInstanceOf("epsilon-edge");
      }
      else {
        edgeST = stlib.getInstanceOf("edge");
      }
      edgeST.add("label", getEdgeLabel(edge));
            edgeST.add("src", getStateLabel(s));
      edgeST.add("target", getStateLabel(edge.target));
      edgeST.add("arrowhead", arrowhead);
            dot.add("edges", edgeST);
            walkRuleNFACreatingDOT(dot, edge.target); // keep walkin'
        }
    }
View Full Code Here
82
83
84
85
86
87
  }

  /** Return a new template instance every time someone tries to print
   *  a Message.
   */
  public ST getMessageTemplate() { return new ST(msgST); }
View Full Code Here
87
88
89
90
91
92
  public ST getMessageTemplate() { return new ST(msgST); }

  /** Return a new template instance for the location part of a Message.
   *  TODO: Is this really necessary? -Kay
   */
  public ST getLocationTemplate() { return new ST(locationST); }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
    super(msgID,arg,null);
    this.e = e;
  }
  @Override
  public String toString() {
    ST st = getMessageTemplate();
    if ( arg!=null ) {
      st.add("arg", arg);
    }
    if ( arg2!=null ) {
      st.add("arg2", arg2);
    }
    if ( e!=null ) {
      st.add("exception", e);
      st.add("stackTrace", e.getStackTrace());
    }
    return super.toString(st);
  }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
    column = decisionASTNode.getCharPositionInLine();
    String fileName = probe.dfa.nfa.grammar.getFileName();
    if ( fileName!=null ) {
      file = fileName;
    }
    ST st = getMessageTemplate();
    st.add("enclosingRule",
            probe.dfa.getNFADecisionStartState().enclosingRule.name);

    return super.toString(st);
  }
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
    String fileName = probe.dfa.nfa.grammar.getFileName();
    if ( fileName!=null ) {
      file = fileName;
    }

    ST st = getMessageTemplate();
    st.add("targetRules", targetRules);
    st.add("alt", alt);
    st.add("callSiteStates", callSiteStates);

    List<Label> labels =
      probe.getSampleNonDeterministicInputSequence(sampleBadState);
    String input = probe.getInputSequenceDisplay(labels);
    st.add("input", input);

    return super.toString(st);
  }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
    String fileName = probe.dfa.nfa.grammar.getFileName();
    if ( fileName!=null ) {
      file = fileName;
    }

    ST st = getMessageTemplate();
    // Now fill template with information about problemState
    List<Label> labels = probe.getSampleNonDeterministicInputSequence(problemState);
    String input = probe.getInputSequenceDisplay(labels);
    st.add("input", input);

    if ( probe.dfa.isTokensRuleDecision() ) {
      Set<Integer> disabledAlts = probe.getDisabledAlternatives(problemState);
      for (Integer altI : disabledAlts) {
        String tokenName =
          probe.getTokenNameForTokensRuleAlt(altI);
        // reset the line/col to the token definition (pick last one)
        NFAState ruleStart =
          probe.dfa.nfa.grammar.getRuleStartState(tokenName);
        line = ruleStart.associatedASTNode.getLine();
        column = ruleStart.associatedASTNode.getCharPositionInLine();
        st.add("disabled", tokenName);
      }
    }
    else {
      st.add("disabled", probe.getDisabledAlternatives(problemState));
    }

    List<Integer> nondetAlts = probe.getNonDeterministicAltsForState(problemState);
    NFAState nfaStart = probe.dfa.getNFADecisionStartState();
    // all state paths have to begin with same NFA state
    int firstAlt = 0;
    if ( nondetAlts!=null ) {
      for (Integer displayAltI : nondetAlts) {
        if ( DecisionProbe.verbose ) {
          int tracePathAlt =
            nfaStart.translateDisplayAltToWalkAlt(displayAltI);
          if ( firstAlt == 0 ) {
            firstAlt = tracePathAlt;
          }
          List<? extends NFAState> path =
            probe.getNFAPathStatesForAlt(firstAlt,
                           tracePathAlt,
                           labels);
          st.addAggr("paths.{alt, states}", displayAltI, path);
        }
        else {
          if ( probe.dfa.isTokensRuleDecision() ) {
            // alts are token rules, convert to the names instead of numbers
            String tokenName =
              probe.getTokenNameForTokensRuleAlt(displayAltI);
            st.add("conflictingTokens", tokenName);
          }
          else {
            st.add("conflictingAlts", displayAltI);
          }
        }
      }
    }
    st.add("hasPredicateBlockedByAction", problemState.dfa.hasPredicateBlockedByAction);
    return super.toString(st);
  }
View Full Code Here
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
   */
  public GrammarAST addArtificialMatchTokensRule(GrammarAST grammarAST,
                           List<String> ruleNames,
                           List<String> delegateNames,
                           boolean filterMode) {
    ST matchTokenRuleST;
    if ( filterMode ) {
      matchTokenRuleST = new ST(
          ARTIFICIAL_TOKENS_RULENAME+
          " options {k=1; backtrack=true;} : <rules; separator=\"|\">;");
    }
    else {
      matchTokenRuleST = new ST(
          ARTIFICIAL_TOKENS_RULENAME+" : <rules; separator=\"|\">;");
    }

    // Now add token rule references
    for (int i = 0; i < ruleNames.size(); i++) {
      String rname = ruleNames.get(i);
      matchTokenRuleST.add("rules", rname);
    }
    for (int i = 0; i < delegateNames.size(); i++) {
      String dname = delegateNames.get(i);
      matchTokenRuleST.add("rules", dname+".Tokens");
    }
    //System.out.println("tokens rule: "+matchTokenRuleST.toString());
    GrammarAST r = parseArtificialRule(matchTokenRuleST.render());
    addRule(grammarAST, r);
    //addRule((GrammarAST)parser.getAST());
    //return (GrammarAST)parser.getAST();
    return r;
  }
View Full Code Here
260
261
262
263
264
265
266
                    DFA dfa)
    {
      if ( templates!=null ) {
        return templates.getInstanceOf("true_value");
      }
      return new ST("true");
    }
View Full Code Here
287
288
289
290
291
292
293
                    DFA dfa)
    {
      if ( templates!=null ) {
        return templates.getInstanceOf("false");
      }
      return new ST("false");
    }
View Full Code Here
TOP

Related Classes of org.stringtemplate.v4.test.TestGroups

  • com.baasbox.controllers.User
  • com.facebook.swift.generator.swift2thrift.Swift2ThriftGenerator
  • com.facebook.swift.generator.util.TemplateLoader
  • com.facebook.swift.generator.visitors.AbstractTemplateVisitor
  • com.getperka.flatpack.fast.JavaDialect
  • com.getperka.flatpack.fast.JavaScriptDialect
  • com.getperka.flatpack.fast.ObjcDialect
  • com.getperka.flatpack.fast.PhpDialect
  • com.getperka.flatpack.fast.RbDialect
  • com.github.fommil.netlib.generator.F2jImplGenerator
    • 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.