diff --git a/info/exercises/ex-03-sol.pdf b/info/exercises/ex-03-sol.pdf
index d972dca858282338b1897bd9549582f6eca3912d..3f52f8eb366c433d8e1afaa688ea8f0c236ccec6 100644
Binary files a/info/exercises/ex-03-sol.pdf and b/info/exercises/ex-03-sol.pdf differ
diff --git a/info/exercises/ex-03.pdf b/info/exercises/ex-03.pdf
index b125cb945553a7167008a51eba097537468a7d2e..0c143f82a064741eee3584cc85a50c6b7f24af7b 100644
Binary files a/info/exercises/ex-03.pdf and b/info/exercises/ex-03.pdf differ
diff --git a/info/exercises/src/ex-03/ex/table.tex b/info/exercises/src/ex-03/ex/table.tex
index 8f84e38f533e450accc409e77033dec2e84167ec..3c7e4848dd1933666351ca8b8257f6d3e6ff4f43 100644
--- a/info/exercises/src/ex-03/ex/table.tex
+++ b/info/exercises/src/ex-03/ex/table.tex
@@ -86,7 +86,7 @@
     left-recursive). We can remove the left recursion by introducing a new
     non-terminal, \(A'\), such that:
     \begin{align*}
-      A &::= A' \mid \beta A' \\
+      A &::= \beta A' \\
       A' &::= \alpha A' \mid \epsilon
     \end{align*}
     i.e., for the left-recursive rule \(A\alpha\), we instead attempt to parse