prolog - right linear context free grammar -


i've problem. have write right linear context free grammar alphapet={0,1} numbers of 0 , numbers od 1 odd. tried write sth. it's doesn't work.

s --> [1],a. s --> [0],b.  --> []. --> [1],c. --> [0],b.  c --> [1],k. c --> [0],b.  b --> [0],k. b --> [1],d.  d --> [1],b. d --> [0],c.  k --> []. k --> s. 

grammar should accept amount of 0s , odd amount of 1s. grammar context free right linear when a->wb or a->w w word under our alphabet , a,b no terminals

how about

s --> [1],oddonesevenzeros. s --> [0],oddzerosevenones.  oddonesevenzeros--> []. oddonesevenzeros--> [1],s. oddonesevenzeros--> [0],oddzerosoddones.  oddzerosevenones--> [1],oddzerosoddones. oddzerosevenones--> [0],s.  oddzerosoddones --> [1],oddzerosevenones. oddzerosoddones --> [0],oddonesevenzeros. 

the grammar regular because don't have remember parts have passed, can remember current state of each, i.e. 4 different states, 1 (odd ones, zeros) accepting. regular grammar, right linear cfg well.


Comments

Popular posts from this blog

apache - Remove .php and add trailing slash in url using htaccess not loading css -

javascript - jQuery show full size image on click -