From 1e80c5d54eaabd2e0f442cc0d875656715c52f42 Mon Sep 17 00:00:00 2001
From: Ulya Trofimovich <skvadrik@gmail.com>
Date: Fri, 11 Jan 2019 08:16:00 +0000
Subject: [PATCH] Paper: don't forget to pass precedence matrices to initial
 closure.

---
 re2c/doc/tdfa_v2/part_1_tnfa.tex | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/re2c/doc/tdfa_v2/part_1_tnfa.tex b/re2c/doc/tdfa_v2/part_1_tnfa.tex
index c6488d10..a239b02b 100644
--- a/re2c/doc/tdfa_v2/part_1_tnfa.tex
+++ b/re2c/doc/tdfa_v2/part_1_tnfa.tex
@@ -923,7 +923,10 @@ TNFA construction is given by the $F$ function defined on figure \ref{fig_tnfa}.
     \begin{algorithm}[H] \DontPrintSemicolon \SetKwProg{Fn}{}{}{} \SetAlgoInsideSkip{medskip}
     \Fn {$\underline{match (\XN, \alpha_1 \dots \alpha_n)} \smallskip$} {
         $(\Sigma, Q, F, q_0, T, \Delta) = \XN$ \;
-        $X = closure(\{ (\bot, q_0, \epsilon, t_0) \}, F, \Delta)$ \;
+        $P_1, P_2: Q \times Q \rightarrow \YZ$ \;
+        \BlankLine
+
+        $X = closure(\{ (\bot, q_0, \epsilon, t_0) \}, F, \Delta, P_1, P_2)$ \;
         $(X, B, D) = step(0, X, P_1, P_2)$ \;
 
         \BlankLine
-- 
2.40.0