- Category:
- Ajax
- Tags:
-
[Java]
[源码]
- File Size:
- 35.07kb
- Update:
- 2008-10-13
- Downloads:
- 0 Times
- Uploaded by:
- jx520ys
Description: 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.
- [Regular] - input is a regular expression, you can u
- [good-ebook] - Several very good e-book 1.SQL Language
- [CompileEbook] - Compiler Construction Principles and Pra
- [my-nfa] - This is what I wrote it myself will be t
- [cv395] - By VC++ Language since the animation flo
- [[NFA+TO+DFA]] - [NFA+ TO+ DFA] very very powerful, all h
- [Lexical] - dfa he NFA conversion between ah If ther
- [Automate] - graphic Automaton simulator,NFA to DFA c
- [java] - An experiment is to a regular expression
File list (Check if you may need any files):
Download