Parse EBNF: Difference between revisions

← Older editNewer edit →
Content deleted Content added
Underscore (talk | contribs)
845 edits
Changed the task to something hopefully more concrete. Added a Haskell implementation.
m wordliness
Line 1:
{{clarified-review}}{{draft task}}[[Category:Recursion]]
Write a program that can parse a grammar in Extended Backus–Naur Form and then parse something else according to the grammar. The program is only required to decide whether or not the something else belongs to the language described by the grammar, but for extra credit, it can output a syntax tree. See [[Parse EBNF/Tests|the tests]].
 
Your program is only required to decide whether or not the something else belongs to the language described by the grammar, but for extra credit, it can output a syntax tree.
 
=={{header|Haskell}}==
Retrieved from "https://rosettacode.org/wiki/Parse_EBNF"