Public Methods | |
lr_parser () | |
lr_parser (Scanner s) | |
abstract short[][] | action_table () |
void | debug_message (String mess) |
Symbol | debug_parse () throws java.lang.Exception |
void | debug_reduce (int prod_num, int nt_num, int rhs_size) |
void | debug_shift (Symbol shift_tkn) |
void | debug_stack () |
abstract Symbol | do_action (int act_num, lr_parser parser, Stack stack, int top) throws java.lang.Exception |
void | done_parsing () |
void | dump_stack () |
abstract int | EOF_sym () |
abstract int | error_sym () |
Scanner | getScanner () |
Symbol | parse () throws java.lang.Exception |
abstract short[][] | production_table () |
abstract short[][] | reduce_table () |
void | report_error (String message, Object info) |
void | report_fatal_error (String message, Object info) throws java.lang.Exception |
Symbol | scan () throws java.lang.Exception |
void | setScanner (Scanner s) |
abstract int | start_production () |
abstract int | start_state () |
void | syntax_error (Symbol cur_token) |
void | unrecovered_syntax_error (Symbol cur_token) throws java.lang.Exception |
void | user_init () throws java.lang.Exception |
Protected Methods | |
boolean | advance_lookahead () |
Symbol | cur_err_token () |
boolean | error_recovery (boolean debug) throws java.lang.Exception |
int | error_sync_size () |
boolean | find_recovery_config (boolean debug) |
final short | get_action (int state, int sym) |
final short | get_reduce (int state, int sym) |
abstract void | init_actions () throws java.lang.Exception |
void | parse_lookahead (boolean debug) throws java.lang.Exception |
void | read_lookahead () throws java.lang.Exception |
void | restart_lookahead () throws java.lang.Exception |
boolean | shift_under_error () |
boolean | try_parse_ahead (boolean debug) throws java.lang.Exception |
Static Protected Methods | |
short[][] | unpackFromStrings (String[] sa) |
Protected Attributes | |
boolean | _done_parsing = false |
int | tos |
Symbol | cur_token |
Stack | stack = new Stack() |
short[][] | production_tab |
short[][] | action_tab |
short[][] | reduce_tab |
Symbol | lookahead [] |
int | lookahead_pos |
Static Protected Attributes | |
final int | _error_sync_size = 3 |
Private Attributes | |
Scanner | _scanner |
To control the decision of whether to shift or reduce at any given point, the parser uses a state machine (the "viable prefix recognition machine" built by the parser generator). The current state of the machine is placed on top of the parse stack (stored as part of a Symbol object representing a terminal or non terminal). The parse action table is consulted (using the current state and the current lookahead Symbol as indexes) to determine whether to shift or to reduce. When the parser shifts, it changes to a new state by pushing a new Symbol (containing a new state) onto the stack. When the parser reduces, it pops the handle (right hand side of a production) off the stack. This leaves the parser in the state it was in before any of those Symbols were matched. Next the reduce-goto table is consulted (using the new state and current lookahead Symbol as indexes) to determine a new state to go to. The parser then shifts to this goto state by pushing the left hand side Symbol of the production (also containing the new state) onto the stack.
This class actually provides four LR parsers. The methods parse() and debug_parse() provide two versions of the main parser (the only difference being that debug_parse() emits debugging trace messages as it parses). In addition to these main parsers, the error recovery mechanism uses two more. One of these is used to simulate "parsing ahead" in the input without carrying out actions (to verify that a potential error recovery has worked), and the other is used to parse through buffered "parse ahead" input in order to execute all actions and re-synchronize the actual parser configuration.
This is an abstract class which is normally filled out by a subclass generated by the JavaCup parser generator. In addition to supplying the actual parse tables, generated code also supplies methods which invoke various pieces of user supplied code, provide access to certain special Symbols (e.g., EOF and error), etc. Specifically, the following abstract methods are normally supplied by generated code:
In addition to these routines that must be supplied by the generated subclass there are also a series of routines that may be supplied. These include:
Definition at line 147 of file lr_parser.java.
|
Simple constructor. Definition at line 216 of file lr_parser.java. |
|
Constructor that sets the default scanner. [CSA/davidm] Definition at line 221 of file lr_parser.java. |
|
The index of the end of file terminal Symbol (supplied by generated subclass). Reimplemented in parser, and parser. Referenced by error_recovery(), and scan().
|
|
The action table (supplied by generated subclass). This table is indexed by state and terminal number indicating what action is to be taken when the parser is in the given state (i.e., the given state is on top of the stack) and the given terminal is next on the input. States are indexed using the first dimension, however, the entries for a given state are compacted and stored in adjacent index, value pairs which are searched for rather than accessed directly (see get_action()). The actions stored in the table will be either shifts, reduces, or errors. Shifts are encoded as positive values (one greater than the state shifted to). Reduces are encoded as negative values (one less than the production reduced by). Error entries are denoted by zero.
Reimplemented in parser, and parser. Referenced by debug_parse(), and parse().
|
|
Advance to next "parse ahead" input Symbol. Return true if we have input to advance to, false otherwise. Definition at line 247 of file lr_parser.java. Referenced by parse_lookahead(), and try_parse_ahead().
|
|
Return the current lookahead in our error "parse ahead" buffer. Definition at line 258 of file lr_parser.java. Referenced by parse_lookahead(), and try_parse_ahead().
|
|
Write a debugging message to System.err for the debugging version of the parser.
Definition at line 266 of file lr_parser.java. Referenced by debug_parse(), debug_reduce(), debug_shift(), debug_stack(), dump_stack(), error_recovery(), find_recovery_config(), parse_lookahead(), and try_parse_ahead().
|
|
Perform a parse with debugging output. This does exactly the same things as parse(), except that it calls debug_shift() and debug_reduce() when shift and reduce moves are taken by the parser and produces various other debugging messages. Definition at line 277 of file lr_parser.java. |
|
Do debug output for a reduce.
Definition at line 401 of file lr_parser.java. Referenced by debug_parse(), and parse_lookahead().
|
|
Do debug output for shift.
Definition at line 412 of file lr_parser.java. Referenced by debug_parse(), and parse_lookahead().
|
|
Do debug output for stack state. [CSA] Definition at line 421 of file lr_parser.java. |
|
Perform a bit of user supplied action code (supplied by generated subclass). Actions are indexed by an internal action number assigned at parser generation time.
Referenced by debug_parse(), parser::do_action(), parse(), and parse_lookahead().
|
|
This method is called to indicate that the parser should quit. This is normally called by an accept action, but can be used to cancel parsing early in other circumstances if desired. Definition at line 457 of file lr_parser.java. Referenced by debug_parse(), actions::do_action(), parse(), and report_fatal_error().
|
|
Dump the parse stack for debugging purposes. Definition at line 464 of file lr_parser.java. |
|
Attempt to recover from a syntax error. This returns false if recovery fails, true if it succeeds. Recovery happens in 4 steps. First we pop the parse stack down to a point at which we have a shift out of the top-most state on the error Symbol. This represents the initial error recovery configuration. If no such configuration is found, then we fail. Next a small number of "lookahead" or "parse ahead" Symbols are read into a buffer. The size of this buffer is determined by error_sync_size() and determines how many Symbols beyond the error must be matched to consider the recovery a success. Next, we begin to discard Symbols in attempt to get past the point of error to a point where we can continue parsing. After each Symbol, we attempt to "parse ahead" though the buffered lookahead Symbols. The "parse ahead" process simulates that actual parse, but does not modify the real parser's configuration, nor execute any actions. If we can parse all the stored Symbols without error, then the recovery is considered a success. Once a successful recovery point is determined, we do an actual parse over the stored input -- modifying the real parse configuration and executing all actions. Finally, we return the the normal parser to continue with the overall parse.
Definition at line 514 of file lr_parser.java. Referenced by debug_parse(), and parse().
|
|
The index of the special error Symbol (supplied by generated subclass). Reimplemented in parser, and parser. Referenced by find_recovery_config(), and shift_under_error().
|
|
The number of Symbols after an error we much match to consider it recovered from. Definition at line 576 of file lr_parser.java. Referenced by advance_lookahead(), read_lookahead(), and restart_lookahead().
|
|
Put the (real) parse stack into error recovery configuration by popping the stack down to a state that can shift on the special error Symbol, then doing the shift. If no suitable state exists on the stack we return false
Definition at line 586 of file lr_parser.java. Referenced by error_recovery().
|
|
Simple accessor method to get the default scanner. Definition at line 724 of file lr_parser.java. Referenced by actions::do_action(), parser::report_error(), and scan().
|
|
Fetch an action from the action table. The table is broken up into rows, one per state (rows are indexed directly by state number). Within each row, a list of index, value pairs are given (as sequential entries in the table), and the list is terminated by a default entry (denoted with a Symbol index of -1). To find the proper entry in a row we do a linear or binary search (depending on the size of the row).
Definition at line 645 of file lr_parser.java. Referenced by debug_parse(), find_recovery_config(), parse(), parse_lookahead(), shift_under_error(), and try_parse_ahead().
|
|
Fetch a state from the reduce-goto table. The table is broken up into rows, one per state (rows are indexed directly by state number). Within each row, a list of index, value pairs are given (as sequential entries in the table), and the list is terminated by a default entry (denoted with a Symbol index of -1). To find the proper entry in a row we do a linear search.
Definition at line 699 of file lr_parser.java. Referenced by debug_parse(), parse(), parse_lookahead(), and try_parse_ahead().
|
|
Initialize the action object. This is called before the parser does any parse actions. This is filled in by generated code to create an object that encapsulates all action code. Reimplemented in parser, and parser. Referenced by debug_parse(), and parse().
|
|
This method provides the main parsing routine. It returns only when done_parsing() has been called (typically because the parser has accepted, or a fatal error has been reported). See the header documentation for the class regarding how shift/reduce parsers operate and how the various tables are used. Definition at line 740 of file lr_parser.java. |
|
Parse forward using stored lookahead Symbols. In this case we have already verified that parsing will make it through the stored lookahead Symbols and we are now getting back to the point at which we can hand control back to the normal parser. Consequently, this version of the parser performs all actions and modifies the real parse configuration. This returns once we have consumed all the stored input or we accept.
Definition at line 853 of file lr_parser.java. Referenced by error_recovery().
|
|
Table of production information (supplied by generated subclass). This table contains one entry per production and is indexed by the negative-encoded values (reduce actions) in the action_table. Each entry has two parts, the index of the non-terminal on the left hand side of the production, and the number of Symbols on the right hand side. Reimplemented in parser, and parser. Referenced by debug_parse(), and parse().
|
|
Read from input to establish our buffer of "parse ahead" lookahead Symbols. Definition at line 972 of file lr_parser.java. Referenced by error_recovery().
|
|
The reduce-goto table (supplied by generated subclass). This table is indexed by state and non-terminal number and contains state numbers. States are indexed using the first dimension, however, the entries for a given state are compacted and stored in adjacent index, value pairs which are searched for rather than accessed directly (see get_reduce()). When a reduce occurs, the handle (corresponding to the RHS of the matched production) is popped off the stack. The new top of stack indicates a state. This table is then indexed by that state and the LHS of the reducing production to indicate where to "shift" to.
Reimplemented in parser, and parser. Referenced by debug_parse(), and parse().
|
|
Report a non fatal error (or warning). This method takes a message string and an additional object (to be used by specializations implemented in subclasses). Here in the base class a very simple implementation is provided which simply prints the message to System.err.
Reimplemented in parser, and parser. Definition at line 1014 of file lr_parser.java. Referenced by report_fatal_error(), and syntax_error().
|
|
Report a fatal error. This method takes a message string and an additional object (to be used by specializations implemented in subclasses). Here in the base class a very simple implementation is provided which reports the error then throws an exception.
Definition at line 1034 of file lr_parser.java. Referenced by parse_lookahead(), and unrecovered_syntax_error().
|
|
Reset the parse ahead input to one Symbol past where we started error recovery (this consumes one new Symbol from the real input). Definition at line 1053 of file lr_parser.java. Referenced by error_recovery().
|
|
Get the next Symbol from the input (supplied by generated subclass). Once end of file has been reached, all subsequent calls to scan should return an EOF Symbol (which is Symbol number 0). By default this method returns getScanner().next_token(); this implementation can be overriden by the generated parser using the code declared in the "scan with" clause. Do not recycle objects; every call to scan() should return a fresh object. Definition at line 1080 of file lr_parser.java. Referenced by debug_parse(), parse(), read_lookahead(), and restart_lookahead().
|
|
Simple accessor method to set the default scanner. Definition at line 1087 of file lr_parser.java. Referenced by lr_parser().
|
|
Determine if we can shift under the special error Symbol out of the state currently on the top of the (real) parse stack. Definition at line 1093 of file lr_parser.java. Referenced by find_recovery_config().
|
|
The index of the start production (supplied by generated subclass). Reimplemented in parser, and parser. Referenced by try_parse_ahead().
|
|
The index of the start state (supplied by generated subclass). Reimplemented in parser, and parser. Referenced by debug_parse(), and parse().
|
|
This method is called when a syntax error has been detected and recovery is about to be invoked. Here in the base class we just emit a "Syntax error" error message.
Definition at line 1114 of file lr_parser.java. Referenced by debug_parse(), and parse().
|
|
Do a simulated parse forward (a "parse ahead") from the current stack configuration using stored lookahead input and a virtual parse stack. Return true if we make it all the way through the stored lookahead input without error. This basically simulates the action of parse() using only our saved "parse ahead" input, and not executing any actions.
Definition at line 1129 of file lr_parser.java. Referenced by error_recovery().
|
|
Utility function: unpacks parse tables from strings Definition at line 1191 of file lr_parser.java. |
|
This method is called if it is determined that syntax error recovery has been unsuccessful. Here in the base class we report a fatal error.
Definition at line 1215 of file lr_parser.java. Referenced by debug_parse(), and parse().
|
|
User code for initialization inside the parser. Typically this initializes the scanner. This is called before the parser requests the first Symbol. Here this is just a placeholder for subclasses that might need this and we perform no action. This method is normally overridden by the generated code using this contents of the "init with" clause as its body. Definition at line 1229 of file lr_parser.java. Referenced by debug_parse(), and parse().
|
|
Internal flag to indicate when parser should quit. Definition at line 161 of file lr_parser.java. |
|
The default number of Symbols after an error we much match to consider it recovered from. Definition at line 156 of file lr_parser.java. |
|
This is the scanner object used by the default implementation of scan() to get Symbols. To avoid name conflicts with existing code, this field is private. [CSA/davidm] Definition at line 201 of file lr_parser.java. |
|
Direct reference to the action table. Definition at line 189 of file lr_parser.java. |
|
The current lookahead Symbol. Definition at line 174 of file lr_parser.java. |
|
Lookahead Symbols used for attempting error recovery "parse aheads". Definition at line 206 of file lr_parser.java. |
|
Position in lookahead input buffer used for "parse ahead". Definition at line 209 of file lr_parser.java. |
|
Direct reference to the production table. Definition at line 184 of file lr_parser.java. |
|
Direct reference to the reduce-goto table. Definition at line 194 of file lr_parser.java. |
|
The parse stack itself. Definition at line 179 of file lr_parser.java. |
|
Indication of the index for top of stack (for use by actions). Definition at line 169 of file lr_parser.java. |