| @@ -6,8 +6,10 @@ | ||
| 6 | 6 | * This is a dynamic recursive descent parser that can parse LL grammars. |
| 7 | 7 | * |
| 8 | 8 | * @TODO: Add a detailed description and list the properties that a grammar must |
| 9 | 9 | * satisfy in order to be supported by this parser (e.g., no left recursion). |
| 10 | + * | |
| 11 | + * @access private | |
| 10 | 12 | */ |
| 11 | 13 | class WP_Parser { |
| 12 | 14 | protected $grammar; |
| 13 | 15 | protected $tokens; |
| @@ -48,9 +50,9 @@ | ||
| 48 | 50 | if ( ! count( $branches ) ) { |
| 49 | 51 | return false; |
| 50 | 52 | } |
| 51 | 53 | |
| 52 | - // Bale out from processing the current branch if none of its rules can | |
| 54 | + // Bail out from processing the current branch if none of its rules can | |
| 53 | 55 | // possibly match the current token. |
| 54 | 56 | if ( isset( $this->grammar->lookahead_is_match_possible[ $rule_id ] ) ) { |
| 55 | 57 | $token_id = $this->tokens[ $this->position ]->id; |
| 56 | 58 | if ( |
