tag:blogger.com,1999:blog-3205414380859703216.post4287241571147235507..comments2023-08-05T08:26:33.769-07:00Comments on F# for game development: Recursive descent parser using active patternsJohann Deneuxhttp://www.blogger.com/profile/11997760819395618904noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-3205414380859703216.post-38970832756220967862012-08-16T03:30:51.079-07:002012-08-16T03:30:51.079-07:00This would not be my method of choice for anything...This would <i>not</i> be my method of choice for anything but very simple grammars. The problem is that bugs are hard to find. For instance, you can't tell if the grammar is ambiguous, whereas a parser generator can't tell you about that (shift/reduce conflicts...)<br /><br />Diagnosing why the parser rejects a string you think should be accepted can be a bit difficult too (but then, it's always tricky regardless of the method anyway).<br /><br />Antlr is what we use at work. We also use active patterns to consume the tree produced by Antlr and produce a typed abstract syntax tree.Johann Deneuxhttps://www.blogger.com/profile/11997760819395618904noreply@blogger.comtag:blogger.com,1999:blog-3205414380859703216.post-35585341555371952172012-08-15T16:39:30.330-07:002012-08-15T16:39:30.330-07:00Would you consider this approach viable for parsin...Would you consider this approach viable for parsing say language files, like clojure source etc?Dave Thomashttps://www.blogger.com/profile/09971721667055138594noreply@blogger.com