HomeSort by relevance Sort by last modified time
    Searched refs:syntactic (Results 1 - 7 of 7) sorted by null

  /external/clang/lib/Sema/
SemaPseudoObject.cpp 320 ExprResult PseudoOpBuilder::complete(Expr *syntactic) {
321 return PseudoObjectExpr::Create(S.Context, syntactic,
347 Expr *syntactic;
352 syntactic = new (S.Context) BinaryOperator(syntacticLHS, capturedRHS,
367 syntactic =
383 return complete(syntactic);
427 UnaryOperator *syntactic = local
430 return complete(syntactic);
550 // If we have a base, capture it in an OVE and rebuild the syntactic
849 // Capture base expression in an OVE and rebuild the syntactic
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/
en.stg 261 ANTLR could not analyze this decision in rule <enclosingRule>; often this is because of recursive rule references visible from the left edge of alternatives. ANTLR will re-analyze the decision with a fixed lookahead of k=1. Consider using "options {k=1;}" for that decision and possibly adding a syntactic predicate.
292 [fatal] rule <ruleName> has non-LL(*) decision due to recursive rule invocations reachable from alts <alts; separator=",">. Resolve by left-factoring or using syntactic predicates or using backtrack=true option.
  /external/clang/lib/StaticAnalyzer/Core/
ExprEngine.cpp 880 const Expr *syntactic = PO->getSyntacticForm(); local
882 dyn_cast<ObjCPropertyRefExpr>(syntactic)) {
887 else if (isa<BinaryOperator>(syntactic)) {
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
tree.rb 72 Trees (ASTs), tree structures that reflect the high-level syntactic and semantic
    [all...]
  /external/clang/include/clang/AST/
Expr.h     [all...]
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tree.pas     [all...]
Antlr.Runtime.pas 364 /// When walking ahead with cyclic DFA for syntactic predicates, we
    [all...]

Completed in 363 milliseconds