SYSTEM, METHOD, AND PROGRAM FOR GENERATING NON-DETERMINISTIC FINITE AUTOMATON NOT INCLUDING e-TRANSITION
OwnerNario Yamagakiinventor
Life of this patent
Estimating the term…
Abstract
An initial setting unit receives from an input device a syntax tree generated from a regular expression, and initializes an NFA and an NFA converting section that applies five conversion patterns to each node of the syntax tree to directly convert the node into an NFA not including ε-transition. When the conversion is finished, the NFA converting section outputs the NFA generated to an output device.
Claims21
A system for generating a non-deterministic finite automaton (NFA) not including ε-transition, the system comprising:
- an initial setting section that performs initial setting of a non-deterministic finite automaton to be generated;
- and
- an NFA converting section that directly generates a non-deterministic finite automaton not including ε-transition based on a regular expression represented by a syntax tree.
A method for generating a non-deterministic finite automaton not including ε-transition, the method comprising:
- performing initial setting of an non-deterministic finite automaton to be generated;
- and
- directly generating a non-deterministic finite automaton not including ε-transition based on a regular expression represented by a syntax tree.
A computer-readable recording medium storing a program that causes a computer to execute the following processing comprising:
- performing initial setting of an non-deterministic finite automaton to be generated;
- and
- directly generating a non-deterministic finite automaton not including ε-transition based on a regular expression represented by a syntax tree.
(canceled)
Dependencies are inferred from the claim text.