Runs one of the rules of a parser instance of type P
given the rules name.
Runs one of the rules of a parser instance of type P
given the rules name.
The rule must have type RuleN[L]
.
An application needs to implement this interface to receive the result of a dynamic parsing run.
An application needs to implement this interface to receive the result of a dynamic parsing run. Often times this interface is directly implemented by the Parser class itself (even though this is not a requirement).
Abstraction for error formatting logic.
Abstraction for error formatting logic. Instantiate with a custom configuration or override with custom logic.
Defines a position in an ParserInput.
Defines a position in an ParserInput.
index into the input buffer (0-based)
the text line the error occurred in (1-based)
the text column the error occurred in (1-based)
The general model of a parser rule.
The general model of a parser rule.
It is characterized by consuming a certain number of elements from the value stack (whose types are captured by the
HList type parameter I
for "Input") and itself pushing a certain number of elements onto the value stack (whose
types are captured by the HList type parameter O
for "Output").
At runtime there are only two instances of this class which signal whether the rule has matched (or mismatched) at the current point in the input.
A mutable untyped stack of values.
A mutable untyped stack of values. In most cases you won't have to access its API directly since parboiled2's DSL should allow you a safer and easier way to interact with the stack. However, in some cases, when you know what you are doing, direct access can be helpful.
THIS IS NOT PUBLIC API and might become hidden in future.
THIS IS NOT PUBLIC API and might become hidden in future. Use only if you know what you are doing!