Back to results
US 2004/0172234 A1Published application
Hardware accelerator personality compiler
OwnerMichael C. Dapp, Sai Lun Nginventors
Life of this patent
Estimating the term…
Loading patent…
Loading patent…
OwnerMichael C. Dapp, Sai Lun Nginventors
Estimating the term…
Error-free state tables are automatically generated from a specification of a group of desired performable functions, such as are provided in a programming language in a formal notation such as Backus-Naur form or a derivative thereof by discriminating tokens corresponding to respective performable functions, identifications, arguments, syntax, grammar rules, special symbols and the like. The tokens may be recursive (e.g. infinite), in which case they are transformed into a finite automata which may be deterministic or non-deterministic. Non-deterministic finite automata are transformed into deterministic finite automata and then into state transitions which are used to build a state table which can then be stored or, preferably, loaded into a finite state machine of a hardware parser accelerator to define its personality.
A method of providing state tables in a self-describing format, said method comprising steps of
A personality compiler comprising
A hardware parser accelerator including
Dependencies are inferred from the claim text.