Home
last modified time | relevance | path

Searched refs:precedence (Results 1 – 25 of 105) sorted by relevance

12345

/external/v8/src/parsing/
Dtoken.cc12 #define T(name, string, precedence) #name, argument
19 #define T(name, string, precedence) string, argument
26 #define T(name, string, precedence) precedence, argument
Dtoken.h27 #define IGNORE_TOKEN(name, string, precedence) argument
178 #define T(name, string, precedence) name, argument
/external/chromium-trace/catapult/telemetry/third_party/webpagereplay/third_party/dns/rdtypes/IN/
DIPSECKEY.py40 def __init__(self, rdclass, rdtype, precedence, gateway_type, algorithm, argument
57 self.precedence = precedence
74 return '%d %d %d %s %s' % (self.precedence, self.gateway_type,
79 precedence = tok.get_uint8()
96 return cls(rdclass, rdtype, precedence, gateway_type, algorithm,
102 header = struct.pack("!BBB", self.precedence, self.gateway_type,
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/
Dparser.ml5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 function
53 (* If this is a binop, find its precedence. *)
55 let token_prec = precedence c in
72 let next_prec = precedence c2 in
Dtoy.ml7 * 1 is the lowest precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/
Dparser.ml5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 function
53 (* If this is a binop, find its precedence. *)
55 let token_prec = precedence c in
72 let next_prec = precedence c2 in
Dtoy.ml9 * 1 is the lowest precedence. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/
Dparser.ml5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 function
53 (* If this is a binop, find its precedence. *)
55 let token_prec = precedence c in
72 let next_prec = precedence c2 in
/external/llvm/docs/tutorial/
DOCamlLangImpl2.rst71 Note that there is no discussion about precedence of binary operators,
242 (multiplication) has higher *precedence* than "+" (addition).
247 This parsing technique uses the precedence of binary operators to guide
252 (* binop_precedence - This holds the precedence for each binary operator that is
256 (* precedence - Get the precedence of the pending binary operator token. *)
257 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1
263 * 1 is the lowest precedence. *)
272 reader). The ``Parser.precedence`` function returns the precedence for
277 comparisons in the ``Parser.precedence`` function. (Or just use a
281 expressions. The basic idea of operator precedence parsing is to break
[all …]
DLangImpl2.rst101 Note that there is no discussion about precedence of binary operators,
352 (multiplication) has higher *precedence* than "+" (addition).
357 This parsing technique uses the precedence of binary operators to guide
362 /// BinopPrecedence - This holds the precedence for each binary operator that is
366 /// GetTokPrecedence - Get the precedence of the pending binary operator token.
379 // 1 is lowest precedence.
389 reader). The ``GetTokPrecedence`` function returns the precedence for
397 expressions. The basic idea of operator precedence parsing is to break
400 Operator precedence parsing considers this as a stream of primary
424 us. It takes a precedence and a pointer to an expression for the part
[all …]
DLangImpl6.rst36 grammar, introduce new operators, change precedence levels, etc. In this
43 for most parts of the grammar and operator precedence parsing for the
45 using operator precedence parsing, it would be very difficult to allow
62 # Define > with the same precedence as <.
75 # Define = with slightly lower precedence than relationals.
160 track of whether it was an operator, and if it was, what precedence
161 level the operator is at. The precedence is only used for binary
194 // Read the precedence if present.
298 operator, we register it in the precedence table. This allows the binary
300 are working on a fully-general operator precedence parser, this is all
[all …]
DOCamlLangImpl6.rst36 grammar, introduce new operators, change precedence levels, etc. In this
43 for most parts of the grammar and operator precedence parsing for the
45 using operator precedence parsing, it would be very difficult to allow
62 # Define > with the same precedence as <.
75 # Define = with slightly lower precedence than relationals.
135 track of whether it was an operator, and if it was, what precedence
136 level the operator is at. The precedence is only used for binary
169 (* Read the precedence if present. *)
257 operator, we register it in the precedence table. This allows the binary
259 are working on a fully-general operator precedence parser, this is all
[all …]
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
Dparser.ml5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 function
100 (* If this is a binop, find its precedence. *)
102 let token_prec = precedence c in
119 let next_prec = precedence c2 in
163 (* Read the precedence if present. *)
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
Dparser.ml5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 function
89 (* If this is a binop, find its precedence. *)
91 let token_prec = precedence c in
108 let next_prec = precedence c2 in
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
Dparser.ml5 (* binop_precedence - This holds the precedence for each binary operator that is
9 (* precedence - Get the precedence of the pending binary operator token. *)
10 let precedence c = try Hashtbl.find binop_precedence c with Not_found -> -1 function
114 (* If this is a binop, find its precedence. *)
116 let token_prec = precedence c in
133 let next_prec = precedence c2 in
189 (* Read the precedence if present. *)
/external/deqp/framework/randomshaders/
DrsgGeneratorState.hpp85 void pushPrecedence (int precedence) { m_precedenceStack.push_back(precedence); } in pushPrecedence() argument
/external/llvm/include/llvm/Option/
DOptParser.td17 class OptionKind<string name, int precedence = 0, bit sentinel = 0> {
19 // The kind precedence, kinds with lower precedence are matched first.
20 int Precedence = precedence;
/external/autotest/client/site_tests/security_SeccompSyscallFilters/src/
Dseccomp_bpf_tests.c513 FIXTURE_DATA(precedence) { in FIXTURE_DATA() argument
521 FIXTURE_SETUP(precedence) { in FIXTURE_SETUP() argument
566 FIXTURE_TEARDOWN(precedence) { in FIXTURE_TEARDOWN() argument
575 TEST_F(precedence, allow_ok) { in TEST_F() argument
596 TEST_F_SIGNAL(precedence, kill_is_highest, SIGSYS) { in TEST_F_SIGNAL() argument
620 TEST_F_SIGNAL(precedence, kill_is_highest_in_any_order, SIGSYS) { in TEST_F_SIGNAL() argument
641 TEST_F_SIGNAL(precedence, trap_is_second, SIGSYS) { in TEST_F_SIGNAL() argument
660 TEST_F_SIGNAL(precedence, trap_is_second_in_any_order, SIGSYS) { in TEST_F_SIGNAL() argument
679 TEST_F(precedence, errno_is_third) { in TEST_F() argument
695 TEST_F(precedence, errno_is_third_in_any_order) { in TEST_F() argument
[all …]
/external/selinux/policycoreutils/mcstrans/src/
Dmcscolor.c265 static const unsigned precedence[N_COLOR][N_COLOR - 1] = { variable
325 if (mask & (1 << precedence[i][j])) { in raw_color()
326 items[i] = items[precedence[i][j]]; in raw_color()
/external/mesa3d/src/glsl/glcpp/tests/
D049-if-expression-precedence.c2 failure with operator precedence
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
DLeftRecursiveRuleAnalyzer.java144 int nextPrec = precedence(alt); in prefixAlt()
230 predST.add("opPrec", precedence(alt)); in getArtificialOpPrecRule()
310 public int precedence(int alt) { in precedence() method in LeftRecursiveRuleAnalyzer
315 int p = precedence(alt); in nextPrecedence()
/external/bison/src/
Dprint-xml.c393 int precedence = symbols[token_translations[i]]->prec; in print_grammar() local
402 if (precedence) in print_grammar()
403 fprintf (out, " prec=\"%d\"", precedence); in print_grammar()
/external/libchrome/base/threading/
Dplatform_thread_mac.mm101 thread_precedence_policy_data_t precedence;
102 precedence.importance = 63;
105 reinterpret_cast<thread_policy_t>(&precedence),
/external/skia/src/animator/
Dthingstodo.txt6 ((((( operator precedence or similar making stack deep
DSkScript.cpp289 signed char precedence = gPrecedence[op]; in arithmeticOp() local
301 if (topPrecedence > precedence || (topPrecedence == precedence && in arithmeticOp()
1078 signed char precedence; in logicalOp() local
1109 precedence = gPrecedence[match]; in logicalOp()
1113 if (gPrecedence[topOp] <= precedence) in logicalOp()
1117 bool changedPrecedence = gPrecedence[fSuppressStack.top().fOperator] < precedence; in logicalOp()
1120 if (precedence == kIfElsePrecedence) { in logicalOp()
1136 while (gPrecedence[fOpStack.top() & ~kArtificialOp] < precedence) { in logicalOp()

12345