src/scan-code.l

   1 /* Bison Action Scanner                             -*- C -*-
   2
   3    Copyright (C) 2006, 2007, 2008, 2009 Free Software Foundation, Inc.
   4
   5    This file is part of Bison, the GNU Compiler Compiler.
   6
   7    This program is free software: you can redistribute it and/or modify
   8    it under the terms of the GNU General Public License as published by
   9    the Free Software Foundation, either version 3 of the License, or
  10    (at your option) any later version.
  11
  12    This program is distributed in the hope that it will be useful,
  13    but WITHOUT ANY WARRANTY; without even the implied warranty of
  14    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15    GNU General Public License for more details.
  16
  17    You should have received a copy of the GNU General Public License
  18    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
  19
  20 %option debug nodefault nounput noyywrap never-interactive
  21 %option prefix="code_" outfile="lex.yy.c"
  22
  23 %{
  24 /* Work around a bug in flex 2.5.31.  See Debian bug 333231
  25    <http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=333231>.  */
  26 #undef code_wrap
  27 #define code_wrap() 1
  28
  29 #define FLEX_PREFIX(Id) code_ ## Id
  30 #include <src/flex-scanner.h>
  31
  32 #include <src/complain.h>
  33 #include <src/reader.h>
  34 #include <src/getargs.h>
  35 #include <src/muscle-tab.h>
  36 #include <src/scan-code.h>
  37 #include <src/symlist.h>
  38
  39 #include <c-ctype.h>
  40 #include <get-errno.h>
  41 #include <quote.h>
  42
  43 /* The current calling start condition: SC_RULE_ACTION or
  44    SC_SYMBOL_ACTION. */
  45 # define YY_DECL static char *code_lex (code_props *self, int sc_context)
  46 YY_DECL;
  47
  48 #define YY_USER_ACTION  location_compute (loc, &loc->end, yytext, yyleng);
  49
  50 static void handle_action_dollar (symbol_list *rule, char *cp,
  51                                   location dollar_loc);
  52 static void handle_action_at (symbol_list *rule, char *cp, location at_loc);
  53
  54 /* A string to be pushed to obstack after dollar/at has been handled. */
  55 static char *ref_tail_fields;
  56
  57 static location the_location;
  58 static location *loc = &the_location;
  59
  60 /* A string representing the most recent translation.  */
  61 static char *last_string;
  62
  63 /* True if an untyped $$ or $n was seen.  */
  64 static bool untyped_var_seen;
  65
  66 %}
  67  /* C and C++ comments in code. */
  68 %x SC_COMMENT SC_LINE_COMMENT
  69  /* Strings and characters in code. */
  70 %x SC_STRING SC_CHARACTER
  71  /* Whether in a rule or symbol action.  Specifies the translation
  72     of $ and @.  */
  73 %x SC_RULE_ACTION SC_SYMBOL_ACTION
  74
  75
  76 /* POSIX says that a tag must be both an id and a C union member, but
  77    historically almost any character is allowed in a tag.  We disallow
  78    NUL and newline, as this simplifies our implementation.  */
  79 tag      [^\0\n>]+
  80
  81 /* Zero or more instances of backslash-newline.  Following GCC, allow
  82    white space between the backslash and the newline.  */
  83 splice   (\\[ \f\t\v]*\n)*
  84
  85 /* C style identifier. Must start with letter. Will be used for
  86    named symbol references. Shall be kept synchronized with
  87    scan-gram.l "letter" and "id". */
  88 letter    [-.abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_]
  89 id        {letter}({letter}|[0-9])*
  90 ref      -?[0-9]+|{id}|"["{id}"]"|"$"
  91
  92 %%
  93
  94 %{
  95   /* Nesting level of the current code in braces.  */
  96   int braces_level = 0;
  97
  98   /* Whether a semicolon is probably needed.
  99      The heuristic is that a semicolon is not needed after `{', `}', `;',
 100      or a C preprocessor directive, and that whitespaces and comments
 101      do not affect this flag.
 102      Note that `{' does not need a semicolon because of `{}'.
 103      A semicolon may be needed before a cpp direcive, but don't bother.  */
 104   bool need_semicolon = false;
 105
 106   /* Whether in a C preprocessor directive.  Don't use a start condition
 107      for this because, at the end of strings and comments, we still need
 108      to know whether we're in a directive.  */
 109   bool in_cpp = false;
 110
 111   /* This scanner is special: it is invoked only once, henceforth
 112      is expected to return only once.  This initialization is
 113      therefore done once per action to translate. */
 114   aver (sc_context == SC_SYMBOL_ACTION
 115         || sc_context == SC_RULE_ACTION
 116         || sc_context == INITIAL);
 117   BEGIN sc_context;
 118 %}
 119
 120   /*------------------------------------------------------------.
 121   | Scanning a C comment.  The initial `/ *' is already eaten.  |
 122   `------------------------------------------------------------*/
 123
 124 <SC_COMMENT>
 125 {
 126   "*"{splice}"/"  STRING_GROW; BEGIN sc_context;
 127 }
 128
 129
 130   /*--------------------------------------------------------------.
 131   | Scanning a line comment.  The initial `//' is already eaten.  |
 132   `--------------------------------------------------------------*/
 133
 134 <SC_LINE_COMMENT>
 135 {
 136   "\n"           STRING_GROW; BEGIN sc_context;
 137   {splice}       STRING_GROW;
 138 }
 139
 140
 141   /*--------------------------------------------.
 142   | Scanning user-code characters and strings.  |
 143   `--------------------------------------------*/
 144
 145 <SC_CHARACTER,SC_STRING>
 146 {
 147   {splice}|\\{splice}.  STRING_GROW;
 148 }
 149
 150 <SC_CHARACTER>
 151 {
 152   "'"           STRING_GROW; BEGIN sc_context;
 153 }
 154
 155 <SC_STRING>
 156 {
 157   "\""          STRING_GROW; BEGIN sc_context;
 158 }
 159
 160
 161 <SC_RULE_ACTION,SC_SYMBOL_ACTION>{
 162   "'" {
 163     STRING_GROW;
 164     BEGIN SC_CHARACTER;
 165     need_semicolon = true;
 166   }
 167   "\"" {
 168     STRING_GROW;
 169     BEGIN SC_STRING;
 170     need_semicolon = true;
 171   }
 172   "/"{splice}"*" {
 173     STRING_GROW;
 174     BEGIN SC_COMMENT;
 175   }
 176   "/"{splice}"/" {
 177     STRING_GROW;
 178     BEGIN SC_LINE_COMMENT;
 179   }
 180 }
 181
 182 <SC_RULE_ACTION>
 183 {
 184   "$"("<"{tag}">")?{ref}  {
 185     ref_tail_fields = 0;
 186     handle_action_dollar (self->rule, yytext, *loc);
 187     if (ref_tail_fields) {
 188       obstack_sgrow (&obstack_for_string, ref_tail_fields);
 189     }
 190     need_semicolon = true;
 191   }
 192   "@"{ref} {
 193     ref_tail_fields = 0;
 194     handle_action_at (self->rule, yytext, *loc);
 195     if (ref_tail_fields) {
 196       obstack_sgrow (&obstack_for_string, ref_tail_fields);
 197     }
 198     need_semicolon = true;
 199   }
 200   "$"  {
 201     warn_at (*loc, _("stray `$'"));
 202     obstack_sgrow (&obstack_for_string, "$][");
 203     need_semicolon = true;
 204   }
 205   "@"  {
 206     warn_at (*loc, _("stray `@'"));
 207     obstack_sgrow (&obstack_for_string, "@@");
 208     need_semicolon = true;
 209   }
 210   "["  {
 211     obstack_sgrow (&obstack_for_string, "@{");
 212     need_semicolon = true;
 213   }
 214   "]"  {
 215     obstack_sgrow (&obstack_for_string, "@}");
 216     need_semicolon = true;
 217   }
 218
 219   ";"  STRING_GROW;                 need_semicolon = false;
 220   "{"  STRING_GROW; ++braces_level; need_semicolon = false;
 221   "}"  {
 222     bool outer_brace = --braces_level == 0;
 223
 224     /* As an undocumented Bison extension, append `;' before the last
 225        brace in braced code, so that the user code can omit trailing
 226        `;'.  But do not append `;' if emulating Yacc, since Yacc does
 227        not append one.  */
 228     if (outer_brace && !yacc_flag && language_prio == default_prio
 229         && skeleton_prio == default_prio && need_semicolon && ! in_cpp)
 230       {
 231         warn_at (*loc, _("a `;' might be needed at the end of action code"));
 232         warn_at (*loc, _("future versions of Bison will not add the `;'"));
 233         obstack_1grow (&obstack_for_string, ';');
 234       }
 235
 236     STRING_GROW;
 237     need_semicolon = false;
 238   }
 239
 240   /* Preprocessing directives should only be recognized at the beginning
 241      of lines, allowing whitespace including comments, but in C/C++,
 242      `#' can only be the start of preprocessor directives or within
 243      `#define' directives anyway, so don't bother with begin of line.  */
 244   "#"       STRING_GROW; in_cpp = true;
 245
 246   {splice}  STRING_GROW;
 247   [\n\r]    STRING_GROW; if (in_cpp) in_cpp = need_semicolon = false;
 248   [ \t\f]   STRING_GROW;
 249   .         STRING_GROW; need_semicolon = true;
 250 }
 251
 252 <SC_SYMBOL_ACTION>
 253 {
 254   "$$" {
 255     obstack_sgrow (&obstack_for_string, "]b4_dollar_dollar[");
 256     self->is_value_used = true;
 257   }
 258   "@$" {
 259     obstack_sgrow (&obstack_for_string, "]b4_at_dollar[");
 260     muscle_percent_define_ensure("locations", the_location, true);
 261   }
 262 }
 263
 264
 265   /*-----------------------------------------.
 266   | Escape M4 quoting characters in C code.  |
 267   `-----------------------------------------*/
 268
 269 <*>
 270 {
 271   \$    obstack_sgrow (&obstack_for_string, "$][");
 272   \@    obstack_sgrow (&obstack_for_string, "@@");
 273   \[    obstack_sgrow (&obstack_for_string, "@{");
 274   \]    obstack_sgrow (&obstack_for_string, "@}");
 275 }
 276
 277   /*-----------------------------------------------------.
 278   | By default, grow the string obstack with the input.  |
 279   `-----------------------------------------------------*/
 280
 281 <*>.|\n STRING_GROW;
 282
 283  /* End of processing. */
 284 <*><<EOF>>       {
 285                    STRING_FINISH;
 286                    return last_string;
 287                  }
 288
 289 %%
 290
 291 static inline bool
 292 is_dot_or_dash (char ch)
 293 {
 294   return ch == '.' || ch == '-';
 295 }
 296
 297 static inline bool
 298 contains_dot_or_dash (const char* p)
 299 {
 300   for (; *p; ++p)
 301     if (is_dot_or_dash (*p))
 302       return true;
 303   return false;
 304 }
 305
 306 /* Defines a variant of a symbolic name resolution. */
 307 typedef struct
 308 {
 309   /* Index in symbol list. */
 310   unsigned index;
 311
 312   /* Matched symbol id and loc. */
 313   uniqstr id;
 314   location loc;
 315
 316   /* Hiding named reference. */
 317   named_ref* hidden_by;
 318
 319   /* Error flags. May contain zero (no errors) or
 320      a combination of VARIANT_* values. */
 321   unsigned err;
 322 } variant;
 323
 324 /* Set when the variant refers to a symbol hidden
 325    by an explicit symbol reference. */
 326 #define VARIANT_HIDDEN (1 << 0)
 327
 328 /* Set when the variant refers to a symbol containing
 329    dots or dashes. Will require explicit bracketing. */
 330 #define VARIANT_BAD_BRACKETING (1 << 1)
 331
 332 /* Set when the variant refers to a symbol which is
 333    not visible from current midrule. */
 334 #define VARIANT_NOT_VISIBLE_FROM_MIDRULE (1 << 2)
 335
 336 static variant *variant_table = 0;
 337 static unsigned variant_table_size = 0;
 338 static unsigned variant_count = 0;
 339
 340 static variant *
 341 variant_table_grow ()
 342 {
 343   ++variant_count;
 344   if (variant_count > variant_table_size)
 345     {
 346       while (variant_count > variant_table_size)
 347         variant_table_size = 2 * variant_table_size + 3;
 348       variant_table = xnrealloc (variant_table, variant_table_size,
 349                                  sizeof *variant_table);
 350     }
 351   return &variant_table[variant_count - 1];
 352 }
 353
 354 static char *
 355 find_prefix_end (const char *prefix, char *begin, char *end)
 356 {
 357   char *ptr = begin;
 358
 359   for (; *prefix && ptr != end; ++prefix, ++ptr)
 360     if (*prefix != *ptr)
 361       return 0;
 362
 363   if (*prefix)
 364     return 0;
 365
 366   return ptr;
 367 }
 368
 369 static variant *
 370 variant_add (uniqstr id, location loc, unsigned index,
 371              char *cp, char *cp_end, bool exact_mode)
 372 {
 373   char *prefix_end;
 374
 375   prefix_end = find_prefix_end (id, cp, cp_end);
 376   if (prefix_end &&
 377       (prefix_end == cp_end ||
 378        (!exact_mode && is_dot_or_dash (*prefix_end))))
 379     {
 380       variant *r = variant_table_grow ();
 381       r->index = index;
 382       r->id = id;
 383       r->loc = loc;
 384       r->hidden_by = NULL;
 385       r->err = 0;
 386       return r;
 387     }
 388   else
 389     return NULL;
 390 }
 391
 392 static const char *
 393 get_at_spec(unsigned index)
 394 {
 395   static char at_buf[20];
 396   if (index == 0)
 397     strcpy (at_buf, "$$");
 398   else
 399     snprintf (at_buf, sizeof at_buf, "$%u", index);
 400   return at_buf;
 401 }
 402
 403 /* Returned from "parse_ref" when the reference
 404    is inappropriate. */
 405 #define INVALID_REF (INT_MIN)
 406
 407 /* Returned from "parse_ref" when the reference
 408    points to LHS ($$) of the current rule. */
 409 #define LHS_REF (INT_MIN + 1)
 410
 411 /* Parse named or positional reference. In case of positional
 412    references, can return negative values for $-n "deep" stack
 413    accesses. */
 414 static long int
 415 parse_ref (char *cp, symbol_list *rule, int rule_length,
 416            int midrule_rhs_index, char *text, location loc,
 417            char dollar_or_at)
 418 {
 419   symbol_list *l;
 420   char *cp_end;
 421   bool exact_mode;
 422   bool has_error;
 423   bool has_valid;
 424   unsigned i;
 425
 426   if ('$' == *cp)
 427     return LHS_REF;
 428
 429   if (c_isdigit (*cp) || (*cp == '-' && c_isdigit (* (cp + 1))))
 430     {
 431       long int num = strtol (cp, &cp, 10);
 432       if (1 - INT_MAX + rule_length <= num && num <= rule_length)
 433         return num;
 434       else
 435         {
 436           complain_at (loc, _("integer out of range: %s"), quote (text));
 437           return INVALID_REF;
 438         }
 439     }
 440
 441   if ('[' == *cp)
 442     {
 443       /* Ignore the brackets. */
 444       char *p;
 445       for (p = ++cp; *p != ']'; ++p)
 446         continue;
 447       cp_end = p;
 448
 449       exact_mode = true;
 450     }
 451   else
 452     {
 453       /* Take all characters of the name. */
 454       char* p;
 455       for (p = cp; *p; ++p)
 456         if (is_dot_or_dash (*p))
 457           {
 458             ref_tail_fields = p;
 459             break;
 460           }
 461       for (p = cp; *p; ++p)
 462         continue;
 463       cp_end = p;
 464
 465       exact_mode = false;
 466     }
 467
 468   /* Add all relevant variants. */
 469   {
 470     unsigned index;
 471     variant_count = 0;
 472     for (index = 0, l = rule; !symbol_list_null (l); ++index, l = l->next)
 473       {
 474         variant *variant;
 475         if (l->content_type != SYMLIST_SYMBOL)
 476           continue;
 477
 478         variant = variant_add (l->content.sym->tag, l->sym_loc, index,
 479                                cp, cp_end, exact_mode);
 480
 481         if (variant && l->named_ref)
 482           variant->hidden_by = l->named_ref;
 483
 484         if (l->named_ref)
 485           variant_add (l->named_ref->id, l->named_ref->loc, index,
 486                        cp, cp_end, exact_mode);
 487       }
 488   }
 489
 490   /* Check errors. */
 491   has_error = false;
 492   has_valid = false;
 493   for (i = 0; i < variant_count; ++i)
 494     {
 495       variant *variant = &variant_table[i];
 496       unsigned index = variant->index;
 497
 498       /* Check visibility from mid-rule actions. */
 499       if (midrule_rhs_index != 0
 500           && (index == 0 || midrule_rhs_index < index))
 501         {
 502           variant->err |= VARIANT_NOT_VISIBLE_FROM_MIDRULE;
 503           has_error = true;
 504         }
 505
 506       /* Check correct bracketing. */
 507       if (!exact_mode && contains_dot_or_dash (variant->id))
 508         {
 509           variant->err |= VARIANT_BAD_BRACKETING;
 510           has_error = true;
 511         }
 512
 513       /* Check using of hidden symbols. */
 514       if (variant->hidden_by)
 515         {
 516           variant->err |= VARIANT_HIDDEN;
 517           has_error = true;
 518         }
 519
 520       if (!variant->err)
 521         has_valid = true;
 522     }
 523
 524   if (variant_count == 1 && has_valid)
 525     {
 526       /* The only "good" case is here. */
 527       unsigned index = variant_table[0].index;
 528       if (index == midrule_rhs_index)
 529         return LHS_REF;
 530       else
 531         return index;
 532     }
 533
 534   /* Start complaining. */
 535
 536   if (variant_count == 0)
 537     complain_at (loc, _("invalid reference: %s, symbol not found"),
 538                  quote (text));
 539   else if (variant_count > 1 && !has_error)
 540     complain_at (loc, _("ambiguous reference: %s"),
 541                  quote (text));
 542   else if (variant_count > 1 && has_valid && has_error)
 543     complain_at (loc, _("misleading reference: %s"),
 544                  quote (text));
 545   else
 546     complain_at (loc, _("invalid reference: %s"),
 547                  quote (text));
 548
 549   for (i = 0; i < variant_count; ++i)
 550     {
 551       const variant *variant = &variant_table[i];
 552       const char *at_spec = get_at_spec (variant->index);
 553
 554       if (variant->err == 0)
 555         complain_at (variant->loc, _("  refers to: %c%s at %s"),
 556                      dollar_or_at, variant->id, at_spec);
 557       else
 558         {
 559           static struct obstack msg_buf;
 560           const char *tail = exact_mode ? "" :
 561             cp + strlen (variant->id);
 562           const char *id = variant->hidden_by ? variant->hidden_by->id :
 563             variant->id;
 564           location loc = variant->hidden_by ? variant->hidden_by->loc :
 565             variant->loc;
 566
 567           /* Create the explanation message. */
 568           obstack_init (&msg_buf);
 569
 570           obstack_fgrow1 (&msg_buf, "  possibly meant: %c", dollar_or_at);
 571           if (contains_dot_or_dash (id))
 572             obstack_fgrow1 (&msg_buf, "[%s]", id);
 573           else
 574             obstack_sgrow (&msg_buf, id);
 575           obstack_sgrow (&msg_buf, tail);
 576
 577           if (variant->err & VARIANT_HIDDEN)
 578             {
 579               obstack_fgrow1 (&msg_buf, ", hiding %c", dollar_or_at);
 580               if (contains_dot_or_dash (variant->id))
 581                 obstack_fgrow1 (&msg_buf, "[%s]", variant->id);
 582               else
 583                 obstack_sgrow (&msg_buf, variant->id);
 584               obstack_sgrow (&msg_buf, tail);
 585             }
 586
 587           obstack_fgrow1 (&msg_buf, " at %s", at_spec);
 588
 589           if (variant->err & VARIANT_NOT_VISIBLE_FROM_MIDRULE)
 590             obstack_fgrow1 (&msg_buf, ", cannot be accessed from "
 591                             "mid-rule action at $%d", midrule_rhs_index);
 592
 593           obstack_1grow (&msg_buf, '\0');
 594           complain_at (loc, _("%s"), (char *) obstack_finish (&msg_buf));
 595           obstack_free (&msg_buf, 0);
 596         }
 597     }
 598
 599   return INVALID_REF;
 600 }
 601
 602 /* Keeps track of the maximum number of semantic values to the left of
 603    a handle (those referenced by $0, $-1, etc.) are required by the
 604    semantic actions of this grammar. */
 605 int max_left_semantic_context = 0;
 606
 607
 608 /*------------------------------------------------------------------.
 609 | TEXT is pointing to a wannabee semantic value (i.e., a `$').      |
 610 |                                                                   |
 611 | Possible inputs: $[<TYPENAME>]($|integer)                         |
 612 |                                                                   |
 613 | Output to OBSTACK_FOR_STRING a reference to this semantic value.  |
 614 `------------------------------------------------------------------*/
 615
 616 static void
 617 handle_action_dollar (symbol_list *rule, char *text, location dollar_loc)
 618 {
 619   char const *type_name = NULL;
 620   char *cp = text + 1;
 621   char *gt_ptr = 0;
 622   symbol_list *effective_rule;
 623   int effective_rule_length;
 624   int n;
 625
 626   if (rule->midrule_parent_rule)
 627     {
 628       effective_rule = rule->midrule_parent_rule;
 629       effective_rule_length = rule->midrule_parent_rhs_index - 1;
 630     }
 631   else
 632     {
 633       effective_rule = rule;
 634       effective_rule_length = symbol_list_length (rule->next);
 635     }
 636
 637   /* Get the type name if explicit. */
 638   if (*cp == '<')
 639     {
 640       type_name = ++cp;
 641       while (*cp != '>')
 642         ++cp;
 643
 644       /* The '>' symbol will be later replaced by '\0'. Original
 645          'text' is needed for error messages. */
 646       gt_ptr = cp;
 647       ++cp;
 648       if (untyped_var_seen)
 649         complain_at (dollar_loc, _("explicit type given in untyped grammar"));
 650       tag_seen = true;
 651     }
 652
 653   n = parse_ref (cp, effective_rule, effective_rule_length,
 654                  rule->midrule_parent_rhs_index, text, dollar_loc, '$');
 655
 656   if (gt_ptr)
 657     *gt_ptr = '\0';
 658
 659   switch (n)
 660     {
 661     case INVALID_REF:
 662       break;
 663
 664     case LHS_REF:
 665       if (!type_name)
 666         type_name = symbol_list_n_type_name_get (rule, dollar_loc, 0);
 667
 668       if (!type_name)
 669         {
 670           if (union_seen | tag_seen)
 671             {
 672               if (rule->midrule_parent_rule)
 673                 complain_at (dollar_loc,
 674                              _("$$ for the midrule at $%d of `%s'"
 675                                " has no declared type"),
 676                              rule->midrule_parent_rhs_index,
 677                              effective_rule->content.sym->tag);
 678               else
 679                 complain_at (dollar_loc, _("$$ of `%s' has no declared type"),
 680                              rule->content.sym->tag);
 681             }
 682           else
 683             untyped_var_seen = true;
 684           type_name = "";
 685         }
 686
 687       obstack_fgrow1 (&obstack_for_string,
 688                       "]b4_lhs_value([%s])[", type_name);
 689       rule->action_props.is_value_used = true;
 690       break;
 691
 692     default:
 693       if (max_left_semantic_context < 1 - n)
 694         max_left_semantic_context = 1 - n;
 695       if (!type_name && 0 < n)
 696         type_name =
 697           symbol_list_n_type_name_get (effective_rule, dollar_loc, n);
 698       if (!type_name)
 699         {
 700           if (union_seen | tag_seen)
 701             complain_at (dollar_loc, _("$%s of `%s' has no declared type"),
 702                          cp, effective_rule->content.sym->tag);
 703           else
 704             untyped_var_seen = true;
 705           type_name = "";
 706         }
 707
 708       obstack_fgrow3 (&obstack_for_string,
 709                       "]b4_rhs_value(%d, %d, [%s])[",
 710                       effective_rule_length, n, type_name);
 711       if (n > 0)
 712         symbol_list_n_get (effective_rule, n)->action_props.is_value_used =
 713           true;
 714       break;
 715     }
 716 }
 717
 718
 719 /*------------------------------------------------------.
 720 | TEXT is a location token (i.e., a `@...').  Output to |
 721 | OBSTACK_FOR_STRING a reference to this location.      |
 722 `------------------------------------------------------*/
 723
 724 static void
 725 handle_action_at (symbol_list *rule, char *text, location at_loc)
 726 {
 727   char *cp = text + 1;
 728   symbol_list *effective_rule;
 729   int effective_rule_length;
 730   int n;
 731
 732   if (rule->midrule_parent_rule)
 733     {
 734       effective_rule = rule->midrule_parent_rule;
 735       effective_rule_length = rule->midrule_parent_rhs_index - 1;
 736     }
 737   else
 738     {
 739       effective_rule = rule;
 740       effective_rule_length = symbol_list_length (rule->next);
 741     }
 742
 743   muscle_percent_define_ensure("locations", at_loc, true);
 744
 745   n = parse_ref (cp, effective_rule, effective_rule_length,
 746                        rule->midrule_parent_rhs_index, text, at_loc, '@');
 747   switch (n)
 748     {
 749     case INVALID_REF:
 750       break;
 751
 752     case LHS_REF:
 753       obstack_sgrow (&obstack_for_string, "]b4_lhs_location[");
 754       break;
 755
 756     default:
 757       obstack_fgrow2 (&obstack_for_string, "]b4_rhs_location(%d, %d)[",
 758                       effective_rule_length, n);
 759       break;
 760     }
 761 }
 762
 763
 764 /*-------------------------.
 765 | Initialize the scanner.  |
 766 `-------------------------*/
 767
 768 /* Translate the dollars and ats in \a self, in the context \a sc_context
 769    (SC_RULE_ACTION, SC_SYMBOL_ACTION, INITIAL).  */
 770
 771 static char const *
 772 translate_action (code_props *self, int sc_context)
 773 {
 774   char *res;
 775   static bool initialized = false;
 776   if (!initialized)
 777     {
 778       obstack_init (&obstack_for_string);
 779       yy_flex_debug = 0;
 780       initialized = true;
 781     }
 782
 783   loc->start = loc->end = self->location.start;
 784   yy_switch_to_buffer (yy_scan_string (self->code));
 785   res = code_lex (self, sc_context);
 786   yy_delete_buffer (YY_CURRENT_BUFFER);
 787
 788   return res;
 789 }
 790
 791 /*------------------------------------------------------------------------.
 792 | Implementation of the public interface as documented in "scan-code.h".  |
 793 `------------------------------------------------------------------------*/
 794
 795 void
 796 code_props_none_init (code_props *self)
 797 {
 798   *self = code_props_none;
 799 }
 800
 801 code_props const code_props_none = CODE_PROPS_NONE_INIT;
 802
 803 void
 804 code_props_plain_init (code_props *self, char const *code,
 805                        location code_loc)
 806 {
 807   self->kind = CODE_PROPS_PLAIN;
 808   self->code = code;
 809   self->location = code_loc;
 810   self->is_value_used = false;
 811   self->rule = NULL;
 812   self->named_ref = NULL;
 813 }
 814
 815 void
 816 code_props_symbol_action_init (code_props *self, char const *code,
 817                                location code_loc)
 818 {
 819   self->kind = CODE_PROPS_SYMBOL_ACTION;
 820   self->code = code;
 821   self->location = code_loc;
 822   self->is_value_used = false;
 823   self->rule = NULL;
 824   self->named_ref = NULL;
 825 }
 826
 827 void
 828 code_props_rule_action_init (code_props *self, char const *code,
 829                              location code_loc, symbol_list *rule,
 830                              named_ref *named_ref)
 831 {
 832   self->kind = CODE_PROPS_RULE_ACTION;
 833   self->code = code;
 834   self->location = code_loc;
 835   self->is_value_used = false;
 836   self->rule = rule;
 837   self->named_ref = named_ref;
 838 }
 839
 840 void
 841 code_props_translate_code (code_props *self)
 842 {
 843   switch (self->kind)
 844     {
 845       case CODE_PROPS_NONE:
 846         break;
 847       case CODE_PROPS_PLAIN:
 848         self->code = translate_action (self, INITIAL);
 849         break;
 850       case CODE_PROPS_SYMBOL_ACTION:
 851         self->code = translate_action (self, SC_SYMBOL_ACTION);
 852         break;
 853       case CODE_PROPS_RULE_ACTION:
 854         self->code = translate_action (self, SC_RULE_ACTION);
 855         break;
 856     }
 857 }
 858
 859 void
 860 code_scanner_last_string_free (void)
 861 {
 862   STRING_FREE;
 863 }
 864
 865 void
 866 code_scanner_free (void)
 867 {
 868   obstack_free (&obstack_for_string, 0);
 869   /* Reclaim Flex's buffers.  */
 870   yylex_destroy ();
 871 }