Parser Combinators

• Parsing → process of identifying a certain kind of structured information about a input and producing a data structure that can be used programmatically.

• If the input is correct , then turn into a more useful data structure , most of the time , a Abstract Syntax Tree .

• If input is not correct, return back to the programmer about the given error.

• Different sets of tokens and rules that are represented in Backus Naur Form (BNF), rules how these work together and the tokens that work together and how they are made out of other rules.

• The recursive structure is mirrored in the parsing.

What are Parser Combinators ?

• Small parsers that combine to make more complex parsers. They are combined together to make larger parsers.

• Combinators name comes from this idea of composing functions and slowly build a large parser from combinations.

• TODO!

• References:

  • You could have invented Parser Combinators