I'm thinking of writing a parser for EBNF (Extended Backus-Naur Form). The BNF is the format that one often finds in computer books to describe the syntax of a statement.

-
I'm thinking of writing a parser for EBNF (Extended Backus-Naur Form). The BNF is the format that one often finds in computer books to describe the syntax of a statement.
Any ideas? Is there perhaps someone that has created such a solution? Does anyone have suggestions how I should go about to do this?

Comments

  1. Eugene KotlyarovOctober 17, 2017 at 12:08 PM

    I would recommend using some functional language that has parser combinator library (Haskell/parsec, F#/FParsec) this is kind of application when they really shine

    ReplyDelete
  2. Johan SwartOctober 17, 2017 at 12:30 PM

    Thanks all for the recommendations! I'll check them all out!

    ReplyDelete
  3. David HoyleOctober 20, 2017 at 2:56 PM

    Shameless plug but Browse and Doc It (davidghoyle.co.uk - Browse and Doc It – Dave's Development Blog) Already parses an extended BNF format in the IDE as I use it for documenting all the files I parse.

    ReplyDelete

Post a Comment