Is there a tool that can receive BNF grammar as input and produce a DFA from it? I have already found the 'hackingoff' tool in here: http://hackingoff.com/
But it is more of a testing tool and does not work on large grammars.
Asked
Active
Viewed 845 times
-2
-
What you found doesn't turn BNF into DFA (for reasons explained in the answer). The only thing it does with BNF grammars is do some preprocessing needed for LL(1) parsers. The DFAs are generated by the lexer generator and the regex implementation. Reading comprehension helps ;-) – Jun 26 '13 at 18:28
1 Answers
3
DFAs do not have sufficient power to implement context-free parsers, e.g., what you can express with BNF. There is no such tool.
The specified website does not offer any such tool, either.
Ira Baxter
- 93,541
- 22
- 172
- 341
-
2Exactly. +1 What you should be looking for is a BNF to DPDA conversion. – user207421 Jun 26 '13 at 11:25