hoaparse.yy 43.3 KB
Newer Older
1
/* -*- coding: utf-8 -*-
2
** Copyright (C) 2014, 2015 Laboratoire de Recherche et Développement
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
** de l'Epita (LRDE).
**
** This file is part of Spot, a model checking library.
**
** Spot is free software; you can redistribute it and/or modify it
** under the terms of the GNU General Public License as published by
** the Free Software Foundation; either version 3 of the License, or
** (at your option) any later version.
**
** Spot is distributed in the hope that it will be useful, but WITHOUT
** ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
** or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
** License for more details.
**
** You should have received a copy of the GNU General Public License
** along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/
%language "C++"
%locations
%defines
%expect 0 // No shift/reduce
%name-prefix "hoayy"
%debug
%error-verbose
%lex-param { spot::hoa_parse_error_list& error_list }
%define api.location.type "spot::location"

%code requires
{
#include <string>
#include <cstring>
#include <sstream>
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
35
#include <unordered_map>
36
#include <algorithm>
37
#include "ltlast/constant.hh"
38
#include "twa/formula2bdd.hh"
39
#include "public.hh"
40
41
#include "priv/accmap.hh"
#include "ltlparse/public.hh"
42

43
  inline namespace hoayy_support
44
  {
45
46
47
48
49
50
51
    /* Cache parsed formulae.  Labels on arcs are frequently identical
       and it would be a waste of time to parse them to formula* over and
       over, and to register all their atomic_propositions in the
       bdd_dict.  Keep the bdd result around so we can reuse it.  */
    typedef std::map<std::string, bdd> formula_cache;

    typedef std::pair<int, std::string*> pair;
52
    typedef typename spot::twa_graph::namer<std::string>::type named_tgba_t;
53
54
55
56
57
58
59
60

    // Note: because this parser is meant to be used on a stream of
    // automata, it tries hard to recover from errors, so that we get a
    // chance to reach the end of the current automaton in order to
    // process the next one.  Several variables below are used to keep
    // track of various error conditions.
    enum label_style_t { Mixed_Labels, State_Labels, Trans_Labels,
			 Implicit_Labels };
61
    enum acc_style_t { Mixed_Acc, State_Acc, Trans_Acc };
62
63

    struct result_
64
    {
65
66
67
68
69
70
      struct state_info
      {
	bool declared;
	bool used;
	spot::location used_loc;
      };
71
72
73
74
75
76
77
78
      spot::hoa_aut_ptr h;
      spot::ltl::environment* env;
      formula_cache fcache;
      named_tgba_t* namer = nullptr;
      spot::acc_mapper_int* acc_mapper = nullptr;
      std::vector<int> ap;
      std::vector<bdd> guards;
      std::vector<bdd>::const_iterator cur_guard;
79
      std::vector<state_info> info_states; // States declared and used.
80
81
82
83
84
85
86
87
88
89
      std::vector<std::pair<spot::location, unsigned>> start; // Initial states;
      std::unordered_map<std::string, bdd> alias;
      std::unordered_map<std::string, spot::location> props;
      spot::location states_loc;
      spot::location ap_loc;
      spot::location state_label_loc;
      spot::location accset_loc;
      spot::acc_cond::mark_t acc_state;
      spot::acc_cond::mark_t neg_acc_sets = 0U;
      spot::acc_cond::mark_t pos_acc_sets = 0U;
90
      std::vector<std::string>* state_names = nullptr;
91
      std::map<unsigned, unsigned> states_map;
92
      std::set<int> ap_set;
93
94
95
96
97
98
99
100
101
      unsigned cur_state;
      int states = -1;
      int ap_count = -1;
      int accset = -1;
      bdd state_label;
      bdd cur_label;
      bool has_state_label = false;
      bool ignore_more_ap = false; // Set to true after the first "AP:"
      // line has been read.
102
103
      bool ignore_acc = false;	// Set to true in case of missing
				// Acceptance: lines.
104
105
      bool ignore_acc_silent = false;
      bool ignore_more_acc = false; // Set to true after the first
106
				// "Acceptance:" line has been read.
107
108

      label_style_t label_style = Mixed_Labels;
109
      acc_style_t acc_style = Mixed_Acc;
110
111
112
113
114
115
116

      bool accept_all_needed = false;
      bool accept_all_seen = false;
      bool aliased_states = false;

      bool deterministic = false;
      bool complete = false;
117
      bool trans_acc_seen = false;
118
119
120
121
122
123
124
125
126
127

      std::map<std::string, spot::location> labels;

      ~result_()
      {
	delete namer;
	delete acc_mapper;
      }
    };
  }
128
129
130
131
}

%parse-param {spot::hoa_parse_error_list& error_list}
%parse-param {result_& res}
132
133
%parse-param {spot::location initial_loc}

134
%initial-action { @$ = res.h->loc = initial_loc; }
135

136
137
138
139
140
141
%union
{
  std::string* str;
  unsigned int num;
  int b;
  spot::acc_cond::mark_t mark;
142
143
  pair* p;
  std::list<pair>* list;
144
  spot::acc_cond::acc_code* code;
145
146
147
148
149
}

%code
{
#include <sstream>
150
151
152
153
#include "ltlast/constant.hh"
#include "ltlparse/public.hh"

  /* hoaparse.hh and parsedecl.hh include each other recursively.
154
155
156
   We must ensure that YYSTYPE is declared (by the above %union)
   before parsedecl.hh uses it. */
#include "parsedecl.hh"
157
158

  static void fill_guards(result_& res);
159
160
}

161
/**** HOA tokens ****/
162
163
164
165
166
167
168
169
170
171
172
173
174
%token HOA "HOA:"
%token STATES "States:"
%token START "Start:"
%token AP "AP:"
%token ALIAS "Alias:"
%token ACCEPTANCE "Acceptance:"
%token ACCNAME "acc-name:"
%token TOOL "tool:"
%token NAME "name:"
%token PROPERTIES "properties:"
%token BODY "--BODY--"
%token END "--END--"
%token STATE "State:";
175
%token <str> IDENTIFIER "identifier";  // also used by neverclaim
176
177
178
179
%token <str> HEADERNAME "header name";
%token <str> ANAME "alias name";
%token <str> STRING "string";
%token <num> INT "integer";
180
%token ENDOFFILE 0 "end of file"
181
182
183
184
185

%left '|'
%left '&'
%nonassoc '!'

186
%type <num> checked-state-num state-num acc-set
187
%type <b> label-expr
188
%type <mark> acc-sig acc-sets trans-acc_opt state-acc_opt
189
%type <str> string_opt
190

191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
/**** NEVERCLAIM tokens ****/

%token NEVER "never"
%token SKIP "skip"
%token IF "if"
%token FI "fi"
%token DO "do"
%token OD "od"
%token ARROW "->"
%token GOTO "goto"
%token FALSE "false"
%token ATOMIC "atomic"
%token ASSERT "assert"
%token <str> FORMULA "boolean formula"

%type <b> nc-formula
%type <str> nc-opt-dest nc-formula-or-ident
%type <p> nc-transition nc-src-dest
%type <list> nc-transitions nc-transition-block
%type <str> nc-one-ident nc-ident-list
211
%type <code> acceptance-cond
212

213
214
215
216
217
218
219
220
221
222
/**** LBTT tokens *****/
 // Also using INT, STRING
%token ENDAUT "-1"
%token <num> LBTT "LBTT header"
%token <num> INT_S "state acceptance"
%token <num> LBTT_EMPTY "acceptance sets for empty automaton"
%token <num> ACC "acceptance set"
%token <num> STATE_NUM "state number"
%token <num> DEST_NUM "destination number"
%type <mark> lbtt-acc
223

224
225
%destructor { delete $$; } <str>
%destructor { bdd_delref($$); } <b>
226
%destructor { bdd_delref($$->first); delete $$->second; delete $$; } <p>
227
%destructor { delete $$; } <code>
228
229
230
231
232
233
234
235
236
%destructor {
  for (std::list<pair>::iterator i = $$->begin();
       i != $$->end(); ++i)
  {
    bdd_delref(i->first);
    delete i->second;
  }
  delete $$;
  } <list>
237
238
239
240
241
242
243
244
%printer {
    if ($$)
      debug_stream() << *$$;
    else
      debug_stream() << "\"\""; } <str>
%printer { debug_stream() << $$; } <num>

%%
245
246
aut: aut-1     { res.h->loc = @$; YYACCEPT; }
   | ENDOFFILE { YYABORT; }
247
248
249
250
   | error ENDOFFILE { YYABORT; }

aut-1: hoa
     | never
251
     | lbtt
252
253
254
255
256
257


/**********************************************************************/
/*                          Rules for HOA                             */
/**********************************************************************/

258
hoa: header "--BODY--" body "--END--"
259
hoa: error "--END--"
260

261
262
string_opt: { $$ = nullptr; }
          | STRING { $$ = $1; }
263
264
265
266
BOOLEAN: 't' | 'f'

header: format-version header-items
        {
267
	  // Preallocate the states if we know their number.
268
	  if (res.states >= 0)
269
270
	    {
	      unsigned states = res.states;
271
272
273
274
275
276
277
278
	      for (auto& p : res.start)
		if ((unsigned) res.states <= p.second)
		  {
		    error(p.first,
			  "initial state number is larger than state count...");
		    error(res.states_loc, "... declared here.");
		    states = std::max(states, p.second + 1);
		  }
279
	      res.h->aut->new_states(states);
280
	      res.info_states.resize(states);
281
	    }
282
283
284
	  if (res.accset < 0)
	    {
	      error(@$, "missing 'Acceptance:' header");
285
	      res.ignore_acc = true;
286
	    }
287
288
	  // Process properties.
	  {
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
	    auto explicit_labels = res.props.find("explicit-labels");
	    auto implicit_labels = res.props.find("implicit-labels");
	    if (implicit_labels != res.props.end())
	      {
		if (explicit_labels == res.props.end())
		  {
		    res.label_style = Implicit_Labels;
		  }
		else
		  {
		    error(implicit_labels->second,
			  "'property: implicit-labels' is incompatible "
			  "with...");
		    error(explicit_labels->second,
			  "... 'property: explicit-labels'.");
		  }
	      }

307
308
309
310
311
312
	    auto trans_labels = res.props.find("trans-labels");
	    auto state_labels = res.props.find("state-labels");
	    if (trans_labels != res.props.end())
	      {
		if (state_labels == res.props.end())
		  {
313
314
		    if (res.label_style != Implicit_Labels)
		      res.label_style = Trans_Labels;
315
316
317
318
319
320
321
322
323
324
325
		  }
		else
		  {
		    error(trans_labels->second,
			  "'property: trans-labels' is incompatible with...");
		    error(state_labels->second,
			  "... 'property: state-labels'.");
		  }
	      }
	    else if (state_labels != res.props.end())
	      {
326
327
328
329
330
331
332
333
334
335
336
		if (res.label_style != Implicit_Labels)
		  {
		    res.label_style = State_Labels;
		  }
		else
		  {
		    error(state_labels->second,
			  "'property: state-labels' is incompatible with...");
		    error(implicit_labels->second,
			  "... 'property: implicit-labels'.");
		  }
337
	      }
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358

	    auto state_acc = res.props.find("state-acc");
	    auto trans_acc = res.props.find("trans-acc");
	    if (trans_acc != res.props.end())
	      {
		if (state_acc == res.props.end())
		  {
		    res.acc_style = Trans_Acc;
		  }
		else
		  {
		    error(trans_acc->second,
			  "'property: trans-acc' is incompatible with...");
		    error(state_acc->second,
			  "... 'property: state-acc'.");
		  }
	      }
	    else if (state_acc != res.props.end())
	      {
		res.acc_style = State_Acc;
	      }
359
	  }
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
	  {
	    unsigned ss = res.start.size();
	    if (ss > 1)
	      {
		auto det = res.props.find("deterministic");
		if (det != res.props.end())
		  {
		    error(det->second,
			  "deterministic automata should have at most "
			  "one initial state");
		  }
		res.deterministic = false;
	      }
	    else
	      {
		// Assume the automaton is deterministic until proven
		// wrong.
		res.deterministic = true;
	      }
	    if (ss < 1)
	      {
		auto complete = res.props.find("complete");
		if (complete != res.props.end())
		  {
		    error(complete->second,
			  "complete automata should have at least "
			  "one initial state");
		  }
		res.complete = false;
	      }
	    else
	      {
		// Assume the automaton is complete until proven
		// wrong.
		res.complete = true;
	      }
	  }
397
398
	}

399
400
401
402
403
404
405
406
407
408
409
410
version: IDENTIFIER
         {
	   if (*$1 != "v1")
	     error(@$, "unsupported version of the HOA format");
	   delete $1;
	 }

format-version: "HOA:" { res.h->loc = @1; } version
              | error "HOA:"
	        { error(@1, "ignoring leading garbage");
		  res.h->loc = @2; }
                version
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437

header-items: | header-items header-item
header-item: "States:" INT
           {
	     if (res.states >= 0)
	       {
		 error(@$, "redefinition of the number of states...");
		 error(res.states_loc, "... previously defined here.");
	       }
	     else
	       {
		 res.states_loc = @$;
	       }
	     if (((int) $2) < 0)
	       {
		 error(@$, "too many states for this implementation");
		 YYABORT;
	       }
	     res.states = std::max(res.states, (int) $2);
	   }
           | "Start:" state-conj-2
	     {
	       error(@2, "alternation is not yet supported");
	       YYABORT;
	     }
           | "Start:" state-num
	     {
438
	       res.start.emplace_back(@$, $2);
439
440
	     }
           | "AP:" INT {
441
442
443
444
445
446
447
448
449
450
	                 if (res.ignore_more_ap)
			   {
			     error(@1, "ignoring this redeclaration of APs...");
			     error(res.ap_loc, "... previously declared here.");
			   }
			 else
			   {
			     res.ap_count = $2;
			     res.ap.reserve($2);
			   }
451
452
453
	               }
                   ap-names
	     {
454
	       if (!res.ignore_more_ap)
455
		 {
456
457
458
459
460
461
462
463
464
465
		   res.ap_loc = @1 + @2;
		   if ((int) res.ap.size() != res.ap_count)
		     {
		       std::ostringstream out;
		       out << "found " << res.ap.size()
			   << " atomic propositions instead of the "
			   << res.ap_count << " announced";
		       error(@$, out.str());
		     }
		   res.ignore_more_ap = true;
466
467
468
469
		 }
	     }
           | "Alias:" ANAME label-expr
             {
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
470
471
472
473
474
475
	       if (!res.alias.emplace(*$2, bdd_from_int($3)).second)
		 {
		   std::ostringstream o;
		   o << "ignoring redefinition of alias @" << *$2;
		   error(@$, o.str());
		 }
476
477
478
479
480
	       delete $2;
	       bdd_delref($3);
	     }
           | "Acceptance:" INT
	      {
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
		if (res.ignore_more_acc)
		  {
		    error(@1 + @2, "ignoring this redefinition of the "
			  "acceptance condition...");
		    error(res.accset_loc, "... previously defined here.");
		  }
		else if ($2 > 8 * sizeof(spot::acc_cond::mark_t::value_t))
		  {
		    error(@1 + @2,
			  "this implementation cannot support such a large "
			  "number of acceptance sets");
		    YYABORT;
		  }
		else
		  {
496
		    res.h->aut->acc().add_sets($2);
497
498
499
		    res.accset = $2;
		    res.accset_loc = @1 + @2;
		  }
500
501
	     }
             acceptance-cond
502
503
	     {
	       res.ignore_more_acc = true;
504
505
	       res.h->aut->set_acceptance($2, *$4);
	       delete $4;
506
	     }
507
508
509
510
511
512
513
           | "acc-name:" IDENTIFIER acc-spec
             {
	       delete $2;
	     }
           | "tool:" STRING string_opt
             {
	       delete $2;
514
	       delete $3;
515
516
517
	     }
           | "name:" STRING
             {
518
	       res.h->aut->set_named_prop("automaton-name", $2);
519
520
521
	     }
           | "properties:" properties
           | HEADERNAME header-spec
522
523
524
525
526
527
528
529
	     {
	       char c = (*$1)[0];
	       if (c >= 'A' && c <= 'Z')
		 error(@$, "ignoring unsupported header \"" + *$1 + ":\"\n\t"
		       "(but the capital indicates information that should not"
		       " be ignored)");
	       delete $1;
	     }
530
           | error
531
532
533
534

ap-names: | ap-names ap-name
ap-name: STRING
	 {
535
	   if (!res.ignore_more_ap)
536
	     {
537
	       auto f = res.env->require(*$1);
538
539
	       auto d = res.h->aut->get_dict();
	       int b = 0;
540
541
542
543
544
545
546
	       if (f == nullptr)
		 {
		   std::ostringstream out;
		   out << "unknown atomic proposition \"" << *$1 << "\"";
		   error(@1, out.str());
		   f = spot::ltl::default_environment::instance()
		     .require("$unknown$");
547
548
549
550
551
552
553
554
555
556
557
		   b = d->register_proposition(f, res.h->aut);
		 }
	       else
		 {
		   b = d->register_proposition(f, res.h->aut);
		   if (!res.ap_set.emplace(b).second)
		     {
		       std::ostringstream out;
		       out << "duplicate atomic proposition \"" << *$1 << "\"";
		       error(@1, out.str());
		     }
558
559
560
		 }
	       f->destroy();
	       res.ap.push_back(b);
561
562
563
564
565
566
567
568
569
570
571
572
	     }
	   delete $1;
	 }

acc-spec: | acc-spec BOOLEAN
	  | acc-spec INT
	  | acc-spec IDENTIFIER
            {
	      delete $2;
	    }
properties: | properties IDENTIFIER
	      {
573
		res.props.emplace(*$2, @2);
574
575
576
577
578
579
580
581
582
583
584
585
586
		delete $2;
	      }
header-spec: | header-spec BOOLEAN
             | header-spec INT
             | header-spec STRING
	       {
		 delete $2;
	       }
             | header-spec IDENTIFIER
	       {
		 delete $2;
	       }

587
588
state-conj-2: checked-state-num '&' checked-state-num
            | state-conj-2 '&' checked-state-num
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613

label-expr: 't'
	    {
	      $$ = bddtrue.id();
	    }
          | 'f'
	    {
	      $$ = bddfalse.id();
	    }
	  | INT
	    {
	      if ($1 >= res.ap.size())
		{
		  error(@1, "AP number is larger than the number of APs...");
		  error(res.ap_loc, "... declared here");
		  $$ = bddtrue.id();
		}
	      else
		{
		  $$ = bdd_ithvar(res.ap[$1]).id();
		  bdd_addref($$);
		}
	    }
          | ANAME
	    {
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
614
615
616
617
618
619
620
621
622
623
624
	      auto i = res.alias.find(*$1);
	      if (i == res.alias.end())
		{
		  error(@$, "unknown alias @" + *$1);
		  $$ = 1;
		}
	      else
		{
		  $$ = i->second.id();
		  bdd_addref($$);
		}
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
	      delete $1;
	    }
          | '!' label-expr
	    {
              $$ = bdd_not($2);
              bdd_delref($2);
              bdd_addref($$);
            }
          | label-expr '&' label-expr
	    {
              $$ = bdd_and($1, $3);
              bdd_delref($1);
              bdd_delref($3);
              bdd_addref($$);
            }
          | label-expr '|' label-expr
	    {
              $$ = bdd_or($1, $3);
              bdd_delref($1);
              bdd_delref($3);
              bdd_addref($$);
            }
647
648
649
650
          | '(' label-expr ')'
	  {
	    $$ = $2;
	  }
651
652
653
654
655
656


acc-set: INT
            {
	      if ((int) $1 >= res.accset)
		{
657
658
659
660
661
662
663
664
665
666
667
		  if (!res.ignore_acc)
		    {
		      error(@1, "number is larger than the count "
			    "of acceptance sets...");
		      error(res.accset_loc, "... declared here.");
		    }
		  $$ = -1U;
		}
	      else
		{
		  $$ = $1;
668
669
670
671
672
		}
	    }

acceptance-cond: IDENTIFIER '(' acc-set ')'
		 {
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
673
		   if ($3 != -1U)
674
675
676
677
678
679
680
681
682
683
684
685
686
		     {
		       res.pos_acc_sets |= res.h->aut->acc().mark($3);
		       if (*$1 == "Inf")
			 $$ = new spot::acc_cond::acc_code
			   (res.h->aut->acc().inf({$3}));
		       else
			 $$ = new spot::acc_cond::acc_code
			   (res.h->aut->acc().fin({$3}));
		     }
		   else
		     {
		       $$ = new spot::acc_cond::acc_code;
		     }
687
688
689
690
		   delete $1;
		 }
               | IDENTIFIER '(' '!' acc-set ')'
		 {
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
691
		   if ($4 != -1U)
692
693
694
695
696
697
698
699
700
701
702
703
704
		     {
		       res.neg_acc_sets |= res.h->aut->acc().mark($4);
		       if (*$1 == "Inf")
			 $$ = new spot::acc_cond::acc_code
			   (res.h->aut->acc().inf_neg({$4}));
		       else
			 $$ = new spot::acc_cond::acc_code
			   (res.h->aut->acc().fin_neg({$4}));
		     }
		   else
		     {
		       $$ = new spot::acc_cond::acc_code;
		     }
705
706
707
		   delete $1;
		 }
               | '(' acceptance-cond ')'
708
709
710
	         {
		   $$ = $2;
		 }
711
               | acceptance-cond '&' acceptance-cond
712
713
714
715
716
	         {
		   $3->append_and(std::move(*$1));
		   $$ = $3;
		   delete $1;
		 }
717
718
               | acceptance-cond '|' acceptance-cond
	         {
719
720
721
		   $3->append_or(std::move(*$1));
		   $$ = $3;
		   delete $1;
722
		 }
723
               | 't'
724
725
726
	         {
		   $$ = new spot::acc_cond::acc_code;
		 }
727
728
	       | 'f'
	       {
729
730
731
	         {
		   $$ = new spot::acc_cond::acc_code(res.h->aut->acc().fin({}));
		 }
732
	       }
733
734
735


body: states
736
737
      {
	for (auto& p: res.start)
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
	  if (p.second >= res.info_states.size()
	      || !res.info_states[p.second].declared)
	    {
	      error(p.first,
		    "initial state " + std::to_string(p.second) +
		    " has no definition");
	      // Pretend that the state is declared so we do not
	      // mention it in the next loop.
	      if (p.second < res.info_states.size())
		res.info_states[p.second].declared = true;
	    }
	unsigned n = res.info_states.size();
	// States with number above res.states have already caused a
	// diagnostic, so let not add another one.
	if (res.states >= 0)
	  n = res.states;
	for (unsigned i = 0; i < n; ++i)
	  {
	    auto& p = res.info_states[i];
	    if (p.used && !p.declared)
	      error(p.used_loc,
		    "state " + std::to_string(i) + " has no definition");
	  }
761
      }
762
763
764
765
766
767
768
769
770
771
772

state-num: INT
	   {
	     if (((int) $1) < 0)
	       {
		 error(@1, "state number is too large for this implementation");
		 YYABORT;
	       }
	     $$ = $1;
	   }

773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
checked-state-num: state-num
		   {
		     if ((int) $1 >= res.states)
		       {
			 if (res.states >= 0)
			   {
			     error(@1, "state number is larger than state "
				   "count...");
			     error(res.states_loc, "... declared here.");
			   }
			 int missing =
			   ((int) $1) - res.h->aut->num_states() + 1;
			 if (missing >= 0)
			   {
			     res.h->aut->new_states(missing);
788
789
			     res.info_states.resize
			       (res.info_states.size() + missing);
790
791
			   }
		       }
792
793
794
795
796
797
798
		     // Remember the first place were a state is the
		     // destination of a transition.
		     if (!res.info_states[$1].used)
		       {
			 res.info_states[$1].used = true;
			 res.info_states[$1].used_loc = @1;
		       }
799
800
801
		     $$ = $1;
		   }

802
states: | states state
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
        {
	  if (res.deterministic || res.complete)
	    {
	      bdd available = bddtrue;
	      bool det = true;
	      for (auto& t: res.h->aut->out(res.cur_state))
		{
		  if (det && !bdd_implies(t.cond, available))
		    det = false;
		  available -= t.cond;
		}
	      if (res.deterministic && !det)
		{
		  res.deterministic = false;
		  auto p = res.props.find("deterministic");
		  if (p != res.props.end())
		    {
		      error(@2, "automaton is not deterministic...");
		      error(p->second, "... despite 'property: deterministic'");
		    }
		}
	      if (res.complete && available != bddfalse)
		{
		  res.complete = false;
		  auto p = res.props.find("complete");
		  if (p != res.props.end())
		    {
		      error(@2, "automaton is not complete...");
		      error(p->second, "... despite 'property: complete'");
		    }
		}
	    }
	}
836
837
838
state: state-name labeled-edges
     | state-name unlabeled-edges
       {
839
	 if (!res.has_state_label) // Implicit labels
840
841
842
	   {
	     if (res.cur_guard != res.guards.end())
	       error(@$, "not enough transitions for this state");
843
844
845
846
847
848
849
850
851
852
853

	     if (res.label_style == State_Labels)
	       {
		 error(@2, "these transitions have implicit labels but the"
		       " automaton is...");
		 error(res.props["state-labels"], "... declared with "
		       "'property: state-labels'");
		 // Do not repeat this message.
		 res.label_style = Mixed_Labels;
	       }

854
855
856
	     res.cur_guard = res.guards.begin();
	   }
       }
857
     | error
858
859
860
861
862
       {
	 // Assume the worse.
	 res.deterministic = false;
	 res.complete = false;
       }
863

864

865
state-name: "State:" state-label_opt checked-state-num string_opt state-acc_opt
866
867
	  {
	    res.cur_state = $3;
868
	    if (res.info_states[$3].declared)
869
870
871
872
873
	      {
		std::ostringstream o;
		o << "redeclaration of state " << $3;
		error(@1 + @3, o.str());
	      }
874
	    res.info_states[$3].declared = true;
875
	    res.acc_state = $5;
876
877
878
879
880
881
882
883
884
885
886
	    if ($4)
	      {
		if (!res.state_names)
		  res.state_names =
		    new std::vector<std::string>(res.states > 0 ?
						 res.states : 0);
		if (res.state_names->size() < $3 + 1)
		  res.state_names->resize($3 + 1);
		(*res.state_names)[$3] = std::move(*$4);
		delete $4;
	      }
887
888
889
890
891
892
	  }
label: '[' label-expr ']'
	   {
             res.cur_label = bdd_from_int($2);
             bdd_delref($2);
	   }
893
894
895
896
897
     | '[' error ']'
           {
	     error(@$, "ignoring this invalid label");
	     res.cur_label = bddtrue;
	   }
898
state-label_opt:       { res.has_state_label = false; }
899
900
901
902
903
               | label
	       {
		 res.has_state_label = true;
		 res.state_label_loc = @1;
		 res.state_label = res.cur_label;
904
905
		 if (res.label_style == Trans_Labels
		     || res.label_style == Implicit_Labels)
906
907
908
		   {
		     error(@$,
			   "state label used although the automaton was...");
909
910
911
912
913
914
915
		     if (res.label_style == Trans_Labels)
		       error(res.props["trans-labels"],
			     "... declared with 'property: trans-labels' here");
		     else
		       error(res.props["implicit-labels"],
			     "... declared with 'property: implicit-labels' "
			     "here");
916
917
918
919
		     // Do not show this error anymore.
		     res.label_style = Mixed_Labels;
		   }
	       }
920
trans-label: label
921
922
923
	         {
		   if (res.has_state_label)
		     {
924
		       error(@1, "cannot label this edge because...");
925
926
		       error(res.state_label_loc,
			     "... the state is already labeled.");
927
		       res.cur_label = res.state_label;
928
		     }
929
930
		   if (res.label_style == State_Labels
		       || res.label_style == Implicit_Labels)
931
932
933
		     {
		       error(@$, "transition label used although the "
			     "automaton was...");
934
935
936
937
938
939
940
941
		       if (res.label_style == State_Labels)
			 error(res.props["state-labels"],
			       "... declared with 'property: state-labels' "
			       "here");
		       else
			 error(res.props["implicit-labels"],
			       "... declared with 'property: implicit-labels' "
			       "here");
942
943
944
		       // Do not show this error anymore.
		       res.label_style = Mixed_Labels;
		     }
945
946
		 }

947
acc-sig: '{' acc-sets '}'
948
949
950
951
952
953
954
955
956
957
	     {
	       $$ = $2;
	       if (res.ignore_acc && !res.ignore_acc_silent)
		 {
		   error(@$, "ignoring acceptance sets because of "
			 "missing acceptance condition");
		   // Emit this message only once.
		   res.ignore_acc_silent = true;
		 }
	     }
958
959
960
961
           | '{' error '}'
	     {
	       error(@$, "ignoring this invalid acceptance set");
	     }
962
963
964
965
acc-sets:
          {
	    $$ = spot::acc_cond::mark_t(0U);
	  }
966
967
        | acc-sets acc-set
	  {
968
969
970
971
	    if (res.ignore_acc || $2 == -1U)
	      $$ = spot::acc_cond::mark_t(0U);
	    else
	      $$ = $1 | res.h->aut->acc().mark($2);
972
	  }
973

974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
state-acc_opt:
               {
                 $$ = spot::acc_cond::mark_t(0U);
               }
             | acc-sig
               {
		 $$ = $1;
		 if (res.acc_style == Trans_Acc)
		   {
		     error(@$, "state-based acceptance used despite...");
		     error(res.props["trans-acc"],
			   "... declaration of transition-based acceptance.");
		     res.acc_style = Mixed_Acc;
		   }
	       }
trans-acc_opt:
               {
                 $$ = spot::acc_cond::mark_t(0U);
               }
             | acc-sig
               {
		 $$ = $1;
		 res.trans_acc_seen = true;
		 if (res.acc_style == State_Acc)
		   {
		     error(@$, "trans-based acceptance used despite...");
		     error(res.props["state-acc"],
			   "... declaration of state-based acceptance.");
		     res.acc_style = Mixed_Acc;
		   }
	       }

1006
1007
1008
1009
1010
/* block of labeled-edges, with occasional (incorrect) unlabeled edge */
labeled-edges: | some-labeled-edges
some-labeled-edges: labeled-edge
                  | some-labeled-edges labeled-edge
                  | some-labeled-edges incorrectly-unlabeled-edge
1011
incorrectly-unlabeled-edge: checked-state-num trans-acc_opt
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
                            {
			      bdd cond = bddtrue;
			      if (!res.has_state_label)
				error(@$, "missing label for this edge "
				      "(previous edge is labeled)");
			      else
				cond = res.state_label;
			      res.h->aut->new_transition(res.cur_state, $1,
							 cond,
							 $2 | res.acc_state);
			    }
1023
labeled-edge: trans-label checked-state-num trans-acc_opt
1024
	      {
1025
1026
1027
1028
		if (res.cur_label != bddfalse)
		  res.h->aut->new_transition(res.cur_state, $2,
					     res.cur_label,
					     $3 | res.acc_state);
1029
	      }
1030
	    | trans-label state-conj-2 trans-acc_opt
1031
1032
1033
1034
1035
	      {
		error(@2, "alternation is not yet supported");
		YYABORT;
	      }

1036
1037
1038
1039
1040
1041
/* Block of unlabeled edge, with occasional (incorrect) labeled
   edge. We never have zero unlabeled edges, these are considered as
   zero labeled edges. */
unlabeled-edges: unlabeled-edge
               | unlabeled-edges unlabeled-edge
               | unlabeled-edges incorrectly-labeled-edge
1042
unlabeled-edge: checked-state-num trans-acc_opt
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
		{
		  bdd cond;
		  if (res.has_state_label)
		    {
		      cond = res.state_label;
		    }
		  else
		    {
		      if (res.guards.empty())
			fill_guards(res);
		      if (res.cur_guard == res.guards.end())
			{
			  error(@$, "too many transition for this state, "
				"ignoring this one");
			  cond = bddfalse;
			}
		      else
			{
			  cond = *res.cur_guard++;
			}
		    }
1064
1065
1066
		  if (cond != bddfalse)
		    res.h->aut->new_transition(res.cur_state, $1,
					       cond, $2 | res.acc_state);
1067
		}
1068
	      | state-conj-2 trans-acc_opt
1069
1070
1071
1072
		{
		  error(@1, "alternation is not yet supported");
		  YYABORT;
		}
1073
1074
1075
1076
1077
incorrectly-labeled-edge: trans-label unlabeled-edge
                          {
			    error(@1, "ignoring this label, because previous"
				  " edge has no label");
                          }
1078

1079
1080
1081
1082
1083
/**********************************************************************/
/*                      Rules for neverclaims                         */
/**********************************************************************/

never: "never" { res.namer = res.h->aut->create_namer<std::string>();
1084
	         res.h->aut->set_buchi();
1085
		 res.h->aut->prop_state_based_acc();
1086
1087
1088
		 res.acc_state = State_Acc;
		 res.pos_acc_sets = res.h->aut->acc().all_sets();
	       }
1089
1090
1091
1092
1093
1094
1095
1096
       '{' nc-states '}'
       {
	 // Add an accept_all state if needed.
	 if (res.accept_all_needed && !res.accept_all_seen)
	   {
	     unsigned n = res.namer->new_state("accept_all");
	     res.h->aut->new_acc_transition(n, n, bddtrue);
	   }
1097
1098
1099
1100
	 // If we aliased existing state, we have some unreachable
	 // states to remove.
	 if (res.aliased_states)
	   res.h->aut->purge_unreachable_states();
1101
1102
1103
1104
	 res.info_states.resize(res.h->aut->num_states());
	 // Pretend that we have declared all states.
	 for (auto& p: res.info_states)
	   p.declared = true;
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
       }

nc-states:
  /* empty */
  | nc-state
  | nc-states ';' nc-state
  | nc-states ';'

nc-one-ident: IDENTIFIER ':'
    {
      auto r = res.labels.insert(std::make_pair(*$1, @1));
      if (!r.second)
	{
	  error(@1, std::string("redefinition of ") + *$1 + "...");
	  error(r.first->second, std::string("... ")  + *$1
		+ " previously defined here");
	}
      $$ = $1;
    }

nc-ident-list: nc-one-ident
1126
1127
1128
1129
1130
1131
1132
1133
1134
    {
      unsigned n = res.namer->new_state(*$1);
      if (res.start.empty())
	{
	  // The first state is initial.
	  res.start.emplace_back(@$, n);
	}
      $$ = $1;
    }
1135
1136
  | nc-ident-list nc-one-ident
    {
1137
1138
      res.aliased_states |=
	res.namer->alias_state(res.namer->get_state(*$1), *$2);
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
      // Keep any identifier that starts with accept.
      if (strncmp("accept", $1->c_str(), 6))
        {
          delete $1;
          $$ = $2;
        }
      else
        {
	  delete $2;
	  $$ = $1;
        }
    }

nc-transition-block:
  "if" nc-transitions "fi"
    {
      $$ = $2;
    }
  | "do" nc-transitions "od"
    {
      $$ = $2;
    }

nc-state:
  nc-ident-list "skip"
    {
      if (*$1 == "accept_all")
	res.accept_all_seen = true;

1168
1169
1170
      auto acc = !strncmp("accept", $1->c_str(), 6) ?
	res.h->aut->acc().all_sets() : spot::acc_cond::mark_t(0U);
      res.namer->new_transition(*$1, *$1, bddtrue, acc);
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
      delete $1;
    }
  | nc-ident-list { delete $1; }
  | nc-ident-list "false" { delete $1; }
  | nc-ident-list nc-transition-block
    {
      auto acc = !strncmp("accept", $1->c_str(), 6) ?
	res.h->aut->acc().all_sets() : spot::acc_cond::mark_t(0U);
      for (auto& p: *$2)
	{
	  bdd c = bdd_from_int(p.first);
	  bdd_delref(p.first);
	  res.namer->new_transition(*$1, *p.second, c, acc);
	  delete p.second;
	}
      delete $1;
      delete $2;
    }

nc-transitions:
  /* empty */ { $$ = new std::list<pair>; }
  | nc-transitions nc-transition
    {
      if ($2)
	{
	  $1->push_back(*$2);
	  delete $2;
	}
      $$ = $1;
    }

nc-formula-or-ident: FORMULA | IDENTIFIER

nc-formula: nc-formula-or-ident
     {
       auto i = res.fcache.find(*$1);
       if (i == res.fcache.end())
	 {
	   spot::ltl::parse_error_list pel;
	   auto f = spot::ltl::parse_boolean(*$1, pel, *res.env,
					     debug_level(), true);
	   for (auto& j: pel)
	     {
	       // Adjust the diagnostic to the current position.
	       spot::location here = @1;
	       here.end.line = here.begin.line + j.first.end.line - 1;
1217
	       here.end.column = here.begin.column + j.first.end.column - 1;
1218
	       here.begin.line += j.first.begin.line - 1;
1219
	       here.begin.column += j.first.begin.column - 1;
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
	       error_list.emplace_back(here, j.second);
	     }
           bdd cond = bddfalse;
	   if (f)
	     {
	       cond = spot::formula_to_bdd(f, res.h->aut->get_dict(),
					   res.h->aut);
	       f->destroy();
	     }
	   $$ = (res.fcache[*$1] = cond).id();
	 }
       else
	 {
	   $$ = i->second.id();
	 }
       bdd_addref($$);
       delete $1;
     }
   | "false"
     {
       $$ = 0;
     }

nc-opt-dest:
  /* empty */
    {
      $$ = 0;
    }
  | "->" "goto" IDENTIFIER
    {
      $$ = $3;
    }
  | "->" "assert" FORMULA
    {
      delete $3;
      $$ = new std::string("accept_all");
      res.accept_all_needed = true;
    }

nc-src-dest: nc-formula nc-opt-dest
    {
      // If there is no destination, do ignore the transition.
      // This happens for instance with
      //   if
      //   :: false
      //   fi
      if (!$2)
	{
	  $$ = 0;
	}
      else
	{
	  $$ = new pair($1, $2);
	  res.namer->new_state(*$2);
	}
    }

nc-transition:
  ':' ':' "atomic" '{' nc-src-dest '}'
    {
      $$ = $5;
    }
  | ':' ':' nc-src-dest
    {
      $$ = $3;
    }

1287
1288
1289
1290
1291
/**********************************************************************/
/*                         Rules for LBTT                             */
/**********************************************************************/

lbtt: lbtt-header lbtt-body ENDAUT
1292
      {
1293
1294
	auto& acc = res.h->aut->acc();
	unsigned num = acc.num_sets();
1295
	res.h->aut->set_generalized_buchi(num);
1296
	res.pos_acc_sets = acc.all_sets();
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
	assert(!res.states_map.empty());
	auto n = res.states_map.size();
	if (n != (unsigned) res.states)
	  {
	    std::ostringstream err;
	    err << res.states << " states have been declared, but "
		<< n << " different state numbers have been used";
	    error(@$, err.str());
	  }
	if (res.states_map.rbegin()->first > (unsigned) res.states)
	  {
1308
1309
	    // We have seen numbers larger that the total number of
	    // states in the automaton.  Usually this happens when the
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
	    // states are numbered from 1 instead of 0, but the LBTT
	    // documentation actually allow any number to be used.
	    // What we have done is to map all input state numbers 0
	    // <= .. < n to the digraph states with the same number,
	    // and any time we saw a number larger than n, we mapped
	    // it to a new state.  The correspondence is given by
	    // res.states_map.  Now we just need to remove the useless
	    // states we allocated.
	    std::vector<unsigned> rename(res.h->aut->num_states(), -1U);
	    unsigned s = 0;
	    for (auto& i: res.states_map)
	      rename[i.second] = s++;
	    assert(s == (unsigned) res.states);
	    for (auto& i: res.start)
	      i.second = rename[i.second];
	    res.h->aut->get_graph().defrag_states(std::move(rename), s);
	  }
1327
1328
1329
	 res.info_states.resize(res.h->aut->num_states());
	 for (auto& s: res.info_states)
	   s.declared = true;
1330
      }
1331
1332
    | lbtt-header-states LBTT_EMPTY
      {
1333
        res.h->aut->set_generalized_buchi($2);
1334
	res.pos_acc_sets = res.h->aut->acc().all_sets();
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
      }

lbtt-header-states: LBTT
                  {
		    res.states = $1;
		    res.states_loc = @1;
		    res.h->aut->new_states($1);
		  }
lbtt-header: lbtt-header-states INT_S
           {
	     res.acc_mapper = new spot::acc_mapper_int(res.h->aut, $2);
	     res.h->aut->prop_state_based_acc();
1347
	     res.acc_state = State_Acc;
1348
1349
1350
1351
	   }
           | lbtt-header-states INT
           {
	     res.acc_mapper = new spot::acc_mapper_int(res.h->aut, $2);
1352
	     res.trans_acc_seen = true;
1353
1354
1355
1356
	   }
lbtt-body: lbtt-states
lbtt-states:
           | lbtt-states lbtt-state lbtt-transitions
1357

1358
1359
lbtt-state: STATE_NUM INT lbtt-acc
          {
1360
	    if ($1 >= (unsigned) res.states)
1361
	      {
1362
1363
1364
1365
		auto p = res.states_map.emplace($1, 0);
		if (p.second)
		  p.first->second = res.h->aut->new_state();
		res.cur_state = p.first->second;
1366
	      }
1367
1368
1369
1370
1371
1372
1373
	    else
	      {
		res.states_map.emplace($1, $1);
		res.cur_state = $1;
	      }
	    if ($2)
	      res.start.emplace_back(@1 + @2, res.cur_state);
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
	    res.acc_state = $3;
	  }
lbtt-acc:               { $$ = 0U; }
        | lbtt-acc ACC
	{
	  $$  = $1;
	  auto p = res.acc_mapper->lookup($2);
	  if (p.first)
	    $$ |= p.second;
	  else
	    error(@2, "more acceptance sets used than declared");
	}
lbtt-guard: STRING
          {
	    spot::ltl::parse_error_list pel;
	    auto* f = spot::ltl::parse_lbt(*$1, pel, *res.env);
	    if (!f || !pel.empty())
1391
1392
1393
1394
1395
	      {
		std::string s = "failed to parse guard: ";
		s += *$1;
		error(@$, s);
	      }
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
	    if (!pel.empty())
	      for (auto& j: pel)
		{
		  // Adjust the diagnostic to the current position.
		  spot::location here = @1;
		  here.end.line = here.begin.line + j.first.end.line - 1;
		  here.end.column = here.begin.column + j.first.end.column - 1;
		  here.begin.line += j.first.begin.line - 1;
		  here.begin.column += j.first.begin.column - 1;
		  error_list.emplace_back(here, j.second);
		}
	    if (!f)
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
	      {
		res.cur_label = bddtrue;
	      }
	    else
	      {
		res.cur_label =
		  formula_to_bdd(f, res.h->aut->get_dict(), res.h->aut);
		f->destroy();
	      }
	    delete $1;
	  }
lbtt-transitions:
                | lbtt-transitions DEST_NUM lbtt-acc lbtt-guard
                {
1422
1423
		  unsigned dst = $2;
		  if (dst >= (unsigned) res.states)
1424
		    {
1425
1426
1427
1428
		      auto p = res.states_map.emplace(dst, 0);
		      if (p.second)
			p.first->second = res.h->aut->new_state();
		      dst = p.first->second;
1429
1430
		    }
		  else
1431
1432
1433
1434
1435
1436
		    {
		      res.states_map.emplace(dst, dst);
	            }
		  res.h->aut->new_transition(res.cur_state, dst,
		                             res.cur_label,
					     res.acc_state | $3);
1437
1438
		}

1439
1440
%%

1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
static void fill_guards(result_& r)
{
  spot::bdd_dict_ptr d = r.h->aut->get_dict();
  unsigned nap = r.ap.size();

  int* vars = new int[nap];
  for (unsigned i = 0; i < nap; ++i)
    vars[i] = r.ap[nap - 1 - i];

  // build the 2^nap possible guards
  r.guards.reserve(1U << nap);
  for (size_t i = 0; i < (1U << nap); ++i)
    r.guards.push_back(bdd_ibuildcube(i, nap, vars));
  r.cur_guard = r.guards.begin();

  delete[] vars;
}

1459
1460
void
hoayy::parser::error(const location_type& location,
1461
		     const std::string& message)
1462
1463
1464
1465
{
  error_list.emplace_back(location, message);
}

1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
static spot::acc_cond::acc_code
fix_acceptance_aux(spot::acc_cond& acc,
		   spot::acc_cond::acc_code in, unsigned pos,
		   spot::acc_cond::mark_t onlyneg,
		   spot::acc_cond::mark_t both,
		   unsigned base)
{
  auto& w = in[pos];
  switch (w.op)
    {
    case spot::acc_cond::acc_op::And:
      {
	unsigned sub = pos - w.size;
	--pos;
	auto c = fix_acceptance_aux(acc, in, pos, onlyneg, both, base);
	pos -= in[pos].size;
	while (sub < pos)
	  {
	    --pos;
	    c.append_and(fix_acceptance_aux(acc, in, pos, onlyneg, both, base));
	    pos -= in[pos].size;
	  }
	return c;
      }
    case spot::acc_cond::acc_op::Or:
      {
	unsigned sub = pos - w.size;
	--pos;
	auto c = fix_acceptance_aux(acc, in, pos, onlyneg, both, base);
	pos -= in[pos].size;
	while (sub < pos)
	  {
	    --pos;
	    c.append_or(fix_acceptance_aux(acc, in, pos, onlyneg, both, base));
	    pos -= in[pos].size;
	  }
	return c;
      }
    case spot::acc_cond::acc_op::Inf:
      return acc.inf(in[pos - 1].mark);
    case spot::acc_cond::acc_op::Fin:
      return acc.fin(in[pos - 1].mark);
    case spot::acc_cond::acc_op::FinNeg:
      {
	auto m = in[pos - 1].mark;
	auto c = acc.fin(onlyneg & m);
	spot::acc_cond::mark_t tmp = 0U;
	for (auto i: both.sets())
	  {
	    if (m.has(i))
	      tmp.set(base);
	    ++base;
	  }
	if (tmp)
	  c.append_or(acc.fin(tmp));
	return c;
      }
    case spot::acc_cond::acc_op::InfNeg:
      {
	auto m = in[pos - 1].mark;
	auto c = acc.inf(onlyneg & m);
	spot::acc_cond::mark_t tmp = 0U;
	for (auto i: both.sets())
	  {
	    if (m.has(i))
	      tmp.set(base);
	    ++base;
	  }
	if (tmp)
	  c.append_and(acc.inf(tmp));
	return c;
      }
    }
  SPOT_UNREACHABLE();
  return {};
}

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1543
1544
static void fix_acceptance(result_& r)
{
1545
1546
  auto& acc = r.h->aut->acc();

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1547
1548
  // If a set x appears only as Inf(!x), we can complement it so that
  // we work with Inf(x) instead.
1549
1550
1551
1552
1553
1554
  auto onlyneg = r.neg_acc_sets - r.pos_acc_sets;
  if (onlyneg)
    {
      for (auto& t: r.h->aut->transition_vector())
	t.acc ^= onlyneg;
    }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1555
1556
1557
1558
1559
1560

  // However if set x is used elsewhere, for instance in
  //   Inf(!x) & Inf(x)
  // complementing x would be wrong.  We need to create a
  // new set, y, that is the complement of x, and rewrite
  // this as Inf(y) & Inf(x).
1561
1562
1563
  auto both = r.neg_acc_sets & r.pos_acc_sets;
  unsigned base = 0;
  if (both)
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1564
1565
1566
    {
      auto v = acc.sets(both);
      auto vs = v.size();
1567
      base = acc.add_sets(vs);
1568
      for (auto& t: r.h->aut->transition_vector())
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1569
1570
	if ((t.acc & both) != both)
	  for (unsigned i = 0; i < vs; ++i)
1571
	    if (!t.acc.has(v[i]))
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1572
1573
	      t.acc |= acc.mark(base + i);
    }
1574

1575
  if (onlyneg || both)
1576
    {
1577
1578
1579
1580
1581
      auto& acc = r.h->aut->acc();
      auto code = acc.get_acceptance();
      r.h->aut->set_acceptance(acc.num_sets(),
			       fix_acceptance_aux(acc, code, code.size() - 1,
						  onlyneg, both, base));
1582
    }
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1583
1584
}

1585
1586
static void fix_initial_state(result_& r)
{
1587
1588
1589
1590
1591

  std::vector<unsigned> start;
  start.reserve(r.start.size());
  for (auto& p : r.start)
    // Ignore initial states without declaration
1592
1593
    if (p.second < r.info_states.size()
	&& r.info_states[p.second].declared)
1594
1595
1596
      start.push_back(p.second);

  if (start.empty())
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
    {
      // If no initial state has been declared, add one, because
      // Spot will not work without one.
      r.h->aut->set_init_state(r.h->aut->new_state());
      return;
    }

  // Remove any duplicate initial state.
  std::sort(start.begin(), start.end());
  auto res = std::unique(start.begin(), start.end());
  start.resize(std::distance(start.begin(), res));

  assert(start.size() >= 1);
  if (start.size() == 1)
    {
      r.h->aut->set_init_state(start.front());
    }
  else
    {
1616
1617
      // Multiple initial states.  We might need to add a fake one,
      // unless one of the actual initial state has no incoming edge.
1618
      auto& aut = r.h->aut;
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
      std::vector<unsigned> has_incoming(aut->num_states(), 0);
      for (auto& t: aut->transitions())
	has_incoming[t.dst] = true;

      bool found = false;
      unsigned init = 0;
      for (auto p: start)
	if (!has_incoming[p])
	  {
	    init = p;
	    found = true;
	  }
      if (!found)
	// We do need a fake initial state
	init = aut->new_state();
      aut->set_init_state(init);
      for (auto p: start)
	if (p != init)
	  for (auto& t: aut->out(p))
	    aut->new_transition(init, t.dst, t.cond);
1639
1640
1641
    }
}

1642
1643
1644
1645
static void fix_properties(result_& r)
{
  r.h->aut->prop_deterministic(r.deterministic);
  //r.h->aut->prop_complete(r.complete);
1646
1647
1648
  if (r.acc_style == State_Acc ||
      (r.acc_style == Mixed_Acc && !r.trans_acc_seen))
    r.h->aut->prop_state_based_acc();
1649
1650
}

1651
1652
namespace spot
{
1653
1654
1655
  hoa_stream_parser::hoa_stream_parser(const std::string& name,
				       bool ignore_abort)
    : filename_(name), ignore_abort_(ignore_abort)
1656
1657
  {
    if (hoayyopen(name))
1658
1659
1660
      throw std::runtime_error(std::string("Cannot open file ") + name);
  }

1661
1662
1663
1664
1665
1666
1667
1668
1669
  hoa_stream_parser::hoa_stream_parser(int fd,
				       const std::string& name,
				       bool ignore_abort)
    : filename_(name), ignore_abort_(ignore_abort)
  {
    if (hoayyopen(fd))
      throw std::runtime_error(std::string("Cannot open file ") + name);
  }

1670
1671
1672
1673
1674
  hoa_stream_parser::~hoa_stream_parser()
  {
    hoayyclose();
  }

Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
1675

1676
1677
1678
1679
1680
1681
  hoa_aut_ptr
  hoa_stream_parser::parse(hoa_parse_error_list& error_list,
			   const bdd_dict_ptr& dict,
			   ltl::environment& env,
			   bool debug)
  {
1682
  restart:
1683
1684
    result_ r;
    r.h = std::make_shared<spot::hoa_aut>();
1685
    r.h->aut = make_twa_graph(dict);
1686
    r.env = &env;
1687
    hoayy::parser parser(error_list, r, last_loc);
1688
1689
    static bool env_debug = !!getenv("SPOT_DEBUG_PARSER");
    parser.set_debug_level(debug || env_debug);
1690
    hoayyreset();
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
    try
      {
	if (parser.parse())
	  r.h->aut = nullptr;
      }
    catch (const spot::hoa_abort& e)
      {
	r.h->aborted = true;
	// Bison 3.0.2 lacks a += operator for locations.
	r.h->loc = r.h->loc + e.pos;
      }
    last_loc = r.h->loc;
    last_loc.step();
    if (r.h->aborted)
1705
1706
1707
1708
1709
      {
	if (ignore_abort_)
	  goto restart;
	return r.h;
      }
1710
1711
    if (!r.h->aut)
      return nullptr;
1712
1713
    if (r.state_names)
      r.h->aut->set_named_prop("state-names", r.state_names);
1714
    fix_acceptance(r);
1715
    fix_initial_state(r);
1716
    fix_properties(r);
1717
    return r.h;
1718
  };
1719

1720
  twa_graph_ptr
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
  hoa_stream_parser::parse_strict(const bdd_dict_ptr& dict,
				  ltl::environment& env,
				  bool debug)
  {
    hoa_parse_error_list pel;
    auto a = parse(pel, dict, env, debug);

    if (!pel.empty())
      {
	std::ostringstream s;
	if (format_hoa_parse_errors(s, filename_, pel))
	  throw parse_error(s.str());
      }
    if (!a)
      return nullptr;

    if (a->aborted)
      throw parse_error("parsing aborted");

    return a->aut;
  }
1742
1743
1744
1745
1746
}

// Local Variables:
// mode: c++
// End: