Unrolling quantifications to control in-degree and/or out-degree of automaton
AssigneeMicron Technology, Inc.
InventorsJunjuan Xu, Paul Glendenning
Life of this patent
Estimating the term…
Abstract
Apparatus, systems, and methods for a compiler are disclosed. One such compiler parses a human readable expression into a syntax tree and converts the syntax tree into an automaton having in-transitions and out-transitions. Converting can include unrolling the quantification as a function of in-degree limitations wherein in-degree limitations includes a limit on the number of transitions into a state of the automaton. The compiler can also convert the automaton into an image for programming a parallel machine, and publishes the image. Additional apparatus, systems, and methods are disclosed.
Claims20
A computer-implemented method comprising:
- converting a quantification into an automaton, wherein converting includes unrolling the quantification to control an in-degree of the automaton;
- and
- converting the automaton into machine code corresponding to a target device.
A computer-readable medium including instructions, which when executed by the computer, cause the computer to perform operations comprising:
- converting a quantification into an automaton, wherein converting includes unrolling the quantification to control an out-degree of the automaton;
- and
- converting the automaton into machine code corresponding to a target device.
Dependencies are inferred from the claim text.