@@ -260,23 +260,23 @@ discard block |
||
260 | 260 | break; |
261 | 261 | |
262 | 262 | case Parser::T_REPEAT_N_TO_M: |
263 | - $min = (int)$tokens->current()->getValue(1); |
|
264 | - $max = (int)$tokens->current()->getValue(2); |
|
263 | + $min = (int) $tokens->current()->getValue(1); |
|
264 | + $max = (int) $tokens->current()->getValue(2); |
|
265 | 265 | $tokens->next(); |
266 | 266 | break; |
267 | 267 | |
268 | 268 | case Parser::T_REPEAT_ZERO_TO_M: |
269 | - [$min, $max] = [0, (int)$tokens->current()->getValue(1)]; |
|
269 | + [$min, $max] = [0, (int) $tokens->current()->getValue(1)]; |
|
270 | 270 | $tokens->next(); |
271 | 271 | break; |
272 | 272 | |
273 | 273 | case Parser::T_REPEAT_N_OR_MORE: |
274 | - [$min, $max] = [(int)$tokens->current()->getValue(1), -1]; |
|
274 | + [$min, $max] = [(int) $tokens->current()->getValue(1), -1]; |
|
275 | 275 | $tokens->next(); |
276 | 276 | break; |
277 | 277 | |
278 | 278 | case Parser::T_REPEAT_EXACTLY_N: |
279 | - $min = $max = (int)$tokens->current()->getValue(1); |
|
279 | + $min = $max = (int) $tokens->current()->getValue(1); |
|
280 | 280 | $tokens->next(); |
281 | 281 | break; |
282 | 282 | } |
@@ -367,7 +367,7 @@ discard block |
||
367 | 367 | { |
368 | 368 | $tokenName = $tokens->current()->getValue(1); |
369 | 369 | |
370 | - if (! isset($this->tokens[$tokenName])) { |
|
370 | + if (!isset($this->tokens[$tokenName])) { |
|
371 | 371 | $error = \sprintf('Token %s does not exist in rule %s.', $tokenName, $this->ruleName); |
372 | 372 | throw new GrammarException($error, 4); |
373 | 373 | } |
@@ -389,7 +389,7 @@ discard block |
||
389 | 389 | { |
390 | 390 | $tokenName = $tokens->current()->getValue(1); |
391 | 391 | |
392 | - $isEmptyRule = ! \array_key_exists($tokenName, $this->rules); |
|
392 | + $isEmptyRule = !\array_key_exists($tokenName, $this->rules); |
|
393 | 393 | |
394 | 394 | if ($isEmptyRule) { |
395 | 395 | $error = \vsprintf('Cannot call rule %s() in rule %s because it does not exist.', [ |