In a typical parser program written in jparsec, programmer creates a bunch of Parser objects and combines them together. These Parser objects each represent a piece of parsing logic.
How do I start?
With jparsec, one constructs Parser object in terms of the production rule of the grammar. Once a Parser object is created, it can be used as in:
Depending on your need, this return value can be either the calculation result or an abstract syntax tree.
So how does one create Parser object? The following are the most important classes:
A parser encapsulates a piece of parsing logic and simple Parser objects can be combined to create more complex parser.
Common parser implementation.
A scanner is a parser that scans the source string and recognizes certain patterns.
Provides tokenizers and lexers for common terminals such as identifier, integer, scientific number etc.
Supports operator precedence grammar. Programmer declares operators in an OperatorTable and the framework will take care of constructing a full-blown expression parser.
What are the top 5 combinators that I need to familiarize myself with?
This is the logical alternative combinator. A production rule "A ::= B|C|D" can be represented as:
This is the sequential combinator. Production rule "A ::= BCD" can be represented as: With alternative and sequential combinator, one can start building sophisticated parsers.
When constructing a parser, we typically want to not only recognize a certain grammar, but also to build some object or perform some computation based on the recognized grammar. This family of map/sequence combinators can be used to perform such computation. For example, in order to use the parser result of B, C, D to create an object of A, one can implement the callback interface Map3, which accepts the parser result of B, C and D as input parameter and returns the A object as result.
Implementing anonymous class for the Map interfaces could be verbose though. A convenience Mapper class is provided to simplify the syntax. It requires additional dependency on cglib.
These combinators implement the "kleene star" and "kleene cross" logic in BNF. "A ::= B*" is represented as: or where the latter will additionally return a list of Foo object as the parser result.
Production rules can involve recursion. (for example, an expression with binary operators is represented recursively in production rule). The lazy combinator allows a parser to reference a parser that will be set later.
Lexical analysis vs. syntactical analysis
In a simple scenario, all work can be done in the scanning phase. For example:
However, when the complexity of the grammar rule scales up and there are whitespaces and comments to ignore from the grammar, one-pass parsing becomes awkward. A 2-pass approach can then be used. That is, a lexical analysis phase scans the source as a list of Tokens and then a second syntactical analysis phase parses the tokens.
The Terminals class provides common tokenizers that scans the source string and turns them into tokens. It also provides corresponding syntactic parsers that recognize these tokens in the syntactical analysis phase.
A syntactical parser takes a list of tokens as input, this list needs to come from the output of a lexer. The Parser.from() API can be used to chain a syntactical parser with a lexer.
What are the typical steps in creating a conventional 2-pass parser?
Step 1: Terminals
Use the pre-defined tokenizers and terminal syntactical parsers in Terminals to define the atoms of your language.
For example, the following parser parses a list of integers separated by a comma, with hitespaces and block comments ignored.
Step 2: Production rule
The next step is to build the syntactical parser following production rules. The "integers" parser used above is a simple example. Real parsers can be arbitrarily complex. For operator precedence grammar, OperatorTable can be used to declare operator precedences and associativities and construct parser based on the declaration.
As in most recursive descent parsers, left-recursion needs to be avoided. Beware not to write a parser like this:
It will fail with stack overflow!
A less obvious left-recursion is a production rule that looks like:
As many can occur 0 times, we have a potential left recursion here.
Although left recursive grammar isn't generally supported, the most common case of left recursion stems from left associative binary operator, which is handled by OperatorTable.
Please see jparsec Tips for tips and catches.