This is an experiment in compiling principles, which converts a regular expression into an algorithm that does not determine a poor automaton NFA, and friends who are interested can download it. A regular expression is a literal pattern composed of common characters (such as character a to z) and special characters (called metacharacters). This pattern describes one or more strings that match when looking for a text body. The regular expression is used as a template to match a character pattern to the searched string. The symbol of this example includes: 1. Basic regular expressions, such as ab 2. Repeat, such as a* 3. Choose between various options, such as a BBB 0 b In the Reg Exp of Convert, click enter the regular expression, then click Convert-> To the NFA.

............\reg2NFA.jar
............\src
............\...\reg2nfa
............\...\.......\Constants.java
............\...\.......\EdgeLink.java
............\...\.......\Element.java
............\...\.......\Graph.java
............\...\.......\GraphNode.java
............\...\.......\SpecialEdge.java
............\...\.......\TransformDemo.java
............\...\.......\TransformFrame.java
............\...\.......\TransformModel.java
............\...\.......\TransformView.java

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．