aboutsummaryrefslogtreecommitdiff
path: root/doc
diff options
context:
space:
mode:
Diffstat (limited to 'doc')
-rw-r--r--doc/refman/RefMan-syn.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/refman/RefMan-syn.tex b/doc/refman/RefMan-syn.tex
index dcac68f1a1..9f607f05e4 100644
--- a/doc/refman/RefMan-syn.tex
+++ b/doc/refman/RefMan-syn.tex
@@ -73,7 +73,7 @@ Consider for example the new notation
Notation "A \/ B" := (or A B).
\end{coq_example*}
-Clearly, an expression such as {\tt (A:Prop)True \verb=/\= A \verb=\/=
+Clearly, an expression such as {\tt forall A:Prop, True \verb=/\= A \verb=\/=
A \verb=\/= False} is ambiguous. To tell the {\Coq} parser how to
interpret the expression, a priority between the symbols \verb=/\= and
\verb=\/= has to be given. Assume for instance that we want conjunction
@@ -179,7 +179,7 @@ See the next section for more about factorization.
\subsection{Simple factorization rules}
-{\Coq} extensible parsing is performed by Camlp4 which is essentially a
+{\Coq} extensible parsing is performed by Camlp5 which is essentially a
LL1 parser. Hence, some care has to be taken not to hide already
existing rules by new rules. Some simple left factorization work has
to be done. Here is an example.