Re: Regular Expression tutorial
I found it interesting.
However this document is for people with knowledge about compilers.
For example, you don't define what a token is.
And I think you may put in anywhere the RE's formal definition:
1. E (The empty string)
2. If 'a' is a minimal language component, 'a' is an RE
3. If 'a' and 'b' are RE then:
- (a)(b) is RE
- (a)|(b) is RE
- (a)* , (a)+ are RE
- (a) is RE
I mean, a recursive definition.
Although I think the document is very graphical (many examples).
> -----BEGIN PGP SIGNED MESSAGE-----
> I have prepared a document which is a tutorial for regular
> expressions. Actually I started off writing a tutorial for 'sed' and then
> realized that since 'sed' draws on Regular Expressions so much, I needed
> to explain them. Anyway, the URL is :
> Please take a look and send me any comments you care to make on
> this document. In particular, I would like to know whether I am accurate
> in my various pronouncements.
> New members are urgently needed in the Society for Prevention of
> Cruelty to Yourself. Apply within.
> -----BEGIN PGP SIGNATURE-----
> Version: 2.6.3a
> Charset: noconv
> -----END PGP SIGNATURE-----
> To UNSUBSCRIBE, email to firstname.lastname@example.org
> with a subject of "unsubscribe". Trouble? Contact email@example.com