We finished with all the regular expressions and formal automata stuff, now we moved on to context-free grammers.
Everything's still related, with the grammer taking in variables, terminals, production and start states similar to the DFSA/NFSA material. I liked how you can express many strings in the language this way, it is also very fun but tricky like the exercises for today.
I'm still enjoying my rare workload-free week, I plan to start studying for the third test during the weekend.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment