Question about string pattern matching  
Author Message
George2 via JavaKB.com





PostPosted: 2006-1-10 15:11:00 Top

java-programmer, Question about string pattern matching Roedy,


Roedy Green wrote:
>On Mon, 09 Jan 2006 21:40:00 -0600, Alan Krueger
><email***@***.com> wrote, quoted or indirectly quoted someone
>who said :
>
>>If you insist on writing this yourself, study finite automata and
>>regular languages. Build a tool that translates regular expressions
>>into non-deterministic finite automata (NFAs) then transforms those into
>>optimized deterministic finite automata (DFAs). Make it so these are
>>compiled into Java source or bytecode directly for speed.
>
>or use a generated parser. See http://mindprod.com/jgloss/parser.html
>
>Also see http://mindprod.com/jgloss/finitestate.html

The resources are very useful!


regards,
George

--
Message posted via http://www.javakb.com
 
George2 via JavaKB.com





PostPosted: 2006-1-10 15:11:00 Top

java-programmer >> Question about string pattern matching Roedy,


Roedy Green wrote:
>On Mon, 09 Jan 2006 21:40:00 -0600, Alan Krueger
><email***@***.com> wrote, quoted or indirectly quoted someone
>who said :
>
>>If you insist on writing this yourself, study finite automata and
>>regular languages. Build a tool that translates regular expressions
>>into non-deterministic finite automata (NFAs) then transforms those into
>>optimized deterministic finite automata (DFAs). Make it so these are
>>compiled into Java source or bytecode directly for speed.
>
>or use a generated parser. See http://mindprod.com/jgloss/parser.html
>
>Also see http://mindprod.com/jgloss/finitestate.html

The resources are very useful!


regards,
George

--
Message posted via http://www.javakb.com
 
Alan Krueger





PostPosted: 2006-1-11 9:32:00 Top

java-programmer >> Question about string pattern matching George2 via JavaKB.com wrote:
> Thank you very much for your advice! It seems that you are an expert of
> regular expression.

No, what I've quoted is generally what you get with a simple four-year
college degree in computer science, at least in most accredited colleges
in the USA.

More specifically, finite automata, regular expressions, push-down
automata, context-free grammars, and Turing machines are typically
introduced in a one-term undergraduate class in many CS programs.