Re: Regular Expression "Terms"

lab27 <lee.benfield@gmail.com>
Sun, 9 May 2010 10:41:42 -0700 (PDT)

          From comp.compilers
Related articles
Regular Expression "Terms" cfc@shell01.TheWorld.com (Chris F Clark) (2010-05-06)
Re: Regular Expression "Terms" lee.benfield@gmail.com (lab27) (2010-05-09)
Re: Regular Expression "Terms" rpboland@gmail.com (Ralph Boland) (2010-05-10)
Re: Regular Expression "Terms" gah@ugcs.caltech.edu (glen herrmannsfeldt) (2010-05-11)
Re: Regular Expression "Terms" cfc@shell01.TheWorld.com (Chris F Clark) (2010-05-11)
| List of all articles for this month |
From: lab27 <lee.benfield@gmail.com>
Newsgroups: comp.compilers
Date: Sun, 9 May 2010 10:41:42 -0700 (PDT)
Organization: Compilers Central
References: 10-05-030
Keywords: lex
Posted-Date: 09 May 2010 16:07:25 EDT

On May 6, 10:14 pm, Chris F Clark <c...@shell01.TheWorld.com> wrote:
>
> If we extend that to include "or" operators, but no recursion or
> closures ("plus" or "star" operators). You can describe bounded
> length expressions which we call "terms". Note one can include
> "question mark" operators and "character sets" in this class, without
> increasing its expressive power. It's this concept, the "term"
> concept I am most interested in feedback on. I believe we got this
> word from looking at a regular expression grammar.


* is "Kleene Closure". + is often just called Kleene+. A regular
expression without Kleene closure is a "Network Expression".


Rgds,


Lee.


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.