summaryrefslogtreecommitdiff
path: root/src/lalr.c
blob: 74bea60c46b8c59968a57f5739e3c081a81b1bb8 (plain)
1
2
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
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
397
398
399
400
401
402
403
404
405
406
407
408
409
410
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
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
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
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
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
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
/***************************************************************
  LALR.C

     This file containts LALR routines of ZUBR.

     PART OF : ZUBR - Parsers generator for multiple syntax
                      language compilers .

     COMPILE : .

     NOTE    : NONE .

     Copyright (C) 1995 - 2026  by Andrey V.Kosteltsev.
     All Rights Reserved.
 ***************************************************************/
/*
  This file contant RUSSIAN letters( code-page: UTF-8 )
 ***************************************************************/

#include <defs.h>

#ifndef __NO_COMPILE


typedef struct ints
{
  struct ints *next;
  int          value;/*short*/
} ints;

int          tokensetsize;
int         *lookaheads;
int         *LAruleno;
unsigned    *LA;
int         *accessing_symbol;
core       **state_table;
shifts     **shift_table;
reductions **reduction_table;
int         *goto_map;
int         *from_state;
int         *to_state;

static int        infinity;
static int        maxrhs;
static int        ngotos;
static unsigned  *F;
static int      **includes;
static ints     **lookback;
static int      **R;
static int       *INDEX;
static int       *VERTICES;
static int        top;


void traverse( int i )
/***************************************************************

 Description        : traverse

 Concepts           :

 Use Global Variable: int               tokensetsize; | this file
                      static int        infinity;  | this file
                      static unsigned  *F;         | this file
                      static int      **R;         | this file
                      static int       *INDEX;     | this file
                      static int       *VERTICES;  | this file
                      static int        top;       | this file

 Use Functions      : void traverse( int );        | this file

 Parameters         : int i

 Return             : [void]

 ***************************************************************/
{
  register unsigned *fp1, *fp2, *fp3;
  register int  j;
  register int *rp;

  int       height;
  unsigned *base;

  VERTICES[++top] = i;
  INDEX[i]        = height = top;

  base = F + i * tokensetsize;
  fp3  = base + tokensetsize;

  rp = R[i];
  if( rp )
  {
    while( (j = *rp++) >= 0 )
    {
      if( INDEX[j] == 0 ) traverse( j );  /*  recursive call  */

      if( INDEX[i] > INDEX[j] ) INDEX[i] = INDEX[j];

      fp1 = base;
      fp2 = F + j * tokensetsize;

      while( fp1 < fp3 ) *fp1++ |= *fp2++;
    }
  }

  if( INDEX[i] == height )
  {
    for( ;; )
    {
      j = VERTICES[top--];
      INDEX[j] = infinity;

      if( i == j ) break;

      fp1 = base;
      fp2 = F + j * tokensetsize;

      while( fp1 < fp3 ) *fp2++ = *fp1++;
    }
  }

} /*******  End of traverse( int i )  **************************/


void digraph( int **relation )
/***************************************************************

 Description        : digraph

 Concepts           :

 Use Global Variable: static int   infinity;       | this file
                      static int   ngotos;         | this file
                      static int **R;              | this file
                      static int  *INDEX;          | this file
                      static int  *VERTICES;       | this file
                      static int   top;            | this file

 Use Functions      : void traverse( int );        | this file

 Parameters         : int **relation

 Return             : [void]

 ***************************************************************/
{
  register int i;

  infinity = ngotos + 2;
  INDEX    = NEW2 (ngotos + 1, int );
  VERTICES = NEW2 (ngotos + 1, int );
  top      = 0;

  R = relation;

  for( i = 0; i < ngotos; i++ ) INDEX[i] = 0;

  for( i = 0; i < ngotos; i++ )
  {
    if( INDEX[i] == 0 && R[i] ) traverse( i );
  }

  FREE( INDEX );
  FREE( VERTICES );

} /*******  End of digraph( int **relation )  ******************/



int ** transpose( int **R, int n )
/***************************************************************

 Description        : transpose

 Concepts           :

 Use Global Variable:

 Use Functions      :

 Parameters         : int **R, int n

 Return             : int **

 ***************************************************************/
{
  register int **new_R;
  register int **temp_R;
  register int  *nedges;
  register int  *sp;
  register int   i;
  register int   k;

  nedges = NEW2( n, int );

  for( i = 0; i < n; i++ )
  {
    sp = R[i];
    if( sp )
    {
      while( *sp >= 0 ) nedges[*sp++]++;
    }
  }

  new_R  = NEW2 (n, int *);
  temp_R = NEW2 (n, int *);

  for( i = 0; i < n; i++ )
  {
    k = nedges[i];
    if( k > 0 )
    {
      sp = NEW2( k + 1, int );
      new_R[i]  = sp;
      temp_R[i] = sp;
      sp[k]     = -1;
    }
  }

  FREE( nedges );

  for( i = 0; i < n; i++ )
  {
    sp = R[i];
    if( sp )
    {
      while( *sp >= 0 ) *temp_R[*sp++]++ = i;
    }
  }

  FREE( temp_R );

  return( new_R );

} /*******  End of transpose( int **R, int n )  ****************/


int map_goto( int state, int symbol )
/***************************************************************

 Description        : map_goto

 Concepts           : Map_goto maps a state/symbol pair into its numeric
                      representation.

 Use Global Variable: int *goto_map;               | this file
                      int *from_state;             | this file

 Use Functions      :

 Parameters         : int state, int symbol

 Return             : int

 ***************************************************************/
{
  register int high, low, middle;
  register int s;

  low  = goto_map[symbol];
  high = goto_map[symbol+1];

  for( ;; )
  {
    if( low > high )
    {
      done( 2 );
    }

    middle = ( low + high ) >> 1;
    s = from_state[middle];
    if( s == state ) return( middle );
    else if( s < state ) low = middle + 1;
        else high = middle - 1;
  }

} /*******  End of map_goto( int state, int symbol )  **********/


void add_lookback_edge( int stateno, int ruleno, int gotono )
/***************************************************************

 Description        : add_lookback_edge

 Concepts           :

 Use Global Variable: int          *lookaheads;    | this file
                      int          *LAruleno;      | this file
                      static ints **lookback;      | this file

 Use Functions      :

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register int   i, k;
  register int   found = 0;
  register ints *sp;

  i = lookaheads[stateno];
  k = lookaheads[stateno + 1];

  found = 0;

  while( !found && i < k )
  {
    if( LAruleno[i] == ruleno ) found = 1;
    else ++i;
  }

  if( found == 0 )
  {
    done( 2 );
  }

  sp = NEW( ints );
  sp->next  = lookback[i];
  sp->value = gotono;
  lookback[i] = sp;

} /*******  End of add_lookback_edge( int, int, int )  *********/


void compute_lookaheads( void )
/***************************************************************

 Description        : compute_lookaheads

 Concepts           :

 Use Global Variable: int               tokensetsize; | this file
                      int              *lookaheads; | this file
                      unsigned         *LA;        | this file
                      static unsigned  *F;         | this file
                      static ints     **lookback;  | this file

 Use Functions      :

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register int       i, n;
  register unsigned *fp1, *fp2, *fp3;
  register ints     *sp, *next;
  register unsigned *rowp;

  rowp = LA;
  n = lookaheads[nstates];
  for( i = 0; i < n; i++ )
  {
    fp3 = rowp + tokensetsize;
    for( sp = lookback[i]; sp; sp = sp->next )
    {
      fp1 = rowp;
      fp2 = F + tokensetsize * sp->value;
      while( fp1 < fp3 ) *fp1++ |= *fp2++;
    }
    rowp = fp3;
  }

  for( i = 0; i < n; i++ )
    for( sp = lookback[i]; sp; sp = next )
    {
      next = sp->next;
      FREE( sp );
    }

  FREE( lookback );
  FREE( F );

} /*******  End of compute_lookaheads( void )  *****************/


void compute_FOLLOWS( void )
/***************************************************************

 Description        : compute_FOLLOWS

 Concepts           :

 Use Global Variable: static short **includes;     | this file

 Use Functions      : void digraph( int ** );      | this file

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  digraph( includes );

} /*******  End of compute_FOLLOWS( void )  ********************/


void build_relations( void )
/***************************************************************

 Description        : build_relations

 Concepts           :

 Use Global Variable: int         *accessing_symbol; | this file
                      shifts     **shift_table;    | this file
                      int         *from_state;     | this file
                      int         *to_state;       | this file
                      static int   maxrhs;         | this file
                      static int   ngotos;         | this file
                      static int **includes;       | this file
                      char        *nullable;       | main.c
                      int        **derives;        | main.c
                      int         *ritem;          | main.c
                      int         *rrhs;           | main.c

 Use Functions      : void add_lookback_edge( int, int, int );
                      int map_goto( int, int );    | this file
                      int ** transpose( int **, int );            | this file


 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register int      i;
  register int      j;
  register int      k;
  register int     *rulep;
  register int     *rp;
  register shifts  *sp;
  register int      length;
  register int      nedges;
  register int      done;
  register int      state1;
  register int      stateno;
  register int      symbol1;
  register int      symbol2;
  register int     *intp;
  register int     *edge;
  register int     *states;
  register int    **new_includes;

  includes = NEW2( ngotos, int * );
  edge     = NEW2( ngotos + 1, int );
  states   = NEW2( maxrhs + 1, int );

  for( i = 0; i < ngotos; i++ )
  {
    nedges  = 0;
    state1  = from_state[i];
    symbol1 = accessing_symbol[to_state[i]];

    for( rulep = derives[symbol1]; *rulep >= 0; rulep++ )
    {
      length    = 1;
      states[0] = state1;
      stateno   = state1;

      for( rp = ritem + rrhs[*rulep]; *rp >= 0; rp++ )
      {
        symbol2 = *rp;
        sp = shift_table[stateno];
        k  = sp->nshifts;

        for( j = 0; j < k; j++ )
        {
          stateno = sp->shift[j];
          if( accessing_symbol[stateno] == symbol2 ) break;
        }
        states[length++] = stateno;

      } /*  End of for (rp = ritem + rrhs[*rulep]; *rp >= 0; rp++)  */
      add_lookback_edge( stateno, *rulep, i );

      length--;
      done = 0;
      while( !done )
      {
        done = 1;
        rp--;
        if( ISVAR( *rp ) )
        {
          stateno = states[--length];
          edge[nedges++] = map_goto( stateno, *rp );
          if( nullable[*rp] && length > 0 ) done = 0;
        }
      } /*  End of while (!done)  */
    } /*  End of for( rulep = derives[symbol1]; *rulep >= 0; rulep++ )  */

    if( nedges )
    {
      includes[i] = intp = NEW2( nedges + 1, int );
      for( j = 0; j < nedges; j++ ) intp[j] = edge[j];
      intp[nedges] = -1;
    }
  } /*  End of for( i = 0; i < ngotos; i++ )  */

  new_includes = transpose( includes, ngotos );

  for( i = 0; i < ngotos; i++ )
    if( includes[i] )
      FREE( includes[i] );

  FREE( includes );

  includes = new_includes;

  FREE( edge );
  FREE( states );

} /*******  End of build_relations( void )  ********************/


void initialize_F( void )
/***************************************************************

 Description        : initialize_F

 Concepts           :

 Use Global Variable: int               tokensetsize; | this file
                      int              *accessing_symbol; | this file
                      shifts          **shift_table; | this file
                      int              *to_state;  | this file
                      static int        ngotos;    | this file
                      static unsigned  *F;         | this file
                      char             *nullable;  | main.c

 Use Functions      : int map_goto( int, int );    | this file
                      void digraph( int ** );      | this file

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register int        i;
  register int        j;
  register int        k;
  register shifts    *sp;
  register int       *edge;
  register unsigned  *rowp;
  register int       *rp;
  register int      **reads;
  register int        nedges;
  register int        stateno;
  register int        symbol;
  register int        nwords;

  nwords = ngotos * tokensetsize;
  F      = NEW2( nwords, unsigned );
  reads  = NEW2( ngotos, int * );
  edge   = NEW2( ngotos + 1, int );
  nedges = 0;

  rowp = F;
  for( i = 0; i < ngotos; i++ )
  {
    stateno = to_state[i];
    sp = shift_table[stateno];
    if( sp )
    {
      k = sp->nshifts;

      for( j = 0; j < k; j++ )
      {
        symbol = accessing_symbol[sp->shift[j]];
        if( ISVAR(symbol) ) break;
        SETBIT( rowp, symbol );
      }
      for( ; j < k; j++ )
      {
        symbol = accessing_symbol[sp->shift[j]];
        if( nullable[symbol] )
        edge[nedges++] = map_goto( stateno, symbol );
      }
      if( nedges )
      {
        reads[i] = rp = NEW2( nedges + 1, int );
        for( j = 0; j < nedges; j++ ) rp[j] = edge[j];
        rp[nedges] = -1;
        nedges = 0;
      }
    }
    rowp += tokensetsize;
  } /*  End of for( i = 0; i < ngotos; i++ )  */

  SETBIT( F, 0 );
  digraph( reads );
  for( i = 0; i < ngotos; i++ )
  {
    if( reads[i] ) FREE( reads[i] );
  }
  FREE( reads );
  FREE( edge );

} /*******  End of initialize_F( void )  ***********************/


void set_goto_map( void )
/***************************************************************

 Description        : set_goto_map

 Concepts           :

 Use Global Variable: int        *goto_map;        | this file
                      int        *accessing_symbol; | this file
                      static int  ngotos;          | this file
                      int        *from_state;      | this file
                      int        *to_state;        | this file
                      shifts     *first_shift;     | lr0.c
                      int         nsyms;           | main.c
                      int         nvars;           | main.c
                      int         ntokens;         | main.c

 Use Functions      : void fatal( char * );        | error.c

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register shifts *sp;
  register int     i;
  register int     symbol;
  register int     k;
  register int    *temp_map;
  register int     state2;
  register int     state1;

  goto_map = NEW2( nvars + 1, int ) - ntokens;
  temp_map = NEW2( nvars + 1, int ) - ntokens;

  ngotos = 0;
  for( sp = first_shift; sp; sp = sp->next )
  {
    for( i = sp->nshifts - 1; i >= 0; i-- )
    {
      symbol = accessing_symbol[sp->shift[i]];
      if( ISTOKEN(symbol) ) break;
      if( ngotos == MAXWORD ) fatal( (__mpu_char16_t *)MPU_UCS2( "Too many gotos" ) );
      ngotos++;
      goto_map[symbol]++;
    }
  }

  k = 0;
  for( i = ntokens; i < nsyms; i++ )
  {
    temp_map[i] = k;
    k += goto_map[i];
  }

  for( i = ntokens; i < nsyms; i++ ) goto_map[i] = temp_map[i];

  goto_map[nsyms] = ngotos;
  temp_map[nsyms] = ngotos;

  from_state = NEW2( ngotos, int );
  to_state   = NEW2( ngotos, int );

  for( sp = first_shift; sp; sp = sp->next )
  {
    state1 = sp->number;
    for( i = sp->nshifts - 1; i >= 0; i-- )
    {
      state2 = sp->shift[i];
      symbol = accessing_symbol[state2];

      if( ISTOKEN(symbol) ) break;

      k = temp_map[symbol]++;
      from_state[k] = state1;
      to_state[k]   = state2;
    }
  }
  FREE( temp_map + ntokens );

} /*******  End of set_goto_map( void )  ***********************/


void initialize_LA( void )
/***************************************************************

 Description        : initialize_LA

 Concepts           :

 Use Global Variable: int           tokensetsize;  | this file
                      int          *lookaheads;    | this file
                      reductions  **reduction_table; | this file
                      int          *LAruleno;      | this file
                      unsigned     *LA;            | this file
                      static ints **lookback;      | this file
                      int           nstates;       | lr0.c

 Use Functions      :

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register int         i, j, k;
  register reductions *rp;

  lookaheads = NEW2( nstates + 1, int );

  k = 0;
  for( i = 0; i < nstates; i++ )
  {
    lookaheads[i] = k;
    rp = reduction_table[i];
    if( rp ) k += rp->nreds;
  }
  lookaheads[nstates] = k;

  LA       = NEW2 (k * tokensetsize, unsigned);
  LAruleno = NEW2 (k, int);
  lookback = NEW2 (k, ints *);

  k = 0;
  for( i = 0; i < nstates; i++ )
  {
    rp = reduction_table[i];

    if( rp )
    {
      for( j = 0; j < rp->nreds; j++ )
      {
        LAruleno[k] = rp->rules[j];
        k++;
      }
    }
  }

} /*******  End of initialize_LA( void )  **********************/



void set_maxrhs( void )
/***************************************************************

 Description        : set_maxrhs

 Concepts           :

 Use Global Variable: static int  maxrhs;          | this file
                      int         nitems;          | main.c
                      int        *ritem;           | main.c

 Use Functions      :

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register int *itemp;
  register int *item_end;
  register int  length;
  register int  max;

  length   = 0;
  max      = 0;
  item_end = ritem + nitems;
  for( itemp = ritem; itemp < item_end; itemp++ )
  {
    if( *itemp >= 0 )
    {
      length++;
    }
    else
    {
      if( length > max ) max = length;
      length = 0;
    }
  }
  maxrhs = max;

} /*******  End of set_maxrhs( void )  *************************/


void set_reduction_table( void )
/***************************************************************

 Description        : set_reduction_table

 Concepts           :

 Use Global Variable: reductions **reduction_table; | this file
                      int          nstates;        | lr0.c
                      reductions  *first_reduction; | lr0.c

 Use Functions      :

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register reductions *rp;

  reduction_table = NEW2( nstates, reductions * );
  for( rp = first_reduction; rp; rp = rp->next )
    reduction_table[rp->number] = rp;

} /*******  End of set_reduction_table( void )  ****************/


void set_shift_table( void )
/***************************************************************

 Description        : set_shift_table

 Concepts           :

 Use Global Variable: shifts **shift_table;        | this file
                      int      nstates;            | lr0.c
                      shifts  *first_shift;        | lr0.c

 Use Functions      :

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register shifts *sp;

  shift_table = NEW2( nstates, shifts * );
  for( sp = first_shift; sp; sp = sp->next )
    shift_table[sp->number] = sp;

} /*******  End of set_shift_table( void )  ********************/


void set_accessing_symbol( void )
/***************************************************************

 Description        : set_accessing_symbol

 Concepts           :

 Use Global Variable: short *accessing_symbol;     | this file
                      int    nstates;              | lr0.c
                      core  *first_state;          | lr0.c

 Use Functions      :

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register core *sp;

  accessing_symbol = NEW2( nstates, int );
  for( sp = first_state; sp; sp = sp->next )
    accessing_symbol[sp->number] = sp->accessing_symbol;

} /*******  End of set_accessing_symbol( void )  ***************/


void set_state_table( void )
/***************************************************************

 Description        : set_state_table

 Concepts           :

 Use Global Variable: core **state_table;          | this file
                      int    nstates;              | lr0.c
                      core  *first_state;          | lr0.c

 Use Functions      :

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  register core *sp;

  state_table = NEW2( nstates, core * );
  for( sp = first_state; sp; sp = sp->next )
    state_table[sp->number] = sp;

} /*******  End of set_state_table( void )  ********************/


void lalr( void )
/***************************************************************

 Description        : lalr

 Concepts           : use in main.c

 Use Global Variable: int tokensetsize;            | this file
                      int ntokens;                 | main.c

 Use Functions      : void set_state_table (void); | this file
                      void set_accessing_symbol (void);           | this file
                      void set_shift_table (void); | this file
                      void set_reduction_table (void);            | this file
                      void set_maxrhs (void);      | this file
                      void initialize_LA (void);   | this file
                      void set_goto_map (void);    | this file
                      void initialize_F (void);    | this file
                      void build_relations (void); | this file
                      void compute_FOLLOWS (void); | this file
                      void compute_lookaheads (void);             | this file

 Parameters         : [void]

 Return             : [void]

 ***************************************************************/
{
  tokensetsize = SIZE_IN_INT( ntokens );

  set_state_table();
  set_accessing_symbol();
  set_shift_table();
  set_reduction_table();
  set_maxrhs();
  initialize_LA();
  set_goto_map();
  initialize_F();
  build_relations();
  compute_FOLLOWS();
  compute_lookaheads();

} /*******  End of lalr( void )  *******************************/

#endif /* __NO_COMPILE */

/********************  ENF OF FILE LALR.C  *********************/