Parse table generation method and system
First Claim
1. A state transition table defining a plurality of statements in a programming language, each statement defined by at least one token, comprising:
- a plurality of sub-tables, each sub-table corresponding to one of said plurality of statements, wherein each sub-table is a two-dimensional array defining an action for at least one token in at least one state.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and system assembles state transition tables (100) from a plurality of modular sub-tables (102). In one embodiment, each sub-table (102) defines an individual statement in a programming language. Combining multiple sub-tables (102) together into one large table (100) creates a dictionary for a programming language that can be used to, for example, compile code into the programming language or translate code from one language to another. Using sub-tables (102) simplifies construction of the larger table (100) and makes it easier to add, modify, or remove portions of the table (102).
8 Citations
10 Claims
-
1. A state transition table defining a plurality of statements in a programming language, each statement defined by at least one token, comprising:
-
a plurality of sub-tables, each sub-table corresponding to one of said plurality of statements, wherein each sub-table is a two-dimensional array defining an action for at least one token in at least one state. - View Dependent Claims (2, 3, 5, 6)
-
-
4. The state transition table of claim 4, wherein said at least one relocatable state is redefined when the plurality of sub-tables are assembled to form the state transition table.
-
7. A method for accessing a state transition table defining a plurality of statements in a programming language, each statement defined by at least one token, comprising:
-
receiving one of said plurality of statements;
accessing a sub-table in the state transition table, wherein the accessed sub-table corresponds to the received statement;
receiving a token corresponding to the received statement;
accessing the sub-table corresponding to the received statement based on the received token and a current state; and
carrying out an action corresponding to the received token and the current state.
-
-
8. The method of claim 8, further comprising:
-
receiving a second one of said plurality of statements; and
accessing a second sub-table corresponding to the second received statement.
-
-
9. A method of generating a state transition table defining a plurality of statements in a programming language, comprising:
-
generating a plurality of sub-tables, each sub-table corresponding to one of said plurality of statements; and
assembling said plurality of sub-tables together to generate the state transition table. - View Dependent Claims (10)
-
Specification