tests: fix invalid C++11 code

[bison.git] / tests / sets.at

diff --git a/tests/sets.at b/tests/sets.at
index e20874b6586f06e459318311012148095ff56c4f..fadbe6871210bdb0002e56a7838d273592230d17 100644 (file)
--- a/tests/sets.at
+++ b/tests/sets.at
@@ -1,6 +1,6 @@
 # Exercising Bison Grammar Sets.                      -*- Autotest -*-
 
-# Copyright (C) 2001-2002, 2005, 2007, 2009-2011 Free Software
+# Copyright (C) 2001-2002, 2005, 2007, 2009-2013 Free Software
 # Foundation, Inc.
 
 # This program is free software: you can redistribute it and/or modify
@@ -29,25 +29,25 @@ m4_define([AT_EXTRACT_SETS],
    :null
    p
    n
-   /^[  ]*$/ !b null
+   /^ *$/ !b null
 }
 /^FIRSTS$/ {
    :firsts
    p
    n
-   /^[  ]*$/ !b firsts
+   /^ *$/ !b firsts
 }
 /^FDERIVES$/ {
    :fderiv
    p
    n
-   /^[  ]*$/ !b fderiv
+   /^ *$/ !b fderiv
 }
 /^DERIVES$/ {
    :deriv
    p
    n
-   /^[  ]*$/ !b deriv
+   /^ *$/ !b deriv
 }
 ]])
 AT_CHECK([sed -f extract.sed $1], 0, [stdout])
@@ -82,28 +82,28 @@ AT_BISON_CHECK([[--trace=sets input.y]], [], [], [stderr])
 AT_EXTRACT_SETS([stderr], [sets])
 AT_CHECK([[cat sets]], [],
 [[DERIVES
-       $accept derives
-                 0  e $end
-       e derives
-                 1  'e'
-                 2  /* empty */
+  $accept derives
+      0  e $end
+  e derives
+      1  'e'
+      2  %empty
 NULLABLE
-       $accept: no
-       e: yes
+  $accept: no
+  e: yes
 FIRSTS
-       $accept firsts
-               $accept
-               e
-       e firsts
-               e
+  $accept firsts
+    $accept
+    e
+  e firsts
+    e
 FDERIVES
-       $accept derives
-                 0  e $end
-                 1  'e'
-                 2  /* empty */
-       e derives
-                 1  'e'
-                 2  /* empty */
+  $accept derives
+      0  e $end
+      1  'e'
+      2  %empty
+  e derives
+      1  'e'
+      2  %empty
 ]])
 
 AT_CLEANUP
@@ -113,7 +113,7 @@ AT_CLEANUP
 ## Broken Closure.  ##
 ## ---------------- ##
 
-# TC was once broken during a massive `simplification' of the code.
+# TC was once broken during a massive 'simplification' of the code.
 # It resulted in bison dumping core on the following grammar (the
 # computation of FIRSTS uses TC).  It managed to produce a pretty
 # exotic closure:
@@ -164,7 +164,7 @@ h: 'h';
 
 AT_BISON_CHECK([[--trace=sets input.y]], [], [], [stderr])
 
-AT_CHECK([[sed -n 's/[  ]*$//;/^RTC: Firsts Output BEGIN/,/^RTC: Firsts Output END/p' stderr]], [],
+AT_CHECK([[sed -n 's/[   ]*$//;/^RTC: Firsts Output BEGIN/,/^RTC: Firsts Output END/p' stderr]], [],
 [[RTC: Firsts Output BEGIN
 
    012345678
@@ -212,43 +212,43 @@ AT_BISON_CHECK([[--trace=sets input.y]], [], [], [stderr])
 AT_EXTRACT_SETS([stderr], [sets])
 AT_CHECK([[cat sets]], [],
 [[DERIVES
-       $accept derives
-                 0  exp $end
-       exp derives
-                 1  exp '<' exp
-                 2  exp '>' exp
-                 3  exp '+' exp
-                 4  exp '-' exp
-                 5  exp '^' exp
-                 6  exp '=' exp
-                 7  "exp"
+  $accept derives
+      0  exp $end
+  exp derives
+      1  exp '<' exp
+      2  exp '>' exp
+      3  exp '+' exp
+      4  exp '-' exp
+      5  exp '^' exp
+      6  exp '=' exp
+      7  "exp"
 NULLABLE
-       $accept: no
-       exp: no
+  $accept: no
+  exp: no
 FIRSTS
-       $accept firsts
-               $accept
-               exp
-       exp firsts
-               exp
+  $accept firsts
+    $accept
+    exp
+  exp firsts
+    exp
 FDERIVES
-       $accept derives
-                 0  exp $end
-                 1  exp '<' exp
-                 2  exp '>' exp
-                 3  exp '+' exp
-                 4  exp '-' exp
-                 5  exp '^' exp
-                 6  exp '=' exp
-                 7  "exp"
-       exp derives
-                 1  exp '<' exp
-                 2  exp '>' exp
-                 3  exp '+' exp
-                 4  exp '-' exp
-                 5  exp '^' exp
-                 6  exp '=' exp
-                 7  "exp"
+  $accept derives
+      0  exp $end
+      1  exp '<' exp
+      2  exp '>' exp
+      3  exp '+' exp
+      4  exp '-' exp
+      5  exp '^' exp
+      6  exp '=' exp
+      7  "exp"
+  exp derives
+      1  exp '<' exp
+      2  exp '>' exp
+      3  exp '+' exp
+      4  exp '-' exp
+      5  exp '^' exp
+      6  exp '=' exp
+      7  "exp"
 ]])
 
 AT_CLEANUP
@@ -263,7 +263,7 @@ AT_CLEANUP
 # In some weird cases Bison could compute an incorrect final state
 # number.  This happens only if the $end token is used in the user
 # grammar, which is a very suspicious accidental feature introduced as
-# a side effect of allowing the user to name $end using `%token END 0
+# a side effect of allowing the user to name $end using '%token END 0
 # "end of file"'.
 
 AT_SETUP([Accept])
@@ -287,16 +287,16 @@ mv stdout expout
 
 # Get the final state in the report, from the "accept" action..
 AT_CHECK([sed -n '
-           /^state \(.*\)/{
-            s//final state \1/
-            x
-          }
-          / accept/{
-            x
-            p
-            q
-          }
-       ' input.output],
-       0, [expout])
+           /^State \(.*\)/{
+             s//final state \1/
+             x
+           }
+           / accept/{
+             x
+             p
+             q
+           }
+        ' input.output],
+        0, [expout])
 
 AT_CLEANUP