Re: Why Chomsky Type 3 grammars are called "Regular"?

"valentin tihomirov" <spam@abelectron.com>
28 Nov 2004 23:22:13 -0500

          From comp.compilers
Related articles
Why Chomsky Type 3 grammars are called "Regular"? spam@abelectron.com (valentin tihomirov) (2004-10-17)
Re: Why Chomsky Type 3 grammars are called "Regular"? mefrill@yandex.ru (2004-10-21)
Re: Why Chomsky Type 3 grammars are called "Regular"? torbenm@diku.dk (2004-10-21)
Re: Why Chomsky Type 3 grammars are called "Regular"? dev@gioelebarabucci.com (Gioele Barabucci) (2004-10-23)
Re: Why Chomsky Type 3 grammars are called "Regular"? spam@abelectron.com (valentin tihomirov) (2004-11-28)
Re: Why Chomsky Type 3 grammars are called "Regular"? torbenm@diku.dk (2004-12-01)
Re: Why Chomsky Type 3 grammars are called "Regular"? spam@abelectron.com (valentin tihomirov) (2004-12-05)
Re: Why Chomsky Type 3 grammars are called "Regular"? henry@spsystems.net (2004-12-11)
| List of all articles for this month |
From: "valentin tihomirov" <spam@abelectron.com>
Newsgroups: comp.compilers
Date: 28 Nov 2004 23:22:13 -0500
Organization: Compilers Central
References: 04-10-111 04-10-144
Keywords: parse, history, question
Posted-Date: 28 Nov 2004 23:22:13 EST

Regular expressions can be used to describe type2 languages; therefore I'm
asking the question. Why T3 steals the name which should pertaining to T2?


> There is a theorem, which says each regular language (i.e. language,
> which can be constructed by using three operation above) can be
> defined by using three equivalent devices: Chomsky type 3 grammar,
> regular expression and finite state machine. Thus, such the
> equivalence is the reason to name type 3 grammars as "regular" ones.

Post a followup to this message

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