@@ -244,23 +244,23 @@ discard block |
||
| 244 | 244 | break; |
| 245 | 245 | |
| 246 | 246 | case Parser::T_REPEAT_N_TO_M: |
| 247 | - $min = (int)$tokens->current()->getValue(1); |
|
| 248 | - $max = (int)$tokens->current()->getValue(2); |
|
| 247 | + $min = (int) $tokens->current()->getValue(1); |
|
| 248 | + $max = (int) $tokens->current()->getValue(2); |
|
| 249 | 249 | $tokens->next(); |
| 250 | 250 | break; |
| 251 | 251 | |
| 252 | 252 | case Parser::T_REPEAT_ZERO_TO_M: |
| 253 | - [$min, $max] = [0, (int)$tokens->current()->getValue(1)]; |
|
| 253 | + [$min, $max] = [0, (int) $tokens->current()->getValue(1)]; |
|
| 254 | 254 | $tokens->next(); |
| 255 | 255 | break; |
| 256 | 256 | |
| 257 | 257 | case Parser::T_REPEAT_N_OR_MORE: |
| 258 | - [$min, $max] = [(int)$tokens->current()->getValue(1), -1]; |
|
| 258 | + [$min, $max] = [(int) $tokens->current()->getValue(1), -1]; |
|
| 259 | 259 | $tokens->next(); |
| 260 | 260 | break; |
| 261 | 261 | |
| 262 | 262 | case Parser::T_REPEAT_EXACTLY_N: |
| 263 | - $min = $max = (int)$tokens->current()->getValue(1); |
|
| 263 | + $min = $max = (int) $tokens->current()->getValue(1); |
|
| 264 | 264 | $tokens->next(); |
| 265 | 265 | break; |
| 266 | 266 | } |
@@ -367,7 +367,7 @@ discard block |
||
| 367 | 367 | { |
| 368 | 368 | $tokenName = $tokens->current()->getValue(1); |
| 369 | 369 | |
| 370 | - if (! \array_key_exists($tokenName, $this->rules)) { |
|
| 370 | + if (!\array_key_exists($tokenName, $this->rules)) { |
|
| 371 | 371 | $error = \vsprintf('Cannot call rule %s() in rule %s because it does not exist.', [ |
| 372 | 372 | $tokenName, |
| 373 | 373 | $this->ruleName, |