| /external/python/cpython2/Demo/parser/ |
| D | example.py | 10 import symbol
18 """Retrieve information from the parse tree of a source file.
33 def __init__(self, tree = None): argument
36 if tree:
37 self._extract_info(tree)
39 def _extract_info(self, tree): argument
41 if len(tree) == 2:
42 found, vars = match(DOCSTRING_STMT_PATTERN[1], tree[1])
44 found, vars = match(DOCSTRING_STMT_PATTERN, tree[3])
48 for node in tree[1:]:
[all …]
|
| /external/nullaway/nullaway/src/main/java/com/uber/nullaway/ |
| D | NullAway.java | 26 import static com.sun.source.tree.Tree.Kind.EXPRESSION_STATEMENT;
27 import static com.sun.source.tree.Tree.Kind.IDENTIFIER;
28 import static com.sun.source.tree.Tree.Kind.OTHER;
29 import static com.sun.source.tree.Tree.Kind.PARENTHESIZED;
30 import static com.sun.source.tree.Tree.Kind.TYPE_CAST;
56 import com.sun.source.tree.ArrayAccessTree;
57 import com.sun.source.tree.AssignmentTree;
58 import com.sun.source.tree.BinaryTree;
59 import com.sun.source.tree.BlockTree;
60 import com.sun.source.tree.ClassTree;
[all …]
|
| D | ErrorBuilder.java | 46 import com.sun.source.tree.AnnotationTree;
47 import com.sun.source.tree.ClassTree;
48 import com.sun.source.tree.MethodInvocationTree;
49 import com.sun.source.tree.MethodTree;
50 import com.sun.source.tree.ModifiersTree;
51 import com.sun.source.tree.Tree;
52 import com.sun.source.tree.VariableTree;
54 import com.sun.tools.javac.code.Symbol;
55 import com.sun.tools.javac.tree.JCTree.JCCompilationUnit;
91 * @param nonNullTarget if non-null, this error involved a pseudo-assignment of a @Nullable
[all …]
|
| D | NullabilityUtil.java | 31 import com.sun.source.tree.BlockTree;
32 import com.sun.source.tree.ClassTree;
33 import com.sun.source.tree.ExpressionTree;
34 import com.sun.source.tree.LambdaExpressionTree;
35 import com.sun.source.tree.MemberReferenceTree;
36 import com.sun.source.tree.MethodTree;
37 import com.sun.source.tree.Tree;
38 import com.sun.source.tree.VariableTree;
41 import com.sun.tools.javac.code.Symbol;
46 import com.sun.tools.javac.tree.JCTree;
[all …]
|
| /external/rust/crates/tokio/src/runtime/task/trace/ |
| D | tree.rs | 5 use super::{Backtrace, Symbol, SymbolTrace, Trace};
7 /// An adjacency list representation of an execution tree.
9 /// This tree provides a convenient intermediate representation for formatting
10 /// [`Trace`] as a tree.
11 pub(super) struct Tree { struct
15 roots: HashSet<Symbol>,
17 /// The adjacency list of symbols in the execution tree(s).
18 edges: HashMap<Symbol, HashSet<Symbol>>,
21 impl Tree { impl
22 /// Constructs a [`Tree`] from [`Trace`]
[all …]
|
| /external/antlr/runtime/Ruby/lib/antlr3/ |
| D | error.rb | 2 # encoding: utf-8
7 Copyright (c) 2009-2010 Kyle Yetter
36 # - ported from the ANTLR3 Python Runtime library by
56 - functions more as an internal signal, simillar to exception
58 - used to inform the recognizer that it needs to rewind
62 - not a subclass of RecognitionError
68 # To avoid English-only error messages and to generally make things
77 # that you can compute the complete trace of rules from the start symbol.
89 # knows its state (such as current input symbol and line info) that
100 to the recognizer by the rules of a grammar and an input symbol which failed to
[all …]
|
| /external/nullaway/nullaway/src/main/java/com/uber/nullaway/handlers/ |
| D | Handler.java | 27 import com.sun.source.tree.ClassTree;
28 import com.sun.source.tree.ExpressionTree;
29 import com.sun.source.tree.LambdaExpressionTree;
30 import com.sun.source.tree.MemberReferenceTree;
31 import com.sun.source.tree.MethodInvocationTree;
32 import com.sun.source.tree.MethodTree;
33 import com.sun.source.tree.ReturnTree;
34 import com.sun.tools.javac.code.Symbol;
65 * <p>This also means we are starting a new Compilation Unit, which allows us to clear CU-specific
69 * @param tree The AST node for the class being matched.
[all …]
|
| D | BaseNoOpHandler.java | 27 import com.sun.source.tree.ClassTree;
28 import com.sun.source.tree.ExpressionTree;
29 import com.sun.source.tree.LambdaExpressionTree;
30 import com.sun.source.tree.MemberReferenceTree;
31 import com.sun.source.tree.MethodInvocationTree;
32 import com.sun.source.tree.MethodTree;
33 import com.sun.source.tree.ReturnTree;
34 import com.sun.tools.javac.code.Symbol;
54 * Provides a default (No-Op) implementation of every method defined by the Handler interface.
59 * long as we define the corresponding No-Op behavior here.
[all …]
|
| D | AbstractFieldContractHandler.java | 2 * Copyright (c) 2017-2020 Uber Technologies, Inc.
31 import com.sun.source.tree.MethodTree;
32 import com.sun.tools.javac.code.Symbol;
45 * Abstract base class for handlers that process pre- and post-condition annotations for fields.
64 * @param tree Method tree under processing.
66 * @param methodSymbol Processing method symbol.
70 NullAway analysis, MethodTree tree, VisitorState state, Symbol.MethodSymbol methodSymbol) { in onMatchMethod() argument
77 castToNonNull(annotationContent), analysis, tree, state, methodSymbol) in onMatchMethod()
78 && validateAnnotationSemantics(analysis, state, tree, methodSymbol); in onMatchMethod()
82 Symbol.MethodSymbol closestOverriddenMethod = in onMatchMethod()
[all …]
|
| D | RestrictiveAnnotationHandler.java | 26 import com.sun.source.tree.ExpressionTree;
27 import com.sun.source.tree.Tree;
28 import com.sun.tools.javac.code.Symbol;
52 * Returns true iff the symbol is considered unannotated but restrictively annotated
55 * <p>In particular, this means the symbol is explicitly annotated as {@code @Nullable} and, if
58 * @param symbol the symbol being checked
60 * @return whether this handler would generally override the nullness of {@code symbol} as
63 private boolean isSymbolRestrictivelyNullable(Symbol symbol, Context context) { in isSymbolRestrictivelyNullable() argument
65 return (codeAnnotationInfo.isSymbolUnannotated(symbol, config) in isSymbolRestrictivelyNullable()
66 // with the generated-as-unannotated option enabled, we want to ignore annotations in in isSymbolRestrictivelyNullable()
[all …]
|
| D | GrpcHandler.java | 32 import com.sun.source.tree.ClassTree;
33 import com.sun.source.tree.MethodInvocationTree;
34 import com.sun.tools.javac.code.Symbol;
74 NullAway analysis, ClassTree tree, VisitorState state, Symbol.ClassSymbol classSymbol) { in onMatchTopLevelClass() argument
88 Symbol.MethodSymbol symbol, in onDataflowVisitMethodInvocation() argument
95 MethodInvocationTree tree = castToNonNull(node.getTree()); in onDataflowVisitMethodInvocation() local
97 if (grpcIsMetadataContainsKeyCall(symbol, types)) { in onDataflowVisitMethodInvocation()
99 Element getter = getGetterForMetadataSubtype(symbol.enclClass(), types); in onDataflowVisitMethodInvocation()
102 Symbol keyArgSymbol = ASTHelpers.getSymbol(tree.getArguments().get(0)); in onDataflowVisitMethodInvocation()
104 && keyArgSymbol instanceof Symbol.VarSymbol in onDataflowVisitMethodInvocation()
[all …]
|
| D | OptionalEmptinessHandler.java | 28 import com.sun.source.tree.ClassTree;
29 import com.sun.source.tree.ExpressionTree;
30 import com.sun.source.tree.Tree;
32 import com.sun.tools.javac.code.Symbol;
87 @Nullable Symbol exprSymbol, in onOverrideMayBeNullExpr()
93 if (expr.getKind() == Tree.Kind.METHOD_INVOCATION in onOverrideMayBeNullExpr()
94 && exprSymbol instanceof Symbol.MethodSymbol in onOverrideMayBeNullExpr()
95 && optionalIsGetCall((Symbol.MethodSymbol) exprSymbol, state.getTypes())) { in onOverrideMayBeNullExpr()
103 NullAway analysis, ClassTree tree, VisitorState state, Symbol.ClassSymbol classSymbol) { in onMatchTopLevelClass() argument
120 Symbol.MethodSymbol symbol, in onDataflowVisitMethodInvocation() argument
[all …]
|
| D | LombokHandler.java | 7 import com.sun.source.tree.ExpressionTree;
8 import com.sun.source.tree.Tree;
9 import com.sun.tools.javac.code.Symbol;
35 Symbol.MethodSymbol methodSymbol, VisitorState state) { in isLombokMethodWithMissingNullableAnnotation()
45 ImmutableList<Symbol> matchingMembers = in isLombokMethodWithMissingNullableAnnotation()
48 sym -> in isLombokMethodWithMissingNullableAnnotation()
64 @Nullable Symbol exprSymbol, in onOverrideMayBeNullExpr()
70 Tree.Kind exprKind = expr.getKind(); in onOverrideMayBeNullExpr()
71 if (exprSymbol != null && exprKind == Tree.Kind.METHOD_INVOCATION) { in onOverrideMayBeNullExpr()
72 Symbol.MethodSymbol methodSymbol = (Symbol.MethodSymbol) exprSymbol; in onOverrideMayBeNullExpr()
[all …]
|
| /external/nullaway/nullaway/src/main/java/com/uber/nullaway/generics/ |
| D | GenericsChecks.java | 10 import com.sun.source.tree.AnnotatedTypeTree;
11 import com.sun.source.tree.AnnotationTree;
12 import com.sun.source.tree.AssignmentTree;
13 import com.sun.source.tree.ConditionalExpressionTree;
14 import com.sun.source.tree.ExpressionTree;
15 import com.sun.source.tree.MemberSelectTree;
16 import com.sun.source.tree.MethodInvocationTree;
17 import com.sun.source.tree.MethodTree;
18 import com.sun.source.tree.NewClassTree;
19 import com.sun.source.tree.ParameterizedTypeTree;
[all …]
|
| /external/libxml2/doc/ |
| D | libxml2-api.xml | 1 <?xml version="1.0" encoding="ISO-8859-1"?>
5 <summary>interface for an HTML 4.0 non-verifying parser</summary>
6 …<description>this module implements an HTML 4.0 non-verifying parser with API compatible with the …
8 <exports symbol='htmlDefaultSubelement' type='macro'/>
9 <exports symbol='htmlElementAllowedHereDesc' type='macro'/>
10 <exports symbol='htmlRequiredAttrs' type='macro'/>
11 <exports symbol='HTML_DEPRECATED' type='enum'/>
12 <exports symbol='HTML_INVALID' type='enum'/>
13 <exports symbol='HTML_NA' type='enum'/>
14 <exports symbol='HTML_PARSE_COMPACT' type='enum'/>
[all …]
|
| /external/nullaway/nullaway/src/test/java/com/uber/nullaway/handlers/contract/ |
| D | ContractUtilsTest.java | 9 import com.sun.source.tree.Tree;
10 import com.sun.tools.javac.code.Symbol;
17 private Tree tree; field in ContractUtilsTest
20 private Symbol symbol; field in ContractUtilsTest
24 tree = mock(Tree.class); in setUp()
27 symbol = mock(Symbol.class); in setUp()
32 String[] antecedent = ContractUtils.getAntecedent("->_", tree, analysis, state, symbol, 0); in getEmptyAntecedent()
35 verifyNoInteractions(tree, state, analysis, symbol); in getEmptyAntecedent()
|
| /external/libtextclassifier/native/utils/grammar/parsing/ |
| D | lexer.h | 8 * http://www.apache.org/licenses/LICENSE-2.0
29 // "there" [16, 44) <-- note "16" NOT "39"
30 // "world" [44, ?) <-- note "44" NOT "52"
40 #include "utils/grammar/parsing/parse-tree.h"
48 // A lexical symbol with an identified meaning that represents raw tokens,
51 struct Symbol { struct
52 // The type of the lexical symbol.
57 // A symbol representing a string of digits.
63 // A predefined parse tree.
67 explicit Symbol() = default; argument
[all …]
|
| /external/turbine/java/com/google/turbine/processing/ |
| D | TurbineMessager.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
30 import com.google.turbine.binder.sym.Symbol;
37 import com.google.turbine.tree.Tree;
59 // TODO(cushon): null-check `msg` after fixing affected processors in printMessage()
69 Symbol sym = ((TurbineElement) e).sym(); in printMessage()
82 int position = ((TurbineAnnotationMirror) a).anno().tree().position(); in printMessage()
96 if (position == -1) { in printMessage()
97 position = anno.tree().position(); in printMessage()
103 * Returns the {@link SourceFile} that contains the declaration of the given {@link Symbol}, or
104 * {@code null} if the symbol was not compiled from source.
[all …]
|
| /external/rust/crates/libz-sys/src/zlib-ng/doc/ |
| D | algorithm.txt | 4 LZ77 (Lempel-Ziv 1977, see reference below). It finds duplicated strings in
13 Literals or match lengths are compressed with one Huffman tree, and
14 match distances are compressed with another tree. The trees are stored
19 somewhat similar to the behavior of LZW-based _compress_.)
32 To avoid a worst-case situation, very long hash chains are arbitrarily
83 For inflate, which has 286 possible codes for the literal/length tree, the size
94 Ok, you want to know what this cleverly obfuscated inflate tree actually
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
97 symbol could be as short as one bit or as long as 15 bits. If a particular
[all …]
|
| /external/python/cpython2/Modules/zlib/ |
| D | algorithm.txt | 4 LZ77 (Lempel-Ziv 1977, see reference below). It finds duplicated strings in
13 Literals or match lengths are compressed with one Huffman tree, and
14 match distances are compressed with another tree. The trees are stored
19 somewhat similar to the behavior of LZW-based _compress_.)
32 To avoid a worst-case situation, very long hash chains are arbitrarily
83 For inflate, which has 286 possible codes for the literal/length tree, the size
94 Ok, you want to know what this cleverly obfuscated inflate tree actually
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
97 symbol could be as short as one bit or as long as 15 bits. If a particular
[all …]
|
| /external/rust/crates/libz-sys/src/zlib/doc/ |
| D | algorithm.txt | 4 LZ77 (Lempel-Ziv 1977, see reference below). It finds duplicated strings in
13 Literals or match lengths are compressed with one Huffman tree, and
14 match distances are compressed with another tree. The trees are stored
19 somewhat similar to the behavior of LZW-based _compress_.)
32 To avoid a worst-case situation, very long hash chains are arbitrarily
83 For inflate, which has 286 possible codes for the literal/length tree, the size
94 Ok, you want to know what this cleverly obfuscated inflate tree actually
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
97 symbol could be as short as one bit or as long as 15 bits. If a particular
[all …]
|
| /external/nullaway/nullaway/src/main/java/com/uber/nullaway/handlers/contract/ |
| D | ContractUtils.java | 5 import com.sun.source.tree.Tree;
6 import com.sun.tools.javac.code.Symbol;
30 .map((Function<String, String>) input -> input.substring(input.lastIndexOf(".") + 1)) in trimReceivers()
38 * @param tree The AST Node for contract.
41 * @param callee Symbol for callee.
45 String clause, Tree tree, NullAway analysis, VisitorState state, Symbol callee) { in getConsequent() argument
47 String[] parts = clause.split("->"); in getConsequent()
54 + "(see https://www.jetbrains.com/help/idea/contract-annotations.html)."; in getConsequent()
60 tree, in getConsequent()
61 analysis.buildDescription(tree), in getConsequent()
[all …]
|
| /external/nullaway/nullaway/src/main/java/com/uber/nullaway/dataflow/ |
| D | AccessPath.java | 32 import com.sun.source.tree.LiteralTree;
33 import com.sun.source.tree.MethodInvocationTree;
34 import com.sun.source.tree.Tree;
35 import com.sun.tools.javac.code.Symbol;
68 * field names. Here, we also allow no-argument methods to appear in the access path, as well as
78 * be proven to be class-initialization time constants (i.e. static final fields of a type known
189 * Returns an access path rooted at {@code newRoot} with the same elements and map-get argument as
223 * method arguments, but rather the string representation of primitive-type compile-time constants
274 // Required to have Node type match Tree type in some instances. in argumentToMapKeySpecifier()
278 // A switch at the Tree level should be faster than multiple if checks at the Node level. in argumentToMapKeySpecifier()
[all …]
|
| /external/turbine/java/com/google/turbine/binder/ |
| D | TypeBinder.java | 8 * http://www.apache.org/licenses/LICENSE-2.0
44 import com.google.turbine.binder.sym.Symbol;
52 import com.google.turbine.tree.Tree;
53 import com.google.turbine.tree.Tree.Anno;
54 import com.google.turbine.tree.Tree.ClassTy;
55 import com.google.turbine.tree.Tree.Ident;
56 import com.google.turbine.tree.Tree.Kind;
57 import com.google.turbine.tree.Tree.MethDecl;
58 import com.google.turbine.tree.Tree.PrimTy;
59 import com.google.turbine.tree.TurbineModifier;
[all …]
|
| /external/python/cpython2/Lib/compiler/ |
| D | transformer.py | 1 """Parse tree transformation module.
3 Transforms Python source code into an abstract syntax tree (AST)
7 parse(buf) -> AST
8 parseFile(path) -> AST
22 # Copyright (C) 1997-1998 Greg Stein. All Rights Reserved.
24 # This module is provided under a BSD-ish license. See
25 # http://www.opensource.org/licenses/bsd-license.html
30 import symbol
98 tree = transform(ast_tree)
99 tree = parsesuite(text)
[all …]
|