Let L3 be the set of algebraic expressions involving identifiers x and y, operations + and * and left and right parentheses. Then L3 is a context-free language. For the following context-free grammar G3 = <>3 ,
3, S , P3 > generates L3 :V3 = { S } ,
3 = { x , y , ( , ) , + , * } and P3 = { S -> ( S + S ) , S -> S*S , S -> x , S -> y }Reference: http://www.cs.odu.edu/~toida/nerzic/390teched/cfl/cfg.html
I'm just curious how P3 = all that chunk? If Danny is reading this post, please give me some feedback, thanks!
Anyway, just wanted to take the chance here to thank Danny for being such an amazing prof for both of my 165 and 236 course. I wonder what courses will be taught in the winter term by Danny.
No comments:
Post a Comment