On Wed, Feb 10, 2010 at 01:14:01PM +0100, Roman Divacky wrote: > > 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 sentence is still correct, strictly speaking :) Not all context-free grammars can be represented by a FSM, those that can be are the regular languages. Joerg _______________________________________________ [email protected] mailing list http://lists.freebsd.org/mailman/listinfo/freebsd-hackers To unsubscribe, send any mail to "[email protected]"
