Context Free Grammar

[Lexseal]

CFGs and PDAs go hand in hand. They are equivalent in terms of their ability to generate/recognize languages. We study CFGs just like we study regular expressions. However, the number of tools we can use to analyze them is quite limited.

We want two things mainly:

1. A CFG matcher where one inputs a set of rules and another test string to check if a string can be generated from the CFG. For ref here's a good one
2. A CFG to PDA converter (and maybe vise versa although this direction is more involved.)