Q: regarding regular grammars ...

Michael Roach <mcr@visi.com>
24 Nov 1997 23:36:48 -0500

          From comp.compilers
Related articles
Q: regarding regular grammars ... mcr@visi.com (Michael Roach) (1997-11-24)
Re: Q: regarding regular grammars ... henry@zoo.toronto.edu (Henry Spencer) (1997-11-28)
Re: Q: regarding regular grammars ... karsten@tdr.dk (Karsten Nyblad) (1997-11-29)
Re: Q: regarding regular grammars ... jos@and.nl (Jos A. Horsmeier) (1997-11-29)
Re: Q: regarding regular grammars ... henry@zoo.toronto.edu (Henry Spencer) (1997-11-30)
Re: Q: regarding regular grammars ... adrian@dcs.rhbnc.ac.uk (1997-12-05)
| List of all articles for this month |
From: Michael Roach <mcr@visi.com>
Newsgroups: comp.compilers
Date: 24 Nov 1997 23:36:48 -0500
Organization: Compilers Central
Keywords: parse, question

Could someone please shed some light on how regular grammars could be
used to specify automata, or transducers, instead of using regular
expressions? I think I've confused myself by reading into some papers.


I thought regular expressions were regular grammars, is that assumption
wrong? And if so, could you explain the differences or point me to some
references. Thanks.


Mike




--

Post a followup to this message

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