--- a/gcc/doc/match-and-simplify.texi	Thu Oct 25 07:37:49 2018 +0900
+++ b/gcc/doc/match-and-simplify.texi	Thu Feb 13 11:34:05 2020 +0900
@@ -1,4 +1,4 @@
-@c Copyright (C) 2014-2018 Free Software Foundation, Inc.
+@c Copyright (C) 2014-2020 Free Software Foundation, Inc.
 @c Free Software Foundation, Inc.
 @c This is part of the GCC manual.
 @c For copying conditions, see the file gcc.texi.
@@ -293,8 +293,8 @@
 @end smallexample
 
 In this example the pattern will be repeated four times with
-@code{opa, opb, opc} being @code{plus, minus, plus},
-@code{plus, minus, minus}, @code{minus, plus, plus},
+@code{opa, opb, opc} being @code{plus, minus, plus};
+@code{plus, minus, minus}; @code{minus, plus, plus};
 @code{minus, plus, minus}.
 
 To avoid repeating operator lists in @code{for} you can name
@@ -380,6 +380,9 @@
 have access to two additional conditional converts as in
 @code{(eq (convert1@? @@1) (convert2@? @@2))}.
 
+The support for @code{?} marking extends to all unary operations
+including predicates you declare yourself with @code{match}.
+
 Predicates available from the GCC middle-end need to be made
 available explicitely via @code{define_predicates}: