[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Grammar problem
|
From: |
Philip Herron |
|
Subject: |
Grammar problem |
|
Date: |
Mon, 4 Oct 2010 17:06:32 +0100 |
Hey
This i am having trouble trying to think what the grammar would look
like. Say i had the language:
10
1100
111000
How would i represent that in a grammar?
I've been thinking something like:
S->0S0
| B
B-> lambda
| 1B
>From one of my old grammars but that generates 010 or 00100 etc..
just having trouble getting my head into gear today! :)
--Phil
- Grammar problem,
Philip Herron <=