Re: Find the type
- From: Rick Decker <rdecker@xxxxxxxxxxxx>
- Date: Wed, 25 Apr 2007 16:00:06 -0400
Rick Decker wrote:
Ravi wrote:What is the type of following grammar:
S -> aXY
XY -> a
X -> b
Y -> Xb
It's an unrestricted (Chomsky type 0) grammar. However, since the
language it generates is finite, we can find an equivalent
regular grammar:
S -> a | abbb
Oops. That, of course, should be aa | abbb. It's easy to find a
right-linear grammar for this language.
Regards,
Rick
.
- References:
- Find the type
- From: Ravi
- Re: Find the type
- From: Rick Decker
- Find the type
- Prev by Date: Re: Find the type
- Next by Date: How to split binomial heap in O(log(n))?
- Previous by thread: Re: Find the type
- Next by thread: How to split binomial heap in O(log(n))?
- Index(es):
Relevant Pages
|
