Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [5 earlier articles] |
| Re: Regular Expressions torbenm@diku.dk (2004-10-12) |
| Re: Regular Expressions dmaze@mit.edu (David Z Maze) (2004-10-12) |
| Re: Regular Expressions Martin.Ward@durham.ac.uk (Martin Ward) (2004-10-17) |
| Re: Regular Expressions choksheak@yahoo.com (ChokSheak Lau) (2004-10-21) |
| Re: regular expressions wendt@CS.ColoState.EDU (1993-03-22) |
| Regular Expressions rafae1@hp.fciencias.unam.mx (trejo ortiz alejandro augusto) (1995-10-16) |
| Re: Regular Expressions mnp@compass-da.com (Mitchell Perilstein) (1995-10-23) |
| Re: Regular Expressions cgh@cs.rice.edu (1995-10-29) |
| Re: Regular Expressions odunlain@maths.tcd.ie (Colm O'Dunlaing) (1995-10-31) |
| Re: Regular Expressions natasha@softlab.ece.ntua.gr (1995-11-03) |
| Re: Regular Expressions sjmccaug@prairienet.org (1995-11-28) |
| Re: Regular Expressions jmccarty@spdmail.spd.dsccc.com (1995-11-29) |
| Newsgroups: | comp.compilers |
| From: | Mitchell Perilstein <mnp@compass-da.com> |
| In-Reply-To: | 95-10-087 |
| Keywords: | lex, theory |
| Organization: | Compilers Central |
| Date: | Mon, 23 Oct 1995 13:22:42 GMT |
Someone asked:
> I have some problems about regular expressions:
> 1) Is there a canonical form for regular expressions(over a finite alphabet)?
There are canonical forms for finite state automata: binary decision
diagrams and others. There are manipulation on these structures which
may map sensibly back to the regular expression. I can find details if
someone needs them.
---
Mitchell N. Perilstein [\]
COMPASS Design Automation, Columbia MD USA
mnp@compass-da.com
Tel: 410-992-5700 x1225, Fax: 410-992-3536
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.