Home
last modified time | relevance | path

Searched refs:nonterminal (Results 1 – 18 of 18) sorted by relevance

/external/libtextclassifier/native/utils/grammar/utils/
Dir.h77 return std::tie(nonterminal, callback, preconditions) ==
78 std::tie(other.nonterminal, other.callback, other.preconditions);
81 Nonterm nonterminal = kUnassignedNonterm; member
107 const Nonterm nonterminal = ++num_nonterminals_; variable
110 SetNonterminal(name, nonterminal);
112 return nonterminal;
116 void SetNonterminal(const std::string& name, const Nonterm nonterminal) { in SetNonterminal() argument
117 nonterminal_names_[nonterminal] = name; in SetNonterminal()
118 nonterminal_ids_[name] = nonterminal; in SetNonterminal()
122 Nonterm DefineNonterminal(Nonterm nonterminal) { in DefineNonterminal() argument
[all …]
Dir.cc42 return (lhs.nonterminal == other.nonterminal() && in IsSameLhs()
52 return (lhs.nonterminal == lhs_entry && lhs.callback.id == kNoCallback && in IsSameLhsEntry()
81 return std::tie(a.nonterminal, a.callback.id, a.callback.param, in SortedLhsSet()
83 std::tie(b.nonterminal, b.callback.id, b.callback.param, in SortedLhsSet()
109 serialized_lhs_set->lhs.push_back(lhs.nonterminal); in AddLhsSet()
129 RulesSet_::Lhs(lhs.nonterminal, lhs.callback.id, lhs.callback.param, in AddLhsSet()
176 Nonterm shareable_nonterm = lhs.nonterminal; in AddToSet()
182 return candidate->nonterminal; in AddToSet()
186 if (nonshareable_.find(candidate->nonterminal) != nonshareable_.end() || in AddToSet()
187 nonshareable_.find(lhs.nonterminal) != nonshareable_.end()) { in AddToSet()
[all …]
Drules.cc46 const int nonterminal, const std::unordered_map<int, Nonterm>& assignment) { in GetAssignedIdForNonterminal() argument
47 const auto it = assignment.find(nonterminal); in GetAssignedIdForNonterminal()
63 if (GetAssignedIdForNonterminal(element.nonterminal, nonterminals) == in IsRhsAssigned()
111 GetAssignedIdForNonterminal(element.nonterminal, *nonterminals); in LowerRule()
194 const std::string& nonterminal) const { in IsNonterminalOfName()
198 return (nonterminals_[element.nonterminal].name == nonterminal); in IsNonterminalOfName()
447 const NontermInfo& nonterminal = nonterminals_[i]; in Finalize() local
450 if (rules.GetNonterminalForName(nonterminal.name) != kUnassignedNonterm) { in Finalize()
455 (nonterminal.from_annotation || nonterminal.rules.size() > 1 || in Finalize()
456 !nonterminal.regex_rules.empty()); in Finalize()
[all …]
Drules.h69 explicit RhsElement(const int nonterminal, const bool is_optional,
72 nonterminal(nonterminal), in is_terminal()
77 int nonterminal; member
215 const std::string& nonterminal) const;
/external/libtextclassifier/native/utils/grammar/
Drules.fbs77 // This is a map from a nonterminal to an lhs set index into the
82 // This is a map from nonterminal pair to an lhs set index into the
88 // Most commonly, that is just the id of the lhs nonterminal of the rule that
89 // is triggered, in this case `lhs` is set to the id of the nonterminal.
91 // `lhs` vector below that specifies additionally to the nonterminal, also the
100 // The lhs nonterminal.
101 nonterminal:uint;
124 // Id of the nonterminal indicating the start of input.
127 // Id of the nonterminal indicating the end of input.
130 // Id of the nonterminal indicating a token.
[all …]
/external/libtextclassifier/native/utils/grammar/parsing/
Dmatcher.cc180 const Nonterm nonterminal) { in FindUnaryRulesMatches() argument
185 rules->unary_rules()->LookupByKey(nonterminal)) { in FindUnaryRulesMatches()
223 Nonterm* nonterminal, CallbackId* callback, int64* param, in GetLhs() argument
227 *nonterminal = lhs_entry; in GetLhs()
233 *nonterminal = lhs->nonterminal(); in GetLhs()
Dmatcher_test.cc42 std::string nonterminal; member
51 << ", nonterminal=" << match.nonterminal << ")"; in operator <<()
72 ExplainMatchResult(name, arg.nonterminal, result_listener);
94 const Nonterm nonterminal) const { in GetNonterminalName()
96 debug_information->nonterminal_names()->LookupByKey(nonterminal)) { in GetNonterminalName()
111 result.back().nonterminal = in GetMatchResults()
Dparser.cc76 regex_annotator->nonterminal()}); in BuildRegexAnnotators()
/external/llvm/test/Transforms/LoopRotate/
DPhiRename-1.ll15 %struct.nonterminal = type { i8*, i32, i32, i32, %struct.plankMap*, %struct.rule* }
17 %struct.pattern = type { %struct.nonterminal*, %struct.operator*, [2 x %struct.nonterminal*] }
20 %struct.rule = type { [4 x i16], i32, i32, i32, %struct.nonterminal*, %struct.pattern*, i8 }
/external/llvm/test/CodeGen/X86/
D2007-02-16-BranchFold.ll16 %struct.nonterminal = type { i8*, i32, i32, i32, %struct.plankMap*, %struct.rule* }
18 %struct.pattern = type { %struct.nonterminal*, %struct.operator*, [2 x %struct.nonterminal*] }
21 %struct.rule = type { [4 x i16], i32, i32, i32, %struct.nonterminal*, %struct.pattern*, i8 }
/external/llvm-project/llvm/test/Transforms/LoopRotate/
DPhiRename-1.ll16 %struct.nonterminal = type { i8*, i32, i32, i32, %struct.plankMap*, %struct.rule* }
18 %struct.pattern = type { %struct.nonterminal*, %struct.operator*, [2 x %struct.nonterminal*] }
21 %struct.rule = type { [4 x i16], i32, i32, i32, %struct.nonterminal*, %struct.pattern*, i8 }
/external/llvm-project/llvm/test/CodeGen/X86/
D2007-02-16-BranchFold.ll16 %struct.nonterminal = type { i8*, i32, i32, i32, %struct.plankMap*, %struct.rule* }
18 %struct.pattern = type { %struct.nonterminal*, %struct.operator*, [2 x %struct.nonterminal*] }
21 %struct.rule = type { [4 x i16], i32, i32, i32, %struct.nonterminal*, %struct.pattern*, i8 }
/external/python/cpython2/Parser/
Dspark.py701 return self.nonterminal(lhs, children)
705 def nonterminal(self, type, args): member in GenericASTBuilder
/external/rust/crates/syn/tests/common/
Deq.rs567 kind: TokenKind::Interpolated(nonterminal), in is_escaped_literal()
569 } => match nonterminal.as_ref() { in is_escaped_literal()
/external/ply/ply/
DCHANGES708 applies to positional information associated with nonterminal
/external/jline/src/src/test/resources/jline/example/
Denglish.gz
/external/libxml2/
DChangeLog14217 nonterminal S
/external/one-true-awk/testdir/
Dfunstack.in21447 …ge of this approach is the localization of the search strategies: Each nonterminal node of the tre…