Re: languages
- From: Barb Knox <see@xxxxxxxxx>
- Date: Mon, 13 Feb 2006 20:00:56 +1300
In article <1139804684.215781.317100@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
"jason_box" <cppisfun@xxxxxxxxx> wrote:
I have this problem that I'm trying to solve that involves writing down
a grammar for the following structures:
L = {a^nb*a^n : n >= 0} and L ={ z in {0,1,2}* : number of 0's are
equal to number of 1's + number of 2's }
Does anyone have any ideas on how to generate a simle CFG for that?
This sounds like homework, n'est-ce pas.
Show us what you've done and where you got stuck; doing that will likely
produce some helpful replies.
--
---------------------------
| BBB b \ Barbara at LivingHistory stop co stop uk
| B B aa rrr b |
| BBB a a r bbb | Quidquid latine dictum sit,
| B B a a r b b | altum viditur.
| BBB aa a r bbb |
-----------------------------
.
- Follow-Ups:
- Re: languages
- From: jason_box
- Re: languages
- From: jason_box
- Re: languages
- References:
- languages
- From: jason_box
- languages
- Prev by Date: Re: X3SAT Question
- Next by Date: Re: languages
- Previous by thread: languages
- Next by thread: Re: languages
- Index(es):
Relevant Pages
|
|
