Roman Divacky <[email protected]> writes: > "Dag-Erling Smørgrav" <[email protected]> writes: > > Formally, a regular expression is a textual representation of a > > finite state machine that describes a context-free grammar. > I dont think so.... regular expressions describe regular languages > which are a strict subset of context free languages. The practical > difference is that you cannot describe for example expressions with > parenthesis with a regular expression while you can with a context > free grammar...
You mean nested parentheses? You're right, I didn't think of that. DES -- Dag-Erling Smørgrav - [email protected] _______________________________________________ [email protected] mailing list http://lists.freebsd.org/mailman/listinfo/freebsd-hackers To unsubscribe, send any mail to "[email protected]"
