Misplaced Pages

Packrat parser

Class	Parsing grammars that are PEG
Data structure	String
Worst-case performance	${\displaystyle O(n)}$ or ${\displaystyle O(n^{2})}$ without special handling of iterative combinator
Best-case performance	${\displaystyle O(n)}$
Average performance	${\displaystyle O(n)}$
Worst-case space complexity	${\displaystyle O(n)}$

The Packrat parser is a type of parser that shares similarities with the recursive descent parser in its construction. However, it differs because it takes parsing expression grammars (PEGs) as input rather than LL grammars.

In 1970, Alexander Birman laid the groundwork for packrat parsing by introducing the "TMG recognition scheme" (TS), and "generalized TS" (gTS). TS was based upon Robert M. McClure's TMG compiler-compiler, and gTS was based upon Dewey Val Schorre's META compiler-compiler. Birman's work was later refined by Aho and Ullman; and renamed as Top-Down Parsing Language (TDPL), and Generalized TDPL (GTDPL), respectively. These algorithms were the first of their kind to employ deterministic top-down parsing with backtracking.

Bryan Ford developed PEGs as an expansion of GTDPL and TS. Unlike CFGs, PEGs are unambiguous and can match well with machine-oriented languages. PEGs, similar to GTDPL and TS, can also express all LL(k) and LR(k). Bryan also introduced Packrat as a parser that uses memoization techniques on top of a simple PEG parser. This was done because PEGs have an unlimited lookahead capability resulting in a parser with exponential time performance in the worst case.

Packrat keeps track of the intermediate results for all mutually recursive parsing functions. Each parsing function is only called once at a specific input position. In some instances of packrat implementation, if there is insufficient memory, certain parsing functions may need to be called multiple times at the same input position, causing the parser to take longer than linear time.

Syntax

The packrat parser takes in input the same syntax as PEGs: a simple PEG is composed of terminal and nonterminal symbols, possibly interleaved with operators that compose one or several derivation rules.

Symbols

• Nonterminal symbols are indicated with capital letters (e.g., ${\displaystyle \{S,E,F,D\}}$)
• Terminal symbols are indicated with lowercase (e.g., ${\displaystyle \{a,b,z,e,g\}}$)
• Expressions are indicated with lower-case Greek letter (e.g., ${\displaystyle \{\alpha ,\beta ,\gamma ,\omega ,\tau \}}$)
  • Expressions can be a mix of terminal symbols, nonterminal symbols and operators

Operators

Syntax Rules

Operator	Semantics
Sequence ${\displaystyle \alpha \beta }$	Success: If ${\displaystyle \alpha }$ and ${\displaystyle \beta }$ are recognized Failure: If ${\displaystyle \alpha }$ or ${\displaystyle \beta }$ are not recognized Consumed: ${\displaystyle \alpha }$ and ${\displaystyle \beta }$ in case of success
Ordered choice ${\displaystyle \alpha /\beta /\gamma }$	Success: If any of ${\displaystyle \{\alpha ,\beta ,\gamma \}}$ is recognized starting from the left Failure: All of ${\displaystyle \{\alpha ,\beta ,\gamma \}}$ do not match Consumed: The atomic expression that has generated a success so if multiple succeed the first one is always returned
And predicate ${\displaystyle \&\alpha }$	Success: If ${\displaystyle \alpha }$ is recognized Failure: If ${\displaystyle \alpha }$ is not recognized Consumed: No input is consumed
Not predicate ${\displaystyle !\alpha }$	Success: If ${\displaystyle \alpha }$ is not recognized Failure: If ${\displaystyle \alpha }$ is recognized Consumed: No input is consumed
One or more ${\displaystyle \alpha +}$	Success: Try to recognize ${\displaystyle \alpha }$ one or multiple time Failure: If ${\displaystyle \alpha }$ is not recognized Consumed: The maximum number that ${\displaystyle \alpha }$ is recognized
Zero or more ${\displaystyle \alpha *}$	Success: Try to recognize ${\displaystyle \alpha }$ zero or multiple time Failure: Cannot fail Consumed: The maximum number that ${\displaystyle \alpha }$ is recognized
Zero or one ${\displaystyle \alpha ?}$	Success: Try to recognize ${\displaystyle \alpha }$ zero or once Failure: Cannot fail Consumed: ${\displaystyle \alpha }$ if it is recognized
Terminal range [${\displaystyle a-b}$]	Success: Recognize any terminal ${\displaystyle c}$ that are inside the range ${\displaystyle }$. In the case of ${\displaystyle }$, ${\displaystyle c}$ can be any letter from h to z Failure: If no terminal inside of ${\displaystyle }$ can be recognized Consumed: ${\displaystyle c}$ if it is recognized
Any character ${\displaystyle .}$	Success: Recognize any character in the input Failure: If no character in the input Consumed: any character in the input

Rules

A derivation rule is composed by a nonterminal symbol and an expression ${\displaystyle S\rightarrow \alpha }$.

A special expression ${\displaystyle \alpha _{s}}$ is the starting point of the grammar. In case no ${\displaystyle \alpha _{s}}$ is specified, the first expression of the first rule is used.

An input string is considered accepted by the parser if the ${\displaystyle \alpha _{s}}$ is recognized. As a side-effect, a string ${\displaystyle x}$ can be recognized by the parser even if it was not fully consumed.

An extreme case of this rule is that the grammar ${\displaystyle S\rightarrow x*}$ matches any string.

This can be avoided by rewriting the grammar as ${\displaystyle S\rightarrow x*!.}$

Example

${\displaystyle {\begin{cases}S\rightarrow A/B/D\\A\rightarrow {\textbf {'a'}}\ S\ {\textbf {'a'}}\\B\rightarrow {\textbf {'b'}}\ S\ {\textbf {'b'}}\\D\rightarrow ({\textbf {'0'}}-{\textbf {'9'}})?\end{cases}}}$

This grammar recognizes a palindrome over the alphabet ${\displaystyle \{a,b\}}$, with an optional digit in the middle.

Example strings accepted by the grammar include: ${\displaystyle {\textbf {'aa'}}}$ and ${\displaystyle {\textbf {'aba3aba'}}}$.

Left recursion

Left recursion happens when a grammar production refers to itself as its left-most element, either directly or indirectly. Since Packrat is a recursive descent parser, it cannot handle left recursion directly. During the early stages of development, it was found that a production that is left-recursive can be transformed into a right-recursive production. This modification significantly simplifies the task of a Packrat parser. Nonetheless, if there is an indirect left recursion involved, the process of rewriting can be quite complex and challenging. If the time complexity requirements are loosened from linear to superlinear, it is possible to modify the memoization table of a Packrat parser to permit left recursion, without altering the input grammar.

Iterative combinator

The iterative combinator ${\displaystyle \alpha +}$, ${\displaystyle \alpha *}$, needs special attention when used in a Packrat parser. As a matter of fact, the use of iterative combinators introduces a secret recursion that does not record intermediate results in the outcome matrix. This can lead to the parser operating with a superlinear behaviour. This problem can be resolved apply the following transformation:

Original	Translated
${\displaystyle S\rightarrow \alpha +}$	${\displaystyle S\rightarrow \alpha S/\alpha }$
${\displaystyle S\rightarrow \alpha *}$	${\displaystyle S\rightarrow \alpha S/\epsilon }$

With this transformation, the intermediate results can be properly memoized.

Memoization technique

Memoization is an optimization technique in computing that aims to speed up programs by storing the results of expensive function calls. This technique essentially works by caching the results so that when the same inputs occur again, the cached result is simply returned, thus avoiding the time-consuming process of re-computing. When using packrat parsing and memoization, it's noteworthy that the parsing function for each nonterminal is solely based on the input string. It does not depend on any information gathered during the parsing process. Essentially, memoization table entries do not affect or rely on the parser's specific state at any given time.

Packrat parsing stores results in a matrix or similar data structure that allows for quick look-ups and insertions. When a production is encountered, the matrix is checked to see if it has already occurred. If it has, the result is retrieved from the matrix. If not, the production is evaluated, the result is inserted into the matrix, and then returned. When evaluating the entire ${\displaystyle m*n}$ matrix in a tabular approach, it would require ${\displaystyle \Theta (mn)}$ space. Here, ${\displaystyle m}$ represents the number of nonterminals, and ${\displaystyle n}$ represents the input string size.

In a naïve implementation, the entire table can be derived from the input string starting from the end of the string.

The Packrat parser can be improved to update only the necessary cells in the matrix through a depth-first visit of each subexpression tree. Consequently, using a matrix with dimensions of ${\displaystyle m*n}$ is often wasteful, as most entries would remain empty. These cells are linked to the input string, not to the nonterminals of the grammar. This means that increasing the input string size would always increase memory consumption, while the number of parsing rules changes only the worst space complexity.

Cut operator

Another operator called cut has been introduced to Packrat to reduce its average space complexity even further. This operator utilizes the formal structures of many programming languages to eliminate impossible derivations. For instance, control statements parsing in a standard programming language is mutually exclusive from the first recognized token, e.g.,${\displaystyle \{if,do,while,switch\}}$.

Operator	Semantics
Cut ${\displaystyle {\begin{array}{l}\alpha \uparrow \beta /\gamma \\(\alpha \uparrow \beta )*\end{array}}}$	if ${\displaystyle \alpha }$ is recognized but ${\displaystyle \beta }$ is not, skip the evaluation of the alternative. In the first case don't evaluate ${\displaystyle \gamma }$ if ${\displaystyle \alpha }$ was recognized The second rule is can be rewritten as ${\displaystyle N\rightarrow \alpha \uparrow \beta N/\epsilon }$ and the same rules can be applied.

When a Packrat parser uses cut operators, it effectively clears its backtracking stack. This is because a cut operator reduces the number of possible alternatives in an ordered choice. By adding cut operators in the right places in a grammar's definition, the resulting Packrat parser only needs a nearly constant amount of space for memoization.

The algorithm

Sketch of an implementation of a Packrat algorithm in a Lua-like pseudocode.

INPUT(n) -- return the character at position n
RULE(R : Rule, P : Position )
    entry = GET_MEMO(R,P) -- return the number of elements previously matched in rule R at position P
    if entry == nil then
        return EVAL(R, P);
    end
    return entry;
EVAL(R : Rule, P : Position )
    start = P;   
    for choice in R.choices -- Return a list of choice
        acc=0;
        for symbol in choice then -- Return each element of a rule, terminal and nonterminal
            if symbol.is_terminal then
                if INPUT(start+acc) == symbol.terminal then
                    acc = acc + 1; --Found correct terminal skip pass it
                else
                    break;                
                end
            else 
                res = RULE(symbol.nonterminal , start+acc ); -- try to recognize a nonterminal in position start+acc
                SET_MEMO(symbol.nonterminal , start+acc, res ); -- we memoize also the failure with special value fail
                if res == fail then  
                    break; 
                end
                acc = acc + res;
            end
            if symbol == choice.last -- check if we have matched the last symbol in a choice if so return
                return acc;
        end
    end
    return fail; --if no choice match return fail

Example

Given the following context, a free grammar that recognizes simple arithmetic expressions composed of single digits interleaved by sum, multiplication, and parenthesis.

${\displaystyle {\begin{cases}S\rightarrow A\\A\rightarrow M\ {\textbf {'+'}}\ A\ /\ M\\M\rightarrow P\ {\textbf {'*'}}\ M\ /\ P\\P\rightarrow {\textbf {'('}}\ A\ {\textbf {')'}}\ /\ D\\D\rightarrow ({\textbf {'0'}}-{\textbf {'9'}})\end{cases}}}$

Denoted with ${\displaystyle \dashv }$ the line terminator we can apply the packrat algorithm

Derivation of ${\displaystyle 2*(3+4)\dashv }$

Syntax tree	Action	Packrat Table
	Derivation Rules Input shifted ${\displaystyle {\begin{array}{l}S\rightarrow A\\A\rightarrow M\ {\textbf {'+'}}\ A\\M\rightarrow P\ {\textbf {'*'}}\ M\\P\rightarrow {\textbf {'('}}\ A\ {\textbf {')'}}\end{array}}}$ ɛ Notes Input left Input doesn't match the first element in the derivation. Backtrack to the first grammar rule with unexplored alternative ${\textstyle P\rightarrow {\textbf {'('}}\ A\ {\textbf {')'}}\ /\ {\underline {D}}}$ ${\displaystyle 2*(3+4)\dashv }$	Index 1 2 3 4 5 6 7 S A M P D 2 * ( 3 + 4 ) No update because no terminal was recognized
	Derivation Rules Input shifted ${\displaystyle P\rightarrow D}$ ${\displaystyle D\rightarrow 2}$ ${\displaystyle 2}$ Notes Input left Shift input by one after deriving terminal ${\displaystyle 2}$ ${\displaystyle *(3+4)\dashv }$	Index 1 2 3 4 5 6 7 S A M P 1 D 1 2 * ( 3 + 4 ) Update: D(1) = 1; P(1) = 1;
	Derivation Rules Input shifted ${\displaystyle M\rightarrow P\ {\textbf {'*'}}\ M}$ ${\displaystyle P\rightarrow {\textbf {'('}}\ A\ {\textbf {')'}}}$ ${\displaystyle 2*(}$ Notes Input left Shift input by two terminal ${\displaystyle \{{\textbf {*}},{\textbf {(}}\}}$ ${\displaystyle 3+4)\dashv }$	Index 1 2 3 4 5 6 7 S A M P 1 D 1 2 * ( 3 + 4 ) No update because no nonterminal was fully recognized
	Derivation Rules Input shifted ${\displaystyle A\rightarrow M\ {\textbf {'+'}}\ A}$ ${\displaystyle M\rightarrow P\ {\textbf {'*'}}\ M}$ ${\displaystyle P\rightarrow {\textbf {'('}}\ A\ {\textbf {')'}}}$ ${\displaystyle 2*(}$ Notes Input left Input doesn't match the first element in the derivation. Backtrack to the first grammar rule with unexplored alternative ${\textstyle P\rightarrow {\textbf {'('}}\ A\ {\textbf {')'}}\ /\ {\underline {D}}}$ ${\displaystyle 3+4)\dashv }$	Index 1 2 3 4 5 6 7 S A M P 1 D 1 2 * ( 3 + 4 ) No update because no terminal was recognized
	Derivation Rules Input shifted ${\displaystyle P\rightarrow D}$ ${\displaystyle D\rightarrow 3}$ ${\displaystyle 2*(}$ Notes Input left Shift input by one after deriving terminal ${\displaystyle 3}$ but the new input will not match ${\displaystyle }$ inside ${\displaystyle M\rightarrow P\ {\textbf {'*'}}\ M}$ so an unroll is necessary to ${\displaystyle M\rightarrow P\ {\textbf {'*'}}\ M\ /\ {\underline {P}}}$ ${\displaystyle 3+4)\dashv }$	Index 1 2 3 4 5 6 7 S A M P 1 1 D 1 1 2 * ( 3 + 4 ) Update: D(4) = 1; P(4) = 1;
	Derivation Rules Input shifted ${\displaystyle M\rightarrow P}$ ${\displaystyle 2*(3+}$ Notes Input left Roll Back to ${\displaystyle M\rightarrow P\ {\textbf {'*'}}\ M\ /\ {\underline {P}}}$ And we don't expand it has we have an hit in the memoization table P(4) ≠ 0 so shift the input by P(4). Shift also the ${\displaystyle +}$ from ${\displaystyle A\rightarrow M\ {\textbf {'+'}}\ A}$ ${\displaystyle 4)\dashv }$	Index 1 2 3 4 5 6 7 S A M 1 P 1 1 D 1 1 2 * ( 3 + 4 ) Hit on P(4) Update M(4) = 1 as M was recognized
	Derivation Rules Input shifted ${\displaystyle A\rightarrow M\ {\textbf {'+'}}\ A}$ ${\displaystyle M\rightarrow P\ {\textbf {'*'}}\ M}$ ${\displaystyle P\rightarrow {\textbf {'('}}\ A\ {\textbf {')'}}}$ ${\displaystyle 2*(3+}$ Notes Input left Input doesn't match the first element in the derivation. Backtrack to the first grammar rule with unexplored alternative ${\textstyle P\rightarrow {\textbf {'('}}\ A\ {\textbf {')'}}\ /\ {\underline {D}}}$ ${\displaystyle 4)\dashv }$	Index 1 2 3 4 5 6 7 S A M 1 P 1 1 D 1 1 2 * ( 3 + 4 ) No update because no terminal was recognized
	Derivation Rules Input shifted ${\displaystyle P\rightarrow D}$ ${\displaystyle D\rightarrow 4}$ ${\displaystyle 2*(3+}$ Notes Input left Shift input by one after deriving terminal ${\displaystyle 4}$ but the new input will not match ${\displaystyle }$ inside ${\displaystyle M\rightarrow P\ {\textbf {'*'}}\ M}$ so an unroll is necessary ${\displaystyle 4)\dashv }$	Index 1 2 3 4 5 6 7 S A M 1 P 1 1 1 D 1 1 1 2 * ( 3 + 4 ) Update: D(6) = 1; P(6) = 1;
	Derivation Rules Input shifted ${\displaystyle M\rightarrow P}$ ${\displaystyle 2*(3+}$ Notes Input left Roll Back to ${\displaystyle M\rightarrow P\ {\textbf {'*'}}\ M\ /\ {\underline {P}}}$ And we don't expand it has we have an hit in the memoization table P(6) ≠ 0 so shift the input by P(6). but the new input will not match ${\displaystyle +}$ inside ${\displaystyle A\rightarrow M\ {\textbf {'+'}}\ A}$ so an unroll is necessary ${\displaystyle 4)\dashv }$	Index 1 2 3 4 5 6 7 S A M 1 1 P 1 1 1 D 1 1 1 2 * ( 3 + 4 ) Hit on P(6) Update M(6) = 1 as M was recognized
	Derivation Rules Input shifted ${\displaystyle A\rightarrow M}$ ${\displaystyle 2*(3+4)}$ Notes Input left Roll Back to ${\displaystyle A\rightarrow M\ {\textbf {'+'}}\ A\ /\ {\underline {M}}}$ And we don't expand it has we have an hit in the memoization table M(6) ≠ 0 so shift the input by M(6). Also shift ${\displaystyle )}$ from ${\displaystyle P\rightarrow {\textbf {'('}}\ A\ {\textbf {')'}}}$ ${\displaystyle \dashv }$	Index 1 2 3 4 5 6 7 S A 3 M 1 1 P 1 5 1 1 D 1 1 1 2 * ( 3 + 4 ) Hit on M(6) Update A(4) = 3 as A was recognized Update P(3)=5 as P was recognized
	Derivation Rules Input shifted ${\displaystyle 2*}$ Notes Input left Roll Back to ${\displaystyle M\rightarrow P\ {\textbf {'*'}}\ M\ /\ {\underline {P}}}$ as terminal ${\displaystyle *\neq \dashv }$ ${\displaystyle (3+4)\dashv }$	Index 1 2 3 4 5 6 7 S A 3 M 1 1 P 1 5 1 1 D 1 1 1 2 * ( 3 + 4 ) No update because no terminal was recognized
	Derivation Rules Input shifted ${\displaystyle M\rightarrow P}$ ${\displaystyle 2*(3+4)}$ Notes Input left we don't expand it as we have a hit in the memoization table P(3) ≠ 0, so shift the input by P(3). ${\displaystyle \dashv }$	Index 1 2 3 4 5 6 7 S A 3 M 7 1 1 P 1 5 1 1 D 1 1 1 2 * ( 3 + 4 ) Hit on P(3) Update M(1)=7 as M was recognized
	Derivation Rules Input shifted Notes Input left Roll Back to ${\displaystyle A\rightarrow M\ {\textbf {'+'}}\ A\ /\ {\underline {M}}}$ as terminal ${\displaystyle +\neq \dashv }$ ${\displaystyle 2*(3+4)\dashv }$	Index 1 2 3 4 5 6 7 S A 3 M 7 1 1 P 1 5 1 1 D 1 1 1 2 * ( 3 + 4 ) No update because no terminal was recognized
	Derivation Rules Input shifted ${\displaystyle A\rightarrow M}$ ${\displaystyle 2*(3+4)\dashv }$ Notes Input left We don't expand it as we have a hit in the memoization table M(1) ≠ 0, so shift the input by M(1). S was totally reduced, so the input string is recognized.	Index 1 2 3 4 5 6 7 S 7 A 7 3 M 7 1 1 P 1 5 1 1 D 1 1 1 2 * ( 3 + 4 ) Hit on M(1) Update A(1)=7 as A was recognized Update S(1)=7 as S was recognized

Implementation

See also

• CYK algorithm
• Context-free grammar
• Parsing algorithms
• Earley parser

References

1. ^ Ford, Bryan (2006). "Packrat Parsing: Simple, Powerful, Lazy, Linear Time". arXiv:cs/0603077.
2. ^ Ford, Bryan (2004-01-01). "Parsing expression grammars". Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL '04. New York, NY, USA: Association for Computing Machinery. pp. 111–122. doi:10.1145/964001.964011. ISBN 978-1-58113-729-3. S2CID 7762102.
3. ^ Flodin, Daniel. "A Comparison Between Packrat Parsing and Conventional Shift-Reduce Parsing on Real-World Grammars and Inputs" (PDF).
4. Mizushima, Kota; Maeda, Atusi; Yamaguchi, Yoshinori (2010-05-06). "Packrat parsers can handle practical grammars in mostly constant space". Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering. ACM. pp. 29–36. doi:10.1145/1806672.1806679. ISBN 978-1-4503-0082-7. S2CID 14498865.
5. ^ Warth, Alessandro; Douglass, James R.; Millstein, Todd (2008-01-07). "Packrat parsers can support left recursion". Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation. PEPM '08. New York, NY, USA: Association for Computing Machinery. pp. 103–110. doi:10.1145/1328408.1328424. ISBN 978-1-59593-977-7. S2CID 2168153.
6. Aho, Alfred V.; Lam, Monica S.; Sethi, Ravi; Ullman, Jeffrey D., eds. (2007). Compilers: principles, techniques, & tools (2nd ed.). Boston Munich: Pearson Addison-Wesley. ISBN 978-0-321-48681-3.
7. Norvig, Peter (1991-03-01). "Techniques for automatic memoization with applications to context-free parsing". Computational Linguistics. 17 (1): 91–98. ISSN 0891-2017.
8. Dubroy, Patrick; Warth, Alessandro (2017-10-23). "Incremental packrat parsing". Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering. SLE 2017. New York, NY, USA: Association for Computing Machinery. pp. 14–25. doi:10.1145/3136014.3136022. ISBN 978-1-4503-5525-4. S2CID 13047585.
9. ^ Science, International Journal of Scientific Research in; Ijsrset, Engineering and Technology. "A Survey of Packrat Parser". A Survey of Packrat Parser.
10. ^ Mizushima, Kota; Maeda, Atusi; Yamaguchi, Yoshinori (2010-05-06). "Packrat parsers can handle practical grammars in mostly constant space". Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering. PASTE '10. New York, NY, USA: Association for Computing Machinery. pp. 29–36. doi:10.1145/1806672.1806679. ISBN 978-1-4503-0082-7. S2CID 14498865.
11. Maintained fork of PEG.js

External links

• Packrat Parsing: Simple, Powerful, Lazy, Linear Time
• Parsing Expression Grammars: A Recognition-Based Syntactic Foundation

• Parsing algorithms
• Dynamic programming