wikimedia / mediawiki

					if ($this->t->scanOperand)

						break 2;

					while (	!empty($operators) &&

						$this->opPrecedence[end($operators)->type] > $this->opPrecedence[$tt]

					)

						$this->reduce($operators, $operands);

					array_push($operators, new JSNode($this->t));

						break 2;

					// Use >, not >=, for right-associative ASSIGN

					while (	!empty($operators) &&

						$this->opPrecedence[end($operators)->type] > $this->opPrecedence[$tt]

					)

						$this->reduce($operators, $operands);

					array_push($operators, new JSNode($this->t));

					end($operands)->assignOp = $this->t->currentToken()->assignOp;

					if ($this->t->scanOperand)

						break 2;

					while (	!empty($operators) &&

						$this->opPrecedence[end($operators)->type] >= $this->opPrecedence[$tt]

					)

						$this->reduce($operators, $operands);

					if ($tt == OP_DOT)

					{

						if (!empty($operators))

						{

							// Use >, not >=, so postfix has higher precedence than prefix.

							while ($this->opPrecedence[end($operators)->type] > $this->opPrecedence[$tt])

								$this->reduce($operators, $operands);

						}

						$n = new JSNode($this->t, $tt, array_pop($operands));

					}

					else

					{

						while (	!empty($operators) &&

							$this->opPrecedence[end($operators)->type] > $this->opPrecedence[KEYWORD_NEW]

						)

							$this->reduce($operators, $operands);

						// Handle () now, to regularize the n-ary case for n > 0.

						// We must set scanOperand in case there are arguments and