| /external/libtextclassifier/native/utils/grammar/parsing/ |
| D | parse-tree.h | 31 struct ParseTree { struct
52 explicit ParseTree() = default; argument
53 explicit ParseTree(const Nonterm lhs, const CodepointSpan& codepoint_span, in ParseTree() function
74 const ParseTree* unary_rule_rhs() const { return rhs2; } in unary_rule_rhs() argument
77 ParseTree* next = nullptr; argument
94 const ParseTree* rhs1 = nullptr; argument
100 const ParseTree* rhs2 = nullptr; argument
104 struct MappingNode : public ParseTree {
108 : ParseTree(arg_lhs, arg_codepoint_span, arg_match_offset, in MappingNode()
116 struct AssertionNode : public ParseTree {
[all …]
|
| D | chart_test.cc | 45 ParseTree* m0 = arena_.AllocAndInit<ParseTree>(/*lhs=*/0, CodepointSpan{0, 1}, in TEST_F()
47 ParseTree::Type::kDefault); in TEST_F()
49 ParseTree* m1 = arena_.AllocAndInit<ParseTree>(/*lhs=*/1, CodepointSpan{0, 2}, in TEST_F()
51 ParseTree::Type::kDefault); in TEST_F()
53 ParseTree* m2 = arena_.AllocAndInit<ParseTree>(/*lhs=*/2, CodepointSpan{0, 2}, in TEST_F()
55 ParseTree::Type::kDefault); in TEST_F()
85 ParseTree* m0 = arena_.AllocAndInit<ParseTree>(/*lhs=*/0, CodepointSpan{0, 1}, in TEST_F()
87 ParseTree::Type::kDefault); in TEST_F()
89 ParseTree* m1 = arena_.AllocAndInit<ParseTree>(/*lhs=*/1, CodepointSpan{0, 2}, in TEST_F()
91 ParseTree::Type::kDefault); in TEST_F()
[all …]
|
| D | parse-tree.cc | 24 void Traverse(const ParseTree* root, in Traverse()
25 const std::function<bool(const ParseTree*)>& node_fn) { in Traverse()
26 std::stack<const ParseTree*> open; in Traverse()
30 const ParseTree* node = open.top(); in Traverse()
42 std::vector<const ParseTree*> SelectAll( in SelectAll()
43 const ParseTree* root, in SelectAll()
44 const std::function<bool(const ParseTree*)>& pred_fn) { in SelectAll()
45 std::vector<const ParseTree*> result; in SelectAll()
46 Traverse(root, [&result, pred_fn](const ParseTree* node) { in SelectAll()
|
| D | parser.cc | 107 symbols.emplace_back(arena->AllocAndInit<ParseTree>( in SortedSymbolsForInput()
109 /*match_offset=*/0, ParseTree::Type::kDefault)); in SortedSymbolsForInput()
113 symbols.emplace_back(arena->AllocAndInit<ParseTree>( in SortedSymbolsForInput()
116 /*match_offset=*/match_offset, ParseTree::Type::kDefault)); in SortedSymbolsForInput()
128 symbols.emplace_back(arena->AllocAndInit<ParseTree>( in SortedSymbolsForInput()
131 /*match_offset=*/match_offset, ParseTree::Type::kDefault)); in SortedSymbolsForInput()
138 symbols.emplace_back(arena->AllocAndInit<ParseTree>( in SortedSymbolsForInput()
140 /*match_offset=*/match_offset, ParseTree::Type::kDefault)); in SortedSymbolsForInput()
157 symbols.emplace_back(arena->AllocAndInit<ParseTree>( in SortedSymbolsForInput()
160 ParseTree::Type::kDefault)); in SortedSymbolsForInput()
[all …]
|
| D | matcher_test.cc | 257 matcher.AddParseTree(arena_.AllocAndInit<ParseTree>( in TEST_F()
259 /*match_offset=*/37, ParseTree::Type::kDefault)); in TEST_F()
320 matcher.AddParseTree(arena_.AllocAndInit<ParseTree>( in TEST_F()
322 CodepointSpan{2, 6}, /*match_offset=*/2, ParseTree::Type::kDefault)); in TEST_F()
332 matcher.AddParseTree(arena_.AllocAndInit<ParseTree>( in TEST_F()
334 CodepointSpan{9, 13}, /*match_offset=*/8, ParseTree::Type::kDefault)); in TEST_F()
364 matcher.AddParseTree(arena_.AllocAndInit<ParseTree>( in TEST_F()
366 CodepointSpan{2, 6}, /*match_offset=*/2, ParseTree::Type::kDefault)); in TEST_F()
376 matcher.AddParseTree(arena_.AllocAndInit<ParseTree>( in TEST_F()
378 CodepointSpan{8, 12}, /*match_offset=*/8, ParseTree::Type::kDefault)); in TEST_F()
[all …]
|
| D | chart.h | 39 explicit Iterator(const int match_offset, const ParseTree* value) in Iterator()
46 const ParseTree* Item() const { return value_; } in Item()
54 const ParseTree* value_;
61 void Add(ParseTree* item) { in Add()
73 const ParseTree* value = chart_[match_offset & kChartHashTableBitmask]; in MatchesEndingAt()
88 std::array<ParseTree*, NumBuckets> chart_;
|
| D | matcher.cc | 247 void Matcher::QueueForProcessing(ParseTree* item) { in QueueForProcessing()
279 [terminal](ParseTree* parse_tree) { in AddTerminal()
295 [terminal](ParseTree* parse_tree) { in AddTerminal()
305 void Matcher::AddParseTree(ParseTree* parse_tree) { in AddParseTree()
321 const std::function<void(ParseTree*)>& initializer_fn, in ExecuteLhsSet()
324 ParseTree* parse_tree = nullptr; in ExecuteLhsSet()
382 parse_tree = arena_->AllocAndInit<ParseTree>( in ExecuteLhsSet()
383 lhs, codepoint_span, match_offset_bytes, ParseTree::Type::kDefault); in ExecuteLhsSet()
398 ParseTree* item = pending_items_; in ProcessPendingSet()
412 [item](ParseTree* parse_tree) { in ProcessPendingSet()
[all …]
|
| D | matcher.h | 95 void AddParseTree(ParseTree* parse_tree);
103 const std::function<void(ParseTree*)>& initializer_fn,
107 void QueueForProcessing(ParseTree* item);
139 ParseTree* pending_items_;
|
| D | derivation.cc | 26 Traverse(parse_tree, [&result](const ParseTree* node) { in IsValid()
27 if (node->type != ParseTree::Type::kAssertion) { in IsValid()
|
| D | lexer.h | 78 explicit Symbol(ParseTree* parse_tree) in Symbol()
98 ParseTree* parse_tree;
|
| /external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
| D | ParseTreeBuilder.cs | 36 using ParseTree = Antlr.Runtime.Tree.ParseTree; typedef
47 Stack<ParseTree> callStack = new Stack<ParseTree>();
53 ParseTree root = Create( "<grammar " + grammarName + ">" ); in ParseTreeBuilder()
57 public virtual ParseTree Tree
61 ParseTree[] stack = callStack.ToArray();
71 public virtual ParseTree Create( object payload ) in Create()
73 return new ParseTree( payload ); in Create()
76 public virtual ParseTree EpsilonNode() in EpsilonNode()
95 ParseTree parentRuleNode = callStack.Peek(); in EnterRule()
96 ParseTree ruleNode = Create( ruleName ); in EnterRule()
[all …]
|
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
| D | ParseTreeBuilder.cs | 35 using ParseTree = Antlr.Runtime.Tree.ParseTree; typedef
45 Stack<ParseTree> callStack = new Stack<ParseTree>();
50 ParseTree root = Create("<grammar " + grammarName + ">"); in ParseTreeBuilder()
54 public virtual ParseTree GetTree() { in GetTree()
65 public virtual ParseTree Create(object payload) { in Create()
66 return new ParseTree(payload); in Create()
69 public virtual ParseTree EpsilonNode() { in EpsilonNode()
84 ParseTree parentRuleNode = callStack.Peek(); in EnterRule()
85 ParseTree ruleNode = Create(ruleName); in EnterRule()
93 ParseTree ruleNode = callStack.Peek(); in ExitRule()
[all …]
|
| /external/antlr/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
| D | ParseTreeBuilder.java | 32 import org.antlr.runtime.tree.ParseTree;
44 Stack<ParseTree> callStack = new Stack<ParseTree>();
49 ParseTree root = create("<grammar "+grammarName+">"); in ParseTreeBuilder()
53 public ParseTree getTree() { in getTree()
60 public ParseTree create(Object payload) { in create()
61 return new ParseTree(payload); in create()
64 public ParseTree epsilonNode() { in epsilonNode()
77 ParseTree parentRuleNode = callStack.peek(); in enterRule()
78 ParseTree ruleNode = create(ruleName); in enterRule()
86 ParseTree ruleNode = callStack.peek(); in exitRule()
[all …]
|
| /external/doclava/src/com/google/doclava/ |
| D | InfoBuilder.java | 27 import org.antlr.runtime.tree.ParseTree;
76 ParseTree tree = builder.getTree(); in parseFile()
343 private void parseFile(ParseTree tree) { in parseFile()
384 parseFile((ParseTree) tree.getChild(i)); in parseFile()
393 private PackageInfo buildPackage(ParseTree tree) { in buildPackage()
395 ParseTree child = (ParseTree) tree.getChild(i); in buildPackage()
413 private static String buildQualifiedName(ParseTree tree) { in buildQualifiedName()
428 private String buildImport(ParseTree tree) { in buildImport()
451 private ClassInfo buildClass(ParseTree tree, ClassInfo containingClass) { in buildClass()
457 Iterator<ParseTree> it = (Iterator<ParseTree>) tree.getChildren().iterator(); in buildClass()
[all …]
|
| /external/libtextclassifier/native/utils/grammar/semantics/ |
| D | composer.cc | 36 std::unordered_map<int, const ParseTree*> GatherConstituents( in GatherConstituents()
37 const ParseTree* root) { in GatherConstituents()
38 std::unordered_map<int, const ParseTree*> constituents; in GatherConstituents()
39 Traverse(root, [root, &constituents](const ParseTree* node) { in GatherConstituents()
41 case ParseTree::Type::kMapping: in GatherConstituents()
46 case ParseTree::Type::kDefault: in GatherConstituents()
89 ParseTree::Type::kExpression) { in Eval()
105 if (constituent->type == ParseTree::Type::kExpression) { in Eval()
|
| /external/libtextclassifier/native/annotator/grammar/ |
| D | grammar-annotator.cc | 32 std::unordered_map<uint16, const grammar::ParseTree*> GetCapturingNodes( in GetCapturingNodes()
33 const grammar::ParseTree* parse_tree) { in GetCapturingNodes()
34 std::unordered_map<uint16, const grammar::ParseTree*> capturing_nodes; in GetCapturingNodes()
37 parse_tree, grammar::ParseTree::Type::kMapping)) { in GetCapturingNodes()
45 const grammar::ParseTree* parse_tree, in MatchSelectionBoundaries()
54 std::unordered_map<uint16, const grammar::ParseTree*> capturing_nodes = in MatchSelectionBoundaries()
117 const grammar::ParseTree* parse_tree, in InstantiateAnnotatedSpanFromDerivation()
133 const grammar::ParseTree* parse_tree, in InstantiateClassificationFromDerivation()
159 std::unordered_map<uint16, const grammar::ParseTree*> capturing_nodes = in InstantiateClassificationFromDerivation()
179 const grammar::ParseTree* capturing_match = it->second; in InstantiateClassificationFromDerivation()
[all …]
|
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| D | ParseTree.cs | 46 public class ParseTree : BaseTree { class
50 public ParseTree(object label) { in ParseTree() method in Antlr.Runtime.Tree.ParseTree
136 ParseTree t = (ParseTree)Children[i]; in ToStringLeaves()
|
| D | TreePatternParser.cs | 51 return ParseTree(); in Pattern()
62 public virtual object ParseTree() { in ParseTree() method in Antlr.Runtime.Tree.TreePatternParser
76 object subtree = ParseTree(); in ParseTree()
|
| /external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| D | ParseTree.cs | 47 public class ParseTree : BaseTree class
52 public ParseTree( object label ) in ParseTree() method in Antlr.Runtime.Tree.ParseTree
162 ParseTree t = (ParseTree)Children[i]; in ToStringLeaves()
|
| D | TreePatternParser.cs | 56 return ParseTree(); in Pattern()
70 public virtual object ParseTree() in ParseTree() method in Antlr.Runtime.Tree.TreePatternParser
88 object subtree = ParseTree(); in ParseTree()
|
| /external/antlr/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| D | ParseTree.java | 39 public class ParseTree extends BaseTree { class
43 public ParseTree(Object label) { in ParseTree() method in ParseTree
123 ParseTree t = (ParseTree)children.get(i); in _toStringLeaves()
|
| /external/antlr/tool/src/test/java/org/antlr/test/ |
| D | TestInterpretedParsing.java | 32 import org.antlr.runtime.tree.ParseTree;
72 ParseTree t = parseEngine.parse("prog"); in testSimpleParse()
107 ParseTree t = parseEngine.parse("prog"); in testMismatchedTokenError()
142 ParseTree t = parseEngine.parse("prog"); in testMismatchedSetError()
177 ParseTree t = parseEngine.parse("prog"); in testNoViableAltError()
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | ParseTree.m | 2 // ParseTree.m
32 #import "ParseTree.h"
39 @implementation ParseTree implementation
40 + (ParseTree *)newParseTree:(id<Token>)label
42 return [[ParseTree alloc] initWithLabel:label];
139 ParseTree *t = (ParseTree *) [children objectAtIndex:i];
|
| /external/libtextclassifier/native/actions/ |
| D | grammar-actions.cc | 51 std::unordered_map<uint16, const grammar::ParseTree*> capturing_matches; in InstantiateActionsFromMatch()
54 derivation.parse_tree, grammar::ParseTree::Type::kMapping)) { in InstantiateActionsFromMatch()
78 const grammar::ParseTree* capturing_match = it->second; in InstantiateActionsFromMatch()
106 capturing_match, grammar::ParseTree::Type::kAnnotation); in InstantiateActionsFromMatch()
|
| /external/libtextclassifier/native/utils/grammar/semantics/evaluators/ |
| D | span-eval_test.cc | 38 ParseTree derivation(/*lhs=*/kUnassignedNonterm, CodepointSpan{5, 11}, in TEST_F()
39 /*match_offset=*/0, /*type=*/ParseTree::Type::kDefault); in TEST_F()
|