This question already has an answer here:
- How to show that L = L(G)? 1 answer
When developing a CFG, I find that one can be confused about whether the grammar is correct, i.e. whether it recognizes only the required strings and not other strings.
But this can be hard to see?
Are there techniques and tools for "proof-reading", whether the grammar is correct and succinct enough?