Full support for extended regular expressions (those with intersection and complement); Support for some kinds of cycles in grammar; DFA-based operation; Unicode support; C++ only, requires a modern compiler; Lexical analyzers can be configured to get symbols from any input class (built-in support for std::istream, std::wistream and FILE *); Designed to work with Whale, but can work standalone or interface to other parsers.
Java Regex Primer Since version 1.4, Java has had support for Regular expressions in the core API. Java Regex follows the same basic principles used in other languages, just withdi erent access methods, and some subtledi erences with the patterns. This primer is aimed towards developers already familiar with regex in other languages wanting a brief outline of its support in Java. It may also be beneficial to developers learning regex if used in conjunction with detailed documentation explaining the construction of regex patterns. Reading the javadoc forjava.util.regex. Pattern is a must to see how the Java regex patterns aredi erent from other languages such as Perl. Most of the functions discussed herin are from thejava.util.regex. Matcher class with a few fromjava.util.regex. Pattern. Reading this text in conjunction with the javadoc of those classes is advised.
http://w3eval.calcsharp.net/
W3Eval is Java applet that evaluates mathematical expressions. It uses different approach from conventional calculator, which is more natural to the way people calculate.
Sams Teach Yourself Regular expressions in 10 Minutes
By Ben Forta
Publisher : Sams Publishing
Pub Date : February 28, 2004
ISBN : 0-672-32566-7
Pages : 192
Lex helps write programs whose control flow is directed by instances of regular
expressions in the input stream. It is well suited for editor-script type transformations
and for segmenting input in preparation for a parsing routine.
