Lines Matching defs:paren

264 		// If it's a left paren, we have reached the end of whatever expression
265 		// this is no matter what. We also don't pop the left paren because it
291  * Parses a right paren. In the Shunting-Yard algorithm, it needs to be put on
293  * there are until it hits a left paren.
303 	// Consume operators until a left paren.
311 	// We need to pop the left paren as well.
500 	// Must have a left paren.
504 	// Must have a right paren.
524 	// Must have a left paren.
545 	// Must have a right paren.
568 	// Must have a left paren.
622 	// Must have a right paren.
663 	// Without the left paren, it's just the keyword.
685 	// Must have a right paren.
787  * @param rparen   True if the last token was a right paren.
882 	bool paren;
894 	paren = (t == BC_LEX_LPAREN);
913 		if (!paren || p->l.last != BC_LEX_RPAREN)
1141 	// Get the left paren and barf if necessary.
1149 	// Must have a right paren.
1206 	// Get the left paren and barf if necessary.
1216 	// Parse the actual condition and barf on non-right paren.
1236 	// Barf on the missing left paren.
1301 	// Must have a right paren.
1402 	// Must have a left paren.
1420 	// While we do not have a right paren, we are still parsing arguments.
2022 	// - rprn is a right paren encountered last.
2193 				// A left paren is *not* allowed right after a leaf expr.
2203 				// Push the paren onto the operator stack.
2218 				// The right paren must not come after a prefix or binary
2234 				// Now that we know the right paren has not ended the
2584 		// With a paren first or the last operator not being an assignment, we