| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| NFAConversionThread.java | 32 import org.antlr.tool.Grammar;
36 Grammar grammar; field in class:NFAConversionThread
39 public NFAConversionThread(Grammar grammar,
44 this.grammar = grammar;
51 NFAState decisionStartState = grammar.getDecisionNFAStartState(decision);
53 grammar.createLookaheadDFA(decision,true);
|
| NFA.java | 30 import org.antlr.tool.Grammar;
33 /** An NFA (collection of NFAStates) constructed from a grammar. This
34 * NFA is one big machine for entire grammar. Decision points are recorded
35 * by the Grammar object so we can, for example, convert to DFA or simulate
41 /** This NFA represents which grammar? */
42 public Grammar grammar; field in class:NFA
49 public NFA(Grammar g) {
50 this.grammar = g;
54 return grammar.composite.getNewNFAStateNumber()
[all...] |
| DFAOptimizer.java | 31 import org.antlr.tool.Grammar;
130 protected Grammar grammar; field in class:DFAOptimizer
132 public DFAOptimizer(Grammar grammar) {
133 this.grammar = grammar;
137 // optimize each DFA in this grammar
139 decisionNumber<=grammar.getNumberOfDecisions();
142 DFA dfa = grammar.getLookaheadDFA(decisionNumber)
[all...] |
| LL1DFA.java | 30 import org.antlr.grammar.v3.ANTLRParser;
55 nAlts = nfa.grammar.getNumberOfAltsForDecisionNFA(decisionStartState);
81 nAlts = nfa.grammar.getNumberOfAltsForDecisionNFA(decisionStartState);
119 NFAState altLeftEdge = nfa.grammar.getNFAStateForAltOfDecision(decisionStartState, walkAlt);
121 SemanticContext ctx = nfa.grammar.ll1Analyzer.getPredicates(altStartState);
158 nfa.grammar.getNFAStateForAltOfDecision(decisionStartState, walkAlt);
171 nfa.grammar.synPredUsedInDFA(this, ctx);
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestJavaCodeGeneration.java | 41 String grammar = local
42 "grammar T;\n" +
48 "T.g", grammar, "TParser", null, false);
55 String grammar = local
56 "lexer grammar T;\n" +
61 "T.g", grammar, null, "T", false);
68 String grammar = local
69 "grammar T;\n" +
73 String found = execParser("T.g", grammar, "TParser", "TLexer",
80 String grammar local
92 String grammar = local
103 String grammar = local
114 String grammar = local
129 String grammar = local
[all...] |
| TestSyntaxErrors.java | 36 String grammar = local
37 "grammar T;\n" +
42 String found = execParser("T.g", grammar, "TParser", "TLexer", "a", "ae", false);
49 String grammar = local
50 "grammar T;\n" +
55 System.out.println(grammar);
56 String found = execParser("T.g", grammar, "TParser", "TLexer", "a", "abe", false);
63 String grammar = local
64 "grammar T;\n" +
69 String found = execParser("T.g", grammar, "TParser", "TLexer", "a", "aaae", false)
76 String grammar = local
93 String grammar = local
[all...] |
| TestLeftRecursion.java | 10 String grammar = local
11 "grammar T;\n" +
18 String found = execParser("T.g", grammar, "TParser", "TLexer",
25 String grammar = local
26 "grammar T;\n" +
33 String found = execParser("T.g", grammar, "TParser", "TLexer",
40 String grammar = local
41 "grammar T;\n" +
62 runTests(grammar, tests, "e");
66 String grammar local
97 String grammar = local
128 String grammar = local
160 String grammar = local
191 String grammar = local
232 String grammar = local
321 String grammar = local
339 String grammar = local
[all...] |
| TestSemanticPredicateEvaluation.java | 34 String grammar = local
35 "grammar foo;\n" +
39 String found = execParser("foo.g", grammar, "fooParser", "fooLexer",
45 String grammar = local
46 "grammar foo;\n" +
51 String found = execParser("foo.g", grammar, "fooParser", "fooLexer",
57 String grammar = local
58 "grammar foo;\n" +
67 String found = execParser("foo.g", grammar, "fooParser", "fooLexer",
73 String grammar local
86 String grammar = local
100 String grammar = local
113 String grammar = local
125 String grammar = local
137 String grammar = local
148 String grammar = local
160 String grammar = local
172 String grammar = local
184 String grammar = local
197 String grammar = local
210 String grammar = local
227 String grammar = local
[all...] |
| TestSyntacticPredicateEvaluation.java | 34 String grammar = local
35 "grammar T;\n" +
53 String found = execParser("T.g", grammar, "TParser", "TLexer",
62 found = execParser("T.g", grammar, "TParser", "TLexer",
70 found = execParser("T.g", grammar, "TParser", "TLexer",
83 String grammar = local
84 "grammar T;\n" +
102 String found = execParser("T.g", grammar, "TParser", "TLexer",
111 found = execParser("T.g", grammar, "TParser", "TLexer",
119 found = execParser("T.g", grammar, "TParser", "TLexer"
131 String grammar = local
152 String grammar = local
174 String grammar = local
190 String grammar = local
205 String grammar = local
240 String grammar = local
291 String grammar = local
314 String grammar = local
342 String grammar = local
362 String grammar = local
381 String grammar = local
397 String grammar = local
409 String grammar = local
[all...] |
| TestTreeParsing.java | 34 String grammar = local
35 "grammar T;\n" +
43 "tree grammar TP; options {ASTLabelType=CommonTree;}\n" +
48 String found = execTreeParser("T.g", grammar, "TParser", "TP.g",
54 String grammar = local
55 "grammar T;\n" +
63 "tree grammar TP; options {ASTLabelType=CommonTree;}\n" +
68 String found = execTreeParser("T.g", grammar, "TParser", "TP.g",
74 String grammar = local
75 "grammar T;\n"
97 String grammar = local
121 String grammar = local
143 String grammar = local
164 String grammar = local
184 String grammar = local
205 String grammar = local
227 String grammar = local
248 String grammar = local
269 String grammar = local
293 String grammar = local
317 String grammar = local
[all...] |
| TestHeteroAST.java | 39 String grammar = local
40 "grammar T;\n" +
50 String found = execParser("T.g", grammar, "TParser", "TLexer",
56 String grammar = local
57 "grammar T;\n" +
62 String found = execParser("T.g", grammar, "TParser", "TLexer",
68 String grammar = local
69 "grammar T;\n" +
79 String found = execParser("T.g", grammar, "TParser", "TLexer",
85 String grammar local
103 String grammar = local
120 String grammar = local
137 String grammar = local
154 String grammar = local
171 String grammar = local
188 String grammar = local
207 String grammar = local
226 String grammar = local
246 String grammar = local
264 String grammar = local
281 String grammar = local
299 String grammar = local
324 String grammar = local
348 String grammar = local
378 String grammar = local
408 String grammar = local
435 String grammar = local
463 String grammar = local
490 String grammar = local
518 String grammar = local
[all...] |
| TestLexer.java | 33 import org.antlr.tool.Grammar;
46 String grammar = local
47 "grammar P;\n"+
51 String found = execParser("P.g", grammar, "PParser", "PLexer",
59 String grammar = local
60 "grammar P;\n"+
65 String found = execParser("P.g", grammar, "PParser", "PLexer",
73 String grammar = local
74 "grammar P;\n"+
79 String found = execParser("P.g", grammar, "PParser", "PLexer"
85 String grammar = local
100 String grammar = local
114 String grammar = local
127 String grammar = local
139 String grammar = local
151 String grammar = local
163 String grammar = local
175 String grammar = local
185 String grammar = local
196 String grammar = local
208 String grammar = local
224 String grammar = local
[all...] |
| TestRewriteTemplates.java | 39 String grammar = local
40 "grammar T;\n" +
46 String found = execParser("T.g", grammar, "TParser", "TLexer",
52 String grammar = local
53 "grammar T;\n" +
59 String found = execParser("T.g", grammar, "TParser", "TLexer",
65 String grammar = local
66 "grammar T;\n" +
72 String found = execParser("T.g", grammar, "TParser", "TLexer",
78 String grammar local
93 String grammar = local
108 String grammar = local
121 String grammar = local
136 String grammar = local
151 String grammar = local
165 String grammar = local
179 String grammar = local
197 String grammar = local
217 String grammar = local
[all...] |
| TestSets.java | 43 String grammar = local
44 "grammar P;\n" +
49 String found = execParser("P.g", grammar, "PParser", "PLexer",
55 String grammar = local
56 "grammar T;\n" +
58 String found = execParser("T.g", grammar, "TParser", "TLexer",
64 String grammar = local
65 "grammar T;\n" +
67 String found = execParser("T.g", grammar, "TParser", "TLexer",
73 String grammar local
82 String grammar = local
91 String grammar = local
100 String grammar = local
110 String grammar = local
120 String grammar = local
130 String grammar = local
140 String grammar = local
153 String grammar = local
163 String grammar = local
172 String grammar = local
181 String grammar = local
190 String grammar = local
200 String grammar = local
210 String grammar = local
220 String grammar = local
232 String grammar = local
242 String grammar = local
253 String grammar = local
264 String grammar = local
276 String grammar = local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Interpreter.java | 43 * out of Grammar as it's related, but technically not a Grammar function.
44 * You create an interpreter for a grammar and an input stream. This object
47 * for a lexer grammar of course.
50 protected Grammar grammar; field in class:Interpreter
60 Grammar g;
61 public LexerActionGetTokenType(Grammar g) {
66 if ( !ruleName.equals(Grammar.ARTIFICIAL_TOKENS_RULENAME) ){
74 public Interpreter(Grammar grammar, IntStream input)
[all...] |
| GrammarSanity.java | 33 import org.antlr.grammar.v3.ANTLRParser;
48 protected Grammar grammar; field in class:GrammarSanity
49 public GrammarSanity(Grammar grammar) {
50 this.grammar = grammar;
59 grammar.buildNFA(); // make sure we have NFAs
60 grammar.leftRecursiveRules = new HashSet();
62 for (int i = 0; i < grammar.composite.ruleIndexToRuleList.size(); i++)
[all...] |
| CompositeGrammarTree.java | 36 public Grammar grammar; field in class:CompositeGrammarTree
41 public CompositeGrammarTree(Grammar g) {
42 grammar = g;
57 /** Find a rule by looking in current grammar then down towards the
61 Rule r = grammar.getLocallyDefinedRule(ruleName);
69 /** Find an option by looking up towards the root grammar rather than down */
71 if ( grammar.tool!=null && key!=null && key.equals("language") &&
72 grammar.tool.forcedLanguageOption!=null ) {
73 return grammar.tool.forcedLanguageOption
[all...] |
| FASerializer.java | 57 protected Grammar grammar; field in class:FASerializer
59 /** This aspect is associated with a grammar; used to get token names */
60 public FASerializer(Grammar grammar) {
61 this.grammar = grammar;
172 preds.genExpr(grammar.generator,
173 grammar.generator.getTemplates(), null).render()
177 buf.append("-"+edge.label.toString(grammar)+predsStr+"->")
[all...] |
| BuildDependencyGenerator.java | 41 /** Given a grammar file, show the dependencies on .tokens etc...
43 * For example, combined grammar T.g (no token import) generates:
49 * For tree grammar TP with import of T.tokens:
63 * So this output shows what the grammar depends on *and* what it generates.
65 * Operate on one grammar file at a time. If given a list of .g on the
81 protected Grammar grammar; field in class:BuildDependencyGenerator
89 grammar = tool.getRootGrammar(grammarFileName);
90 String language = (String) grammar.getOption("language");
91 generator = new CodeGenerator(tool, grammar, language)
[all...] |
| GrammarSerializerFoo.java | 36 /** Serialize a grammar into a highly compressed form with
48 protected Grammar g;
54 public GrammarSerializerFoo(Grammar g) {
75 public void grammar(int grammarTokenType, String name) { method in class:GrammarSerializerFoo
174 if ( g.type!=Grammar.LEXER ) {
|
| NameSpaceChecker.java | 38 protected Grammar grammar; field in class:NameSpaceChecker
40 public NameSpaceChecker(Grammar grammar) {
41 this.grammar = grammar;
45 for (int i = CompositeGrammar.MIN_RULE_INDEX; i < grammar.composite.ruleIndexToRuleList.size(); i++) {
46 Rule r = grammar.composite.ruleIndexToRuleList.elementAt(i);
54 Grammar.LabelElementPair pair = (Grammar.LabelElementPair) it.next()
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| Target.java | 34 import org.antlr.tool.Grammar;
88 Grammar grammar,
93 generator.getRecognizerFileName(grammar.name, grammar.type);
99 Grammar grammar,
108 Grammar grammar)
110 // Build NFAs from the grammar AS
[all...] |
| /external/chromium_org/content/public/test/ |
| fake_speech_recognition_manager.h | 24 const std::string& grammar() const { function in class:content::FakeSpeechRecognitionManager
|
| /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/runner/ |
| ParserLoader.java | 40 private String grammar; field in class:ParserLoader
55 grammar = grammarName;
91 if(name.startsWith(grammar)) {
|
| /external/bison/src/ |
| parse-gram.y | 1 %{/* Bison Grammar Parser -*- C -*-
82 node. This is because a single named-ref in the grammar may
108 /* Bison's grammar can initial empty locations, hence a default
230 prologue_declarations "%%" grammar epilogue.opt
540 | The grammar section: between the two %%. |
543 grammar: label
545 | grammar rules_or_grammar_declaration
548 /* As a Bison extension, one can use the grammar declarations in the
549 body of the grammar. */
|
