One-pass greedy-pattern-matching finite-state-machine code generation

A computerized system comprising:

• an intermediate code wherein the intermediate code comprises a plurality of elements in a postfix-notated intermediate code;
• a local code;
• and,
• a code generator to generate within one pass of the intermediate code and in a greedy-pattern-matching nature and a finite-state-machine manner, the local code from the intermediate code based on application of base rules and chain rules within a predetermined grammar and wherein the code generator generates the local code from the intermediate code in the greedy-pattern-matching nature by always applying a base rule to a current element of the intermediate code when the current element matches a base rule.

A computerized device comprising:

• a processor;
• a computer-readable medium;
• a post-fix-notated intermediate code comprising a plurality of elements stored as data on the medium;
• a local code native to the processor stored as data on the medium;
• and
• a virtual machine executed by the processor from the medium and including a code generator to generate within one pass of the intermediate code and in a greedy-pattern-matching nature and a finite-state-machine manner, the local code from the intermediate code based on application of base rules and chain rules within a predetermined grammar according to a predetermined criteria and wherein the code generator generates the local code from the intermediate code in the greedy-pattern-matching nature by always applying a base rule to a current element of the intermediate code when the current element matches a base rule.

A computer-readable medium having processor instructions stored thereon for execution by a processor to perform a method for generating local code from intermediate code comprising:

• setting a first element of the intermediate code as a current element;
• receiving the current element of a postfix-notated intermediate code;
• matching the current element to a base rule within a predetermined intermediate-code-to-local-code grammar, including matching a most recent element to a chain rule within the grammar and applying the chain rule to the most recent element to determine whether the current element matches a given base rule;
• selecting and applying a matching base rule based on a predetermined criteria;
• generating a local code according to the matching base rule applied to the current element, including initially generating a local code according to the chain rule applied to the most recent element;
• advancing to a next element of the intermediate code as the current element;
• and,
• repeating until the current element is past a last element of the intermediate code.

A computer-implemented method for generating local code from intermediate code comprising:

• receiving a current element of the intermediate code;
• matching the current element to a plurality of chain rules within a predetermined intermediate code-to-local code grammar;
• receiving a next element of the intermediate code;
• matching the next element to a base rule within a predetermined intermediate-code-to-local code grammar;
• selecting one of the plurality of matched chain rules for application, based on a dependency indicated by the next element;
• applying the selected one of the plurality of chain rules to the current element to perform an action specified by the chain rule;
• and
• applying the base rule to the next element to perform an action specified by the base rule, wherein the applying operations result in emission of local code corresponding to the current element and the next element.

A computer-readable medium having processor instructions stored thereon for execution by a processor to perform a computer process for generating local code from intermediate code, the computer process comprising:

• receiving a current element of the intermediate code;
• matching the current element to a plurality of chain rules within a predetermined intermediate code-to-local code grammar;
• receiving a next element of the intermediate code;
• matching the next element to a base rule within a predetermined intermediate-code-to-local code grammar;
• selecting one of the plurality of matched chain rules for application, based on a dependency indicated by the next element;
• applying the selected one of the plurality of chain rules to the current element to perform an action specified by the chain rule;
• and
• applying the base rule to the next element to perform an action specified by the base rule, wherein the applying operations result in emission of local code corresponding to the current element and the next element.