#include <stdio.h>
#include <string.h>
#include <stddef.h>
#include <stdlib.h>
#include <ctype.h>
#include <osiUnistd.h>

Include dependency graph for flexdef.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	hash_entry

union	dfaacc_union

Macros
#define	NORETURN

#define	FLEX_8_BIT_CHARS

#define	CSIZE 256

#define	Char unsigned char

#define	DEFAULT_CSIZE 128

#define	MAXLINE BUFSIZ

#define	FILENAMESIZE 1024

#define	min(x, y) ((x) < (y) ? (x) : (y))

#define	max(x, y) ((x) > (y) ? (x) : (y))

#define	true 1

#define	false 0

#define	DEFAULT_SKELETON_FILE "flex.skel"

#define	EOB_POSITION -1

#define	ACTION_POSITION -2

#define	NUMDATAITEMS 10

#define	NUMDATALINES 10

#define	TRANS_STRUCT_PRINT_LENGTH 15

#define	FREE_EPSILON(state)

#define	SUPER_FREE_EPSILON(state)

#define	INITIAL_MAX_DFA_SIZE 750

#define	MAX_DFA_SIZE_INCREMENT 750

#define	YY_TRAILING_MASK 0x2000

#define	YY_TRAILING_HEAD_MASK 0x4000

#define	MAX_RULE (YY_TRAILING_MASK - 1)

#define	NIL 0

#define	JAM -1 /* to mark a missing DFA transition */

#define	NO_TRANSITION NIL

#define	UNIQUE -1 /* marks a symbol as an e.c. representative */

#define	INFINITY -1 /* for x{5,} constructions */

#define	INITIAL_MAX_CCLS 100 /* max number of unique character classes */

#define	MAX_CCLS_INCREMENT 100

#define	INITIAL_MAX_CCL_TBL_SIZE 500

#define	MAX_CCL_TBL_SIZE_INCREMENT 250

#define	INITIAL_MAX_RULES 100 /* default maximum number of rules */

#define	MAX_RULES_INCREMENT 100

#define	INITIAL_MNS 2000 /* default maximum number of nfa states */

#define	MNS_INCREMENT 1000 /* amount to bump above by if it's not enough */

#define	INITIAL_MAX_DFAS 1000 /* default maximum number of dfa states */

#define	MAX_DFAS_INCREMENT 1000

#define	JAMSTATE -32766 /* marks a reference to the state that always jams */

#define	MARKER_DIFFERENCE 32000

#define	MAXIMUM_MNS 31999

#define	INITIAL_MAX_XPAIRS 2000

#define	MAX_XPAIRS_INCREMENT 2000

#define	INITIAL_MAX_TEMPLATE_XPAIRS 2500

#define	MAX_TEMPLATE_XPAIRS_INCREMENT 2500

#define	SYM_EPSILON (CSIZE + 1) /* to mark transitions on the symbol epsilon */

#define	INITIAL_MAX_SCS 40 /* maximum number of start conditions */

#define	MAX_SCS_INCREMENT 40 /* amount to bump by if it's not enough */

#define	ONE_STACK_SIZE 500 /* stack of states with only one out-transition */

#define	SAME_TRANS -1 /* transition is the same as "default" entry for state */

#define	PROTO_SIZE_PERCENTAGE 15

#define	CHECK_COM_PERCENTAGE 50

#define	FIRST_MATCH_DIFF_PERCENTAGE 10

#define	ACCEPTABLE_DIFF_PERCENTAGE 50

#define	TEMPLATE_SAME_PERCENTAGE 60

#define	NEW_PROTO_DIFF_PERCENTAGE 20

#define	INTERIOR_FIT_PERCENTAGE 15

#define	PROT_SAVE_SIZE 2000

#define	MSP 50 /* maximum number of saved protos (protos on the proto queue) */

#define	MAX_XTIONS_FULL_INTERIOR_FIT 4

#define	MAX_ASSOC_RULES 100

#define	BAD_SUBSCRIPT -32767

#define	MAX_SHORT 32766

#define	NAME_TABLE_HASH_SIZE 101

#define	START_COND_HASH_SIZE 101

#define	CCL_HASH_SIZE 101

#define	REALLY_NOT_DETERMINED 0

#define	REALLY_USED 1

#define	REALLY_NOT_USED 2

#define	STATE_NORMAL 0x1

#define	STATE_TRAILING_CONTEXT 0x2

#define	RULE_NORMAL 0

#define	RULE_VARIABLE 1

#define	allocate_integer_array(size) (int *) allocate_array( size, sizeof( int ) )

#define	reallocate_integer_array(array, size) (int ) reallocate_array( (void ) array, size, sizeof( int ) )

#define	allocate_int_ptr_array(size) (int *) allocate_array( size, sizeof( int ) )

#define	allocate_char_ptr_array(size) (char *) allocate_array( size, sizeof( char ) )

#define	allocate_dfaacc_union(size)

#define	reallocate_int_ptr_array(array, size) (int *) reallocate_array( (void ) array, size, sizeof( int * ) )

#define	reallocate_char_ptr_array(array, size) (char *) reallocate_array( (void ) array, size, sizeof( char * ) )

#define	reallocate_dfaacc_union(array, size)

#define	allocate_character_array(size) (Char *) allocate_array( size, sizeof( Char ) )

#define	reallocate_character_array(array, size) (Char ) reallocate_array( (void ) array, size, sizeof( Char ) )

Typedefs
typedef struct hash_entry *	hash_table[]

Functions
void *	allocate_array (int size, int element_size)

void *	reallocate_array (void *array, int size, int element_size)

void	ccladd (int, int)

int	cclinit (void)

void	cclnegate (int)

void	list_character_set (FILE *, int[])

void	increase_max_dfas (void)

void	ntod (void)

void	ccl2ecl (void)

int	cre8ecs (int[], int[], int)

int	ecs_from_xlation (int[])

void	mkeccl (Char[], int, int[], int[], int, int)

void	mkechar (int, int[], int[])

void	make_tables (void)

void	flexend (int) NORETURN

void	action_out (void)

int	all_lower (Char *)

int	all_upper (Char *)

void	bubble (int[], int)

void	cshell (Char[], int, int)

void	dataend (void)

void	flexerror (char[]) NORETURN

void	flexfatal (char[])

void	lerrif (char[], int)

void	lerrsf (char[], char[])

void	line_directive_out (FILE *)

void	mk2data (int)

void	mkdata (int)

int	myctoi (Char[])

void	skelout (void)

void	transition_struct_out (int, int)

void	add_accept (int, int)

int	copysingl (int, int)

void	dumpnfa (int)

void	finish_rule (int, int, int, int)

int	link_machines (int, int)

void	mark_beginning_as_normal (int)

int	mkbranch (int, int)

int	mkclos (int)

int	mkopt (int)

int	mkor (int, int)

int	mkposcl (int)

int	mkrep (int, int, int)

int	mkstate (int)

void	new_rule (void)

void	format_pinpoint_message (char[], char[])

void	pinpoint_message (char[])

void	synerr (char[])

int	flexscan ()

void	set_input_file (char *)

int	yywrap ()

void	cclinstal (Char[], int)

int	ccllookup (Char[])

void	ndinstal (char[], Char[])

void	scinstal (char[], int)

int	sclookup (char[])

void	bldtbl (int[], int, int, int, int)

void	cmptmps (void)

void	inittbl (void)

void	mkdeftbl (void)

void	mk1tbl (int, int, int, int)

void	place_state (int *, int, int)

void	stack1 (int, int, int, int)

int	yylex ()

Variables
struct hash_entry *	ndtbl [NAME_TABLE_HASH_SIZE]

struct hash_entry *	sctbl [START_COND_HASH_SIZE]

struct hash_entry *	ccltab [CCL_HASH_SIZE]

int	printstats

int	syntaxerror

int	eofseen

int	ddebug

int	trace

int	spprdflt

int	interactive

int	caseins

int	useecs

int	fulltbl

int	usemecs

int	fullspd

int	gen_line_dirs

int	performance_report

int	backtrack_report

int	csize

int	yymore_used

int	reject

int	real_reject

int	continued_action

int	yymore_really_used

int	reject_really_used

int	datapos

int	dataline

int	linenum

FILE *	skelfile

FILE *	yyin = (FILE *) 0

FILE *	temp_action_file

FILE *	backtrack_file

char *	infilename

char **	input_files

int	num_input_files

char *	program_name

int	onestate [ONE_STACK_SIZE]

int	onesym [ONE_STACK_SIZE]

int	onenext [ONE_STACK_SIZE]

int	onedef [ONE_STACK_SIZE]

int	onesp

int	current_mns

int	num_rules

int	current_max_rules

int	lastnfa

int *	firstst

int *	lastst

int *	finalst

int *	transchar

int *	trans1

int *	trans2

int *	accptnum

int *	assoc_rule

int *	state_type

int *	rule_type

int *	rule_linenum

int	current_state_type

int	variable_trailing_context_rules

int	numtemps

int	numprots

int	protprev [MSP]

int	protnext [MSP]

int	prottbl [MSP]

int	protcomst [MSP]

int	firstprot

int	lastprot

int	protsave [PROT_SAVE_SIZE]

int	numecs

int	nextecm [CSIZE+1]

int	ecgroup [CSIZE+1]

int	nummecs

int	tecfwd [CSIZE+1]

int	tecbck [CSIZE+1]

int *	xlation

int	num_xlations

int	lastsc

int	current_max_scs

int *	scset

int *	scbol

int *	scxclu

int *	sceof

int *	actvsc

char **	scname

int	current_max_dfa_size

int	current_max_xpairs

int	current_max_template_xpairs

int	current_max_dfas

int	lastdfa

int	lasttemp

int *	nxt

int *	chk

int *	tnxt

int *	base

int *	def

int *	nultrans

int	NUL_ec

int	tblend

int	firstfree

int **	dss

int *	dfasiz

union dfaacc_union *	dfaacc

int *	accsiz

int *	dhash

int	numas

int	numsnpairs

int	jambase

int	jamstate

int	end_of_buffer_state

int	lastccl

int	current_maxccls

int *	cclmap

int *	ccllen

int *	cclng

int	cclreuse

int	current_max_ccl_tbl_size

Char *	ccltbl

char *	starttime

char *	endtime

char	nmstr [MAXLINE]

int	sectnum

int	nummt

int	hshcol

int	dfaeql

int	numeps

int	eps2

int	num_reallocs

int	tmpuses

int	totnst

int	peakpairs

int	numuniq

int	numdup

int	hshsave

int	num_backtracking

int	bol_needed

Macro Definition Documentation

#define ACCEPTABLE_DIFF_PERCENTAGE 50

Definition at line 227 of file flexdef.h.

#define ACTION_POSITION -2

Definition at line 96 of file flexdef.h.

#define allocate_char_ptr_array ( size ) (char **) allocate_array( size, sizeof( char * ) )

Definition at line 590 of file flexdef.h.

#define allocate_character_array ( size ) (Char *) allocate_array( size, sizeof( Char ) )

Definition at line 607 of file flexdef.h.

#define allocate_dfaacc_union ( size )

Value:

(union dfaacc_union *) \

allocate_array( size, sizeof( union dfaacc_union ) )

allocate_array

void * allocate_array(int size, int element_size)

Definition: misc.c:76

dfaacc_union

Definition: flexdef.h:525

Definition at line 593 of file flexdef.h.

#define allocate_int_ptr_array ( size ) (int **) allocate_array( size, sizeof( int * ) )

Definition at line 587 of file flexdef.h.

#define allocate_integer_array ( size ) (int *) allocate_array( size, sizeof( int ) )

Definition at line 581 of file flexdef.h.

#define BAD_SUBSCRIPT -32767

Definition at line 268 of file flexdef.h.

#define CCL_HASH_SIZE 101

Definition at line 296 of file flexdef.h.

#define Char unsigned char

Definition at line 59 of file flexdef.h.

#define CHECK_COM_PERCENTAGE 50

Definition at line 214 of file flexdef.h.

#define CSIZE 256

Definition at line 58 of file flexdef.h.

#define DEFAULT_CSIZE 128

Definition at line 67 of file flexdef.h.

#define DEFAULT_SKELETON_FILE "flex.skel"

Definition at line 89 of file flexdef.h.

#define EOB_POSITION -1

Definition at line 95 of file flexdef.h.

#define false 0

Definition at line 85 of file flexdef.h.

#define FILENAMESIZE 1024

Definition at line 75 of file flexdef.h.

#define FIRST_MATCH_DIFF_PERCENTAGE 10

Definition at line 221 of file flexdef.h.

#define FLEX_8_BIT_CHARS

Definition at line 55 of file flexdef.h.

#define FREE_EPSILON ( state )

Value:

(transchar[state] == SYM_EPSILON && \
     trans2[state] == NO_TRANSITION && \
     finalst[state] != state)

Definition at line 112 of file flexdef.h.

#define INFINITY -1 /* for x{5,} constructions */

Definition at line 158 of file flexdef.h.

#define INITIAL_MAX_CCL_TBL_SIZE 500

Definition at line 164 of file flexdef.h.

#define INITIAL_MAX_CCLS 100 /* max number of unique character classes */

Definition at line 160 of file flexdef.h.

#define INITIAL_MAX_DFA_SIZE 750

Definition at line 128 of file flexdef.h.

#define INITIAL_MAX_DFAS 1000 /* default maximum number of dfa states */

Definition at line 173 of file flexdef.h.

#define INITIAL_MAX_RULES 100 /* default maximum number of rules */

Definition at line 167 of file flexdef.h.

#define INITIAL_MAX_SCS 40 /* maximum number of start conditions */

Definition at line 194 of file flexdef.h.

#define INITIAL_MAX_TEMPLATE_XPAIRS 2500

Definition at line 189 of file flexdef.h.

#define INITIAL_MAX_XPAIRS 2000

Definition at line 185 of file flexdef.h.

#define INITIAL_MNS 2000 /* default maximum number of nfa states */

Definition at line 170 of file flexdef.h.

#define INTERIOR_FIT_PERCENTAGE 15

Definition at line 245 of file flexdef.h.

#define JAM -1 /* to mark a missing DFA transition */

Definition at line 155 of file flexdef.h.

#define JAMSTATE -32766 /* marks a reference to the state that always jams */

Definition at line 176 of file flexdef.h.

#define MARKER_DIFFERENCE 32000

Definition at line 181 of file flexdef.h.

#define max	(	x,
		y
	)	((x) > (y) ? (x) : (y))

Definition at line 81 of file flexdef.h.

#define MAX_ASSOC_RULES 100

Definition at line 263 of file flexdef.h.

#define MAX_CCL_TBL_SIZE_INCREMENT 250

Definition at line 165 of file flexdef.h.

#define MAX_CCLS_INCREMENT 100

Definition at line 161 of file flexdef.h.

#define MAX_DFA_SIZE_INCREMENT 750

Definition at line 129 of file flexdef.h.

#define MAX_DFAS_INCREMENT 1000

Definition at line 174 of file flexdef.h.

#define MAX_RULE (YY_TRAILING_MASK - 1)

Definition at line 147 of file flexdef.h.

#define MAX_RULES_INCREMENT 100

Definition at line 168 of file flexdef.h.

#define MAX_SCS_INCREMENT 40 /* amount to bump by if it's not enough */

Definition at line 195 of file flexdef.h.

#define MAX_SHORT 32766

Definition at line 273 of file flexdef.h.

#define MAX_TEMPLATE_XPAIRS_INCREMENT 2500

Definition at line 190 of file flexdef.h.

#define MAX_XPAIRS_INCREMENT 2000

Definition at line 186 of file flexdef.h.

#define MAX_XTIONS_FULL_INTERIOR_FIT 4

Definition at line 258 of file flexdef.h.

#define MAXIMUM_MNS 31999

Definition at line 182 of file flexdef.h.

#define MAXLINE BUFSIZ

Definition at line 72 of file flexdef.h.

#define min	(	x,
		y
	)	((x) < (y) ? (x) : (y))

Definition at line 78 of file flexdef.h.

#define MNS_INCREMENT 1000 /* amount to bump above by if it's not enough */

Definition at line 171 of file flexdef.h.

#define MSP 50 /* maximum number of saved protos (protos on the proto queue) */

Definition at line 252 of file flexdef.h.

#define NAME_TABLE_HASH_SIZE 101

Definition at line 294 of file flexdef.h.

#define NEW_PROTO_DIFF_PERCENTAGE 20

Definition at line 239 of file flexdef.h.

#define NIL 0

Definition at line 153 of file flexdef.h.

#define NO_TRANSITION NIL

Definition at line 156 of file flexdef.h.

#define NORETURN

Definition at line 51 of file flexdef.h.

#define NUMDATAITEMS 10

Definition at line 99 of file flexdef.h.

#define NUMDATALINES 10

Definition at line 104 of file flexdef.h.

#define ONE_STACK_SIZE 500 /* stack of states with only one out-transition */

Definition at line 197 of file flexdef.h.

#define PROT_SAVE_SIZE 2000

Definition at line 250 of file flexdef.h.

#define PROTO_SIZE_PERCENTAGE 15

Definition at line 206 of file flexdef.h.

#define reallocate_char_ptr_array	(	array,
		size
	)	(char *) reallocate_array( (void ) array, size, sizeof( char * ) )

Definition at line 600 of file flexdef.h.

#define reallocate_character_array	(	array,
		size
	)	(Char ) reallocate_array( (void ) array, size, sizeof( Char ) )

Definition at line 610 of file flexdef.h.

#define reallocate_dfaacc_union	(	array,
		size
	)

Value:

(union dfaacc_union *) \

reallocate_array( (void *) array, size, sizeof( union dfaacc_union ) )

reallocate_array

void * reallocate_array(void *array, int size, int element_size)

Definition: misc.c:707

dfaacc_union

Definition: flexdef.h:525

Definition at line 603 of file flexdef.h.

#define reallocate_int_ptr_array	(	array,
		size
	)	(int *) reallocate_array( (void ) array, size, sizeof( int * ) )

Definition at line 597 of file flexdef.h.

#define reallocate_integer_array	(	array,
		size
	)	(int ) reallocate_array( (void ) array, size, sizeof( int ) )

Definition at line 584 of file flexdef.h.

#define REALLY_NOT_DETERMINED 0

Definition at line 339 of file flexdef.h.

#define REALLY_NOT_USED 2

Definition at line 341 of file flexdef.h.

#define REALLY_USED 1

Definition at line 340 of file flexdef.h.

#define RULE_NORMAL 0

Definition at line 421 of file flexdef.h.

#define RULE_VARIABLE 1

Definition at line 422 of file flexdef.h.

#define SAME_TRANS -1 /* transition is the same as "default" entry for state */

Definition at line 198 of file flexdef.h.

#define START_COND_HASH_SIZE 101

Definition at line 295 of file flexdef.h.

#define STATE_NORMAL 0x1

Definition at line 413 of file flexdef.h.

#define STATE_TRAILING_CONTEXT 0x2

Definition at line 414 of file flexdef.h.

#define SUPER_FREE_EPSILON ( state )

Value:

(transchar[state] == SYM_EPSILON && \

trans1[state] == NO_TRANSITION) \

SYM_EPSILON

#define SYM_EPSILON

Definition: flexdef.h:192

trans1

int * trans1

Definition: flex.c:77

NO_TRANSITION

#define NO_TRANSITION

Definition: flexdef.h:156

transchar

int * transchar

Definition: flex.c:77

Definition at line 120 of file flexdef.h.

#define SYM_EPSILON (CSIZE + 1) /* to mark transitions on the symbol epsilon */

Definition at line 192 of file flexdef.h.

#define TEMPLATE_SAME_PERCENTAGE 60

Definition at line 233 of file flexdef.h.

#define TRANS_STRUCT_PRINT_LENGTH 15

Definition at line 107 of file flexdef.h.

#define true 1

Definition at line 84 of file flexdef.h.

#define UNIQUE -1 /* marks a symbol as an e.c. representative */

Definition at line 157 of file flexdef.h.

#define YY_TRAILING_HEAD_MASK 0x4000

Definition at line 144 of file flexdef.h.

#define YY_TRAILING_MASK 0x2000

Definition at line 141 of file flexdef.h.

Typedef Documentation

typedef struct hash_entry* hash_table[]

Definition at line 292 of file flexdef.h.

Function Documentation

void action_out ( void )

Definition at line 62 of file misc.c.

 {
     char buf[MAXLINE];
 
     while ( fgets( buf, MAXLINE, temp_action_file ) != NULL )
         if ( buf[0] == '%' && buf[1] == '%' )
             break;
         else
             fputs( buf, stdout );
     }

void add_accept	(	int	,
		int
	)

Definition at line 55 of file nfa.c.

 {
     /* hang the accepting number off an epsilon state.  if it is associated
      * with a state that has a non-epsilon out-transition, then the state
      * will accept BEFORE it makes that transition, i.e., one character
      * too soon
      */
 
     if ( transchar[finalst[mach]] == SYM_EPSILON )
         accptnum[finalst[mach]] = accepting_number;
 
     else
         {
         int astate = mkstate( SYM_EPSILON );
         accptnum[astate] = accepting_number;
         mach = link_machines( mach, astate );
         }
     }

int all_lower ( Char * )

Definition at line 104 of file misc.c.

 {
     while ( *str )
         {
         if ( ! isascii( (int) *str ) || ! islower( (int) *str ) )
             return ( 0 );
         ++str;
         }
 
     return ( 1 );
     }

int all_upper ( Char * )

Definition at line 125 of file misc.c.

 {
     while ( *str )
         {
         if ( ! isascii( (int) *str ) || ! isupper( (int) *str ) )
             return ( 0 );
         ++str;
         }
 
     return ( 1 );
     }

void* allocate_array	(	int	size,
		int	element_size
	)

Definition at line 76 of file misc.c.

 {
     void *mem;
 
     /* on 16-bit int machines (e.g., 80286) we might be trying to
      * allocate more than a signed int can hold, and that won't
      * work.  Cheap test:
      */
     if ( element_size * size <= 0 )
         flexfatal( "request for < 1 byte in allocate_array()" );
 
     mem = (void *) malloc( (unsigned) (element_size * size) );
 
     if ( mem == NULL )
         flexfatal( "memory allocation failed in allocate_array()" );
 
     return ( mem );
     }

void bldtbl	(	int	[],
		int	,
		int	,
		int	,
		int
	)

void bubble	(	int	[],
		int
	)

Definition at line 152 of file misc.c.

 {
     int i, j, k;
 
     for ( i = n; i > 1; --i )
         for ( j = 1; j < i; ++j )
             if ( v[j] > v[j + 1] )      /* compare */
                 {
                 k = v[j];       /* exchange */
                 v[j] = v[j + 1];
                 v[j + 1] = k;
                 }
     }

void ccl2ecl ( void )

Definition at line 45 of file ecs.c.

 {
     int i, ich, newlen, cclp, ccls, cclmec;
 
     for ( i = 1; i <= lastccl; ++i )
         {
         /* we loop through each character class, and for each character
          * in the class, add the character's equivalence class to the
          * new "character" class we are creating.  Thus when we are all
          * done, character classes will really consist of collections
          * of equivalence classes
          */
 
         newlen = 0;
         cclp = cclmap[i];
 
         for ( ccls = 0; ccls < ccllen[i]; ++ccls )
             {
             ich = ccltbl[cclp + ccls];
             cclmec = ecgroup[ich];
 
             if ( xlation && cclmec < 0 )
                 {
                 /* special hack--if we're doing %t tables then it's
                  * possible that no representative of this character's
                  * equivalence class is in the ccl.  So waiting till
                  * we see the representative would be disastrous.  Instead,
                  * we add this character's equivalence class anyway, if it's
                  * not already present.
                  */
                 int j;
 
                 /* this loop makes this whole process n^2; but we don't
                  * really care about %t performance anyway
                  */
                 for ( j = 0; j < newlen; ++j )
                     if ( ccltbl[cclp + j] == -cclmec )
                         break;
 
                 if ( j >= newlen )
                     { /* no representative yet, add this one in */
                     ccltbl[cclp + newlen] = -cclmec;
                     ++newlen;
                     }
                 }
 
             else if ( cclmec > 0 )
                 {
                 ccltbl[cclp + newlen] = cclmec;
                 ++newlen;
                 }
             }
 
         ccllen[i] = newlen;
         }
     }

void ccladd	(	int	,
		int
	)

Definition at line 47 of file ccl.c.

 {
     int ind, len, newpos, i;
 
     len = ccllen[cclp];
     ind = cclmap[cclp];
 
     /* check to see if the character is already in the ccl */
 
     for ( i = 0; i < len; ++i )
         if ( ccltbl[ind + i] == ch )
             return;
 
     newpos = ind + len;
 
     if ( newpos >= current_max_ccl_tbl_size )
         {
         current_max_ccl_tbl_size += MAX_CCL_TBL_SIZE_INCREMENT;
 
         ++num_reallocs;
 
         ccltbl = reallocate_character_array( ccltbl, current_max_ccl_tbl_size );
         }
 
     ccllen[cclp] = len + 1;
     ccltbl[newpos] = ch;
     }

int cclinit ( void )

Definition at line 83 of file ccl.c.

 {
     if ( ++lastccl >= current_maxccls )
         {
         current_maxccls += MAX_CCLS_INCREMENT;
 
         ++num_reallocs;
 
         cclmap = reallocate_integer_array( cclmap, current_maxccls );
         ccllen = reallocate_integer_array( ccllen, current_maxccls );
         cclng = reallocate_integer_array( cclng, current_maxccls );
         }
 
     if ( lastccl == 1 )
         /* we're making the first ccl */
         cclmap[lastccl] = 0;
 
     else
         /* the new pointer is just past the end of the last ccl.  Since
          * the cclmap points to the \first/ character of a ccl, adding the
          * length of the ccl to the cclmap pointer will produce a cursor
          * to the first free space
          */
         cclmap[lastccl] = cclmap[lastccl - 1] + ccllen[lastccl - 1];
 
     ccllen[lastccl] = 0;
     cclng[lastccl] = 0; /* ccl's start out life un-negated */
 
     return ( lastccl );
     }

void cclinstal	(	Char	[],
		int
	)

int ccllookup ( Char [] )

void cclnegate ( int )

Definition at line 122 of file ccl.c.

 {
     cclng[cclp] = 1;
     }

void cmptmps ( void )

Definition at line 228 of file tblcmp.c.

 {
     int tmpstorage[CSIZE + 1];
     int *tmp = tmpstorage, i, j;
     int totaltrans, trans;
 
     peakpairs = numtemps * numecs + tblend;
 
     if ( usemecs )
         {
         /* create equivalence classes base on data gathered on template
          * transitions
          */
 
         nummecs = cre8ecs( tecfwd, tecbck, numecs );
         }
 
     else
         nummecs = numecs;
 
     if ( lastdfa + numtemps + 1 >= current_max_dfas )
         increase_max_dfas();
 
     /* loop through each template */
 
     for ( i = 1; i <= numtemps; ++i )
         {
         totaltrans = 0; /* number of non-jam transitions out of this template */
 
         for ( j = 1; j <= numecs; ++j )
             {
             trans = tnxt[numecs * i + j];
 
             if ( usemecs )
                 {
                 /* the absolute value of tecbck is the meta-equivalence class
                  * of a given equivalence class, as set up by cre8ecs
                  */
                 if ( tecbck[j] > 0 )
                     {
                     tmp[tecbck[j]] = trans;
 
                     if ( trans > 0 )
                         ++totaltrans;
                     }
                 }
 
             else
                 {
                 tmp[j] = trans;
 
                 if ( trans > 0 )
                     ++totaltrans;
                 }
             }
 
         /* it is assumed (in a rather subtle way) in the skeleton that
          * if we're using meta-equivalence classes, the def[] entry for
          * all templates is the jam template, i.e., templates never default
          * to other non-jam table entries (e.g., another template)
          */
 
         /* leave room for the jam-state after the last real state */
         mkentry( tmp, nummecs, lastdfa + i + 1, JAMSTATE, totaltrans );
         }
     }

int copysingl	(	int	,
		int
	)

Definition at line 86 of file nfa.c.

 {
     int copy, i;
 
     copy = mkstate( SYM_EPSILON );
 
     for ( i = 1; i <= num; ++i )
         copy = link_machines( copy, dupmachine( singl ) );
 
     return ( copy );
     }

int cre8ecs	(	int	[],
		int	[],
		int
	)

Definition at line 115 of file ecs.c.

 {
     int i, j, numcl;
 
     numcl = 0;
 
     /* create equivalence class numbers.  From now on, abs( bck(x) )
      * is the equivalence class number for object x.  If bck(x)
      * is positive, then x is the representative of its equivalence
      * class.
      */
     for ( i = 1; i <= num; ++i )
         if ( bck[i] == NIL )
             {
             bck[i] = ++numcl;
             for ( j = fwd[i]; j != NIL; j = fwd[j] )
                 bck[j] = -numcl;
             }
 
     return ( numcl );
     }

void cshell	(	Char	[],
		int	,
		int
	)

void dataend ( void )

Definition at line 292 of file misc.c.

 {
     if ( datapos > 0 )
         dataflush();
 
     /* add terminator for initialization */
     puts( "    } ;\n" );
 
     dataline = 0;
     datapos = 0;
     }

void dumpnfa ( int )

Definition at line 106 of file nfa.c.

 {
     int sym, tsp1, tsp2, anum, ns;
 
     fprintf( stderr, "\n\n********** beginning dump of nfa with start state %d\n",
              state1 );
 
     /* we probably should loop starting at firstst[state1] and going to
      * lastst[state1], but they're not maintained properly when we "or"
      * all of the rules together.  So we use our knowledge that the machine
      * starts at state 1 and ends at lastnfa.
      */
 
     /* for ( ns = firstst[state1]; ns <= lastst[state1]; ++ns ) */
     for ( ns = 1; ns <= lastnfa; ++ns )
         {
         fprintf( stderr, "state # %4d\t", ns );
 
         sym = transchar[ns];
         tsp1 = trans1[ns];
         tsp2 = trans2[ns];
         anum = accptnum[ns];
 
         fprintf( stderr, "%3d:  %4d, %4d", sym, tsp1, tsp2 );
 
         if ( anum != NIL )
             fprintf( stderr, "  [%d]", anum );
 
         fprintf( stderr, "\n" );
         }
 
     fprintf( stderr, "********** end of dump\n" );
     }

int ecs_from_xlation ( int [] )

Definition at line 150 of file ecs.c.

 {
     int i;
     int nul_is_alone = false;
     int did_default_xlation_class = false;
 
     if ( xlation[0] != 0 )
         {
         /* if NUL shares its translation with other characters, choose one
          * of the other characters as the representative for the equivalence
          * class.  This allows a cheap test later to see whether we can
          * do away with NUL's equivalence class.
          */
         for ( i = 1; i < csize; ++i )
             if ( xlation[i] == -xlation[0] )
                 {
                 xlation[i] = xlation[0];
                 ecmap[0] = -xlation[0];
                 break;
                 }
 
         if ( i >= csize )
             /* didn't find a companion character--remember this fact */
             nul_is_alone = true;
         }
 
     for ( i = 1; i < csize; ++i )
         if ( xlation[i] == 0 )
             {
             if ( did_default_xlation_class )
                 ecmap[i] = -num_xlations;
 
             else
                 {
                 /* make an equivalence class for those characters not
                  * specified in the %t table
                  */
                 ++num_xlations;
                 ecmap[i] = num_xlations;
                 did_default_xlation_class = true;
                 }
             }
 
         else
             ecmap[i] = xlation[i];
 
     if ( nul_is_alone )
         /* force NUL's equivalence class to be the last one */
         {
         ++num_xlations;
         ecmap[0] = num_xlations;
 
         /* there's actually a bug here: if someone is fanatic enough to
          * put every character in its own translation class, then right
          * now we just promoted NUL's equivalence class to be csize + 1;
          * we can handle NUL's class number being == csize (by instead
          * putting it in its own table), but we can't handle some *other*
          * character having to be put in its own table, too.  So in
          * this case we bail out.
          */
         if ( num_xlations > csize )
             flexfatal( "too many %t classes!" );
         }
 
     return num_xlations;
     }

void finish_rule	(	int	,
		int	,
		int	,
		int
	)

Definition at line 209 of file nfa.c.

 {
     add_accept( mach, num_rules );
 
     /* we did this in new_rule(), but it often gets the wrong
      * number because we do it before we start parsing the current rule
      */
     rule_linenum[num_rules] = linenum;
 
     /* if this is a continued action, then the line-number has
      * already been updated, giving us the wrong number
      */
     if ( continued_action )
         --rule_linenum[num_rules];
 
     fprintf( temp_action_file, "case %d:\n", num_rules );
 
     if ( variable_trail_rule )
         {
         rule_type[num_rules] = RULE_VARIABLE;
 
         if ( performance_report )
             fprintf( stderr, "Variable trailing context rule at line %d\n",
                      rule_linenum[num_rules] );
 
         variable_trailing_context_rules = true;
         }
 
     else
         {
         rule_type[num_rules] = RULE_NORMAL;
 
         if ( headcnt > 0 || trailcnt > 0 )
             {
             /* do trailing context magic to not match the trailing characters */
             char *scanner_cp = "yy_c_buf_p = yy_cp";
             char *scanner_bp = "yy_bp";
 
             fprintf( temp_action_file,
         "*yy_cp = yy_hold_char; /* undo effects of setting up yytext */\n" );
 
             if ( headcnt > 0 )
                 fprintf( temp_action_file, "%s = %s + %d;\n",
                          scanner_cp, scanner_bp, headcnt );
 
             else
                 fprintf( temp_action_file,
                          "%s -= %d;\n", scanner_cp, trailcnt );
 
             fprintf( temp_action_file,
                      "YY_DO_BEFORE_ACTION; /* set up yytext again */\n" );
             }
         }
 
     line_directive_out( temp_action_file );
     }

void flexend ( int )

Definition at line 196 of file flex.c.

 {
     int tblsiz;
     char *flex_gettime();
 
     if ( skelfile != NULL )
         {
         if ( ferror( skelfile ) )
             flexfatal( "error occurred when writing skeleton file" );
 
         else if ( fclose( skelfile ) )
             flexfatal( "error occurred when closing skeleton file" );
         }
 
     if ( temp_action_file )
         {
         if ( ferror( temp_action_file ) )
             flexfatal( "error occurred when writing temporary action file" );
 
         else if ( fclose( temp_action_file ) )
             flexfatal( "error occurred when closing temporary action file" );
     }
 
     if ( status != 0 && outfile_created )
         {
         if ( ferror( stdout ) )
             flexfatal( "error occurred when writing output file" );
 
         else if ( fclose( stdout ) )
             flexfatal( "error occurred when closing output file" );
 
         else if ( unlink( outfile ) )
             flexfatal( "error occurred when deleting output file" );
         }
 
     if ( backtrack_report && backtrack_file )
         {
         if ( num_backtracking == 0 )
             fprintf( backtrack_file, "No backtracking.\n" );
         else if ( fullspd || fulltbl )
             fprintf( backtrack_file,
                      "%d backtracking (non-accepting) states.\n",
                      num_backtracking );
         else
             fprintf( backtrack_file, "Compressed tables always backtrack.\n" );
 
         if ( ferror( backtrack_file ) )
             flexfatal( "error occurred when writing backtracking file" );
 
         else if ( fclose( backtrack_file ) )
             flexfatal( "error occurred when closing backtracking file" );
         }
 
     if ( printstats )
         {
         endtime = flex_gettime();
 
         fprintf( stderr, "%s version %s usage statistics:\n", program_name,
                  flex_version );
         fprintf( stderr, "  started at %s, finished at %s\n",
                  starttime, endtime );
 
         fprintf( stderr, "  scanner options: -" );
 
         if ( backtrack_report )
             putc( 'b', stderr );
         if ( ddebug )
             putc( 'd', stderr );
         if ( interactive )
             putc( 'I', stderr );
         if ( caseins )
             putc( 'i', stderr );
         if ( ! gen_line_dirs )
             putc( 'L', stderr );
         if ( performance_report )
             putc( 'p', stderr );
         if ( spprdflt )
             putc( 's', stderr );
         if ( use_stdout )
             putc( 't', stderr );
         if ( trace )
             putc( 'T', stderr );
         if ( printstats )
             putc( 'v', stderr );        /* always true! */
         if ( csize == 256 )
             putc( '8', stderr );
 
         fprintf( stderr, " -C" );
 
         if ( fulltbl )
             putc( 'f', stderr );
         if ( fullspd )
             putc( 'F', stderr );
         if ( useecs )
             putc( 'e', stderr );
         if ( usemecs )
             putc( 'm', stderr );
 
         if ( strcmp( skelname, ENQUOTE(DEFAULT_SKELETON_FILE) ) )
             fprintf( stderr, " -S%s", skelname );
 
         putc( '\n', stderr );
 
         fprintf( stderr, "  %d/%d NFA states\n", lastnfa, current_mns );
         fprintf( stderr, "  %d/%d DFA states (%d words)\n", lastdfa,
                  current_max_dfas, totnst );
         fprintf( stderr,
                  "  %d rules\n", num_rules - 1 /* - 1 for def. rule */ );
 
         if ( num_backtracking == 0 )
             fprintf( stderr, "  No backtracking\n" );
         else if ( fullspd || fulltbl )
             fprintf( stderr, "  %d backtracking (non-accepting) states\n",
                      num_backtracking );
         else
             fprintf( stderr, "  compressed tables always backtrack\n" );
 
         if ( bol_needed )
             fprintf( stderr, "  Beginning-of-line patterns used\n" );
 
         fprintf( stderr, "  %d/%d start conditions\n", lastsc,
                  current_max_scs );
         fprintf( stderr, "  %d epsilon states, %d double epsilon states\n",
                  numeps, eps2 );
 
         if ( lastccl == 0 )
             fprintf( stderr, "  no character classes\n" );
         else
             fprintf( stderr,
         "  %d/%d character classes needed %d/%d words of storage, %d reused\n",
                      lastccl, current_maxccls,
                      cclmap[lastccl] + ccllen[lastccl],
                      current_max_ccl_tbl_size, cclreuse );
 
         fprintf( stderr, "  %d state/nextstate pairs created\n", numsnpairs );
         fprintf( stderr, "  %d/%d unique/duplicate transitions\n",
                  numuniq, numdup );
 
         if ( fulltbl )
             {
             tblsiz = lastdfa * numecs;
             fprintf( stderr, "  %d table entries\n", tblsiz );
             }
 
         else
             {
             tblsiz = 2 * (lastdfa + numtemps) + 2 * tblend;
 
             fprintf( stderr, "  %d/%d base-def entries created\n",
                      lastdfa + numtemps, current_max_dfas );
             fprintf( stderr, "  %d/%d (peak %d) nxt-chk entries created\n",
                      tblend, current_max_xpairs, peakpairs );
             fprintf( stderr,
                      "  %d/%d (peak %d) template nxt-chk entries created\n",
                      numtemps * nummecs, current_max_template_xpairs,
                      numtemps * numecs );
             fprintf( stderr, "  %d empty table entries\n", nummt );
             fprintf( stderr, "  %d protos created\n", numprots );
             fprintf( stderr, "  %d templates created, %d uses\n",
                      numtemps, tmpuses );
             }
 
         if ( useecs )
             {
             tblsiz = tblsiz + csize;
             fprintf( stderr, "  %d/%d equivalence classes created\n",
                      numecs, csize );
             }
 
         if ( usemecs )
             {
             tblsiz = tblsiz + numecs;
             fprintf( stderr, "  %d/%d meta-equivalence classes created\n",
                      nummecs, csize );
             }
 
         fprintf( stderr, "  %d (%d saved) hash collisions, %d DFAs equal\n",
                  hshcol, hshsave, dfaeql );
         fprintf( stderr, "  %d sets of reallocations needed\n", num_reallocs );
         fprintf( stderr, "  %d total table entries needed\n", tblsiz );
         }
 
     exit( status );
 }

void flexerror ( char [] )

void flexfatal ( char [] )

int flexscan ( )

void format_pinpoint_message	(	char	[],
		char	[]
	)

void increase_max_dfas ( void )

Definition at line 370 of file dfa.c.

 {
     current_max_dfas += MAX_DFAS_INCREMENT;
 
     ++num_reallocs;
 
     base = reallocate_integer_array( base, current_max_dfas );
     def = reallocate_integer_array( def, current_max_dfas );
     dfasiz = reallocate_integer_array( dfasiz, current_max_dfas );
     accsiz = reallocate_integer_array( accsiz, current_max_dfas );
     dhash = reallocate_integer_array( dhash, current_max_dfas );
     dss = reallocate_int_ptr_array( dss, current_max_dfas );
     dfaacc = reallocate_dfaacc_union( dfaacc, current_max_dfas );
 
     if ( nultrans )
         nultrans = reallocate_integer_array( nultrans, current_max_dfas );
     }

void inittbl ( void )

Definition at line 430 of file tblcmp.c.

 {
     int i;
 
     memset( (char *) chk, 0,
            current_max_xpairs * sizeof( int ) / sizeof( char ) );
 
     tblend = 0;
     firstfree = tblend + 1;
     numtemps = 0;
 
     if ( usemecs )
         {
         /* set up doubly-linked meta-equivalence classes
          * these are sets of equivalence classes which all have identical
          * transitions out of TEMPLATES
          */
 
         tecbck[1] = NIL;
 
         for ( i = 2; i <= numecs; ++i )
             {
             tecbck[i] = i - 1;
             tecfwd[i - 1] = i;
             }
 
         tecfwd[numecs] = NIL;
         }
     }

void lerrif	(	char	[],
		int
	)

void lerrsf	(	char	[],
		char	[]
	)

void line_directive_out ( FILE * )

Definition at line 479 of file misc.c.

 {
     if ( infilename && gen_line_dirs )
         fprintf( output_file_name, "# line %d \"%s\"\n", linenum, infilename );
     }

int link_machines	(	int	,
		int
	)

Definition at line 283 of file nfa.c.

 {
     if ( first == NIL )
         return ( last );
 
     else if ( last == NIL )
         return ( first );
 
     else
         {
         mkxtion( finalst[first], last );
         finalst[first] = finalst[last];
         lastst[first] = max( lastst[first], lastst[last] );
         firstst[first] = min( firstst[first], firstst[last] );
 
         return ( first );
         }
     }

void list_character_set	(	FILE *	,
		int	[]
	)

Definition at line 140 of file ccl.c.

 {
     int i;
     char *readable_form();
 
     putc( '[', file );
 
     for ( i = 0; i < csize; ++i )
         {
         if ( cset[i] )
             {
             int start_char = i;
 
             putc( ' ', file );
 
             fputs( readable_form( i ), file );
 
             while ( ++i < csize && cset[i] )
                 ;
 
             if ( i - 1 > start_char )
                 /* this was a run */
                 fprintf( file, "-%s", readable_form( i - 1 ) );
 
             putc( ' ', file );
             }
         }
 
     putc( ']', file );
     }

void make_tables ( void )

Definition at line 994 of file gen.c.

 {
     int i;
     int did_eof_rule = false;
 
     skelout();
 
     /* first, take care of YY_DO_BEFORE_ACTION depending on yymore being used */
     set_indent( 2 );
 
     if ( yymore_used )
         {
         indent_puts( "yytext -= yy_more_len; \\" );
         indent_puts( "yyleng = yy_cp - yytext; \\" );
         }
 
     else
         indent_puts( "yyleng = yy_cp - yy_bp; \\" );
 
     set_indent( 0 );
 
     skelout();
 
 
     printf( "#define YY_END_OF_BUFFER %d\n", num_rules + 1 );
 
     if ( fullspd )
         { /* need to define the transet type as a size large
            * enough to hold the biggest offset
            */
         int total_table_size = tblend + numecs + 1;
         char *trans_offset_type =
             total_table_size > MAX_SHORT ? "long" : "short";
 
         set_indent( 0 );
         indent_puts( "struct yy_trans_info" );
         indent_up();
         indent_puts( "{" );
         indent_puts( "short yy_verify;" );
 
         /* in cases where its sister yy_verify *is* a "yes, there is a
          * transition", yy_nxt is the offset (in records) to the next state.
          * In most cases where there is no transition, the value of yy_nxt
          * is irrelevant.  If yy_nxt is the -1th  record of a state, though,
          * then yy_nxt is the action number for that state
          */
 
         indent_put2s( "%s yy_nxt;", trans_offset_type );
         indent_puts( "};" );
         indent_down();
 
         indent_puts( "typedef const struct yy_trans_info *yy_state_type;" );
         }
 
     else
         indent_puts( "typedef int yy_state_type;" );
 
     if ( fullspd )
         genctbl();
 
     else if ( fulltbl )
         genftbl();
 
     else
         gentabs();
 
     if ( num_backtracking > 0 )
         {
         indent_puts( "static yy_state_type yy_last_accepting_state;" );
         indent_puts( "static YY_CHAR *yy_last_accepting_cpos;\n" );
         }
 
     if ( nultrans )
         {
         printf( C_state_decl, "yy_NUL_trans", lastdfa + 1 );
 
         for ( i = 1; i <= lastdfa; ++i )
             {
             if ( fullspd )
                 {
                 if ( nultrans )
                     printf( "    &yy_transition[%d],\n", base[i] );
                 else
                     printf( "    0,\n" );
                 }
 
             else
                 mkdata( nultrans[i] );
             }
 
         dataend();
         }
 
     if ( ddebug )
         { /* spit out table mapping rules to line numbers */
         indent_puts( "extern int yy_flex_debug;" );
         indent_puts( "int yy_flex_debug = 1;\n" );
 
         printf( C_short_decl, "yy_rule_linenum", num_rules );
         for ( i = 1; i < num_rules; ++i )
             mkdata( rule_linenum[i] );
         dataend();
         }
 
     if ( reject )
         {
         /* declare state buffer variables */
         puts(
         "static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;" );
         puts( "static YY_CHAR *yy_full_match;" );
         puts( "static int yy_lp;" );
 
         if ( variable_trailing_context_rules )
             {
             puts( "static int yy_looking_for_trail_begin = 0;" );
             puts( "static int yy_full_lp;" );
             puts( "static int *yy_full_state;" );
             printf( "#define YY_TRAILING_MASK 0x%x\n", YY_TRAILING_MASK );
             printf( "#define YY_TRAILING_HEAD_MASK 0x%x\n",
                     YY_TRAILING_HEAD_MASK );
             }
 
         puts( "#define REJECT \\" );
         puts( "{ \\" );
         puts(
         "*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \\" );
         puts(
             "yy_cp = yy_full_match; /* restore poss. backed-over text */ \\" );
 
         if ( variable_trailing_context_rules )
             {
             puts( "yy_lp = yy_full_lp; /* restore orig. accepting pos. */ \\" );
             puts(
                 "yy_state_ptr = yy_full_state; /* restore orig. state */ \\" );
             puts(
             "yy_current_state = *yy_state_ptr; /* restore curr. state */ \\" );
             }
 
         puts( "++yy_lp; \\" );
         puts( "goto find_rule; \\" );
         puts( "}" );
         }
 
     else
         {
         puts( "/* the intent behind this definition is that it'll catch" );
         puts( " * any uses of REJECT which flex missed" );
         puts( " */" );
         puts( "#define REJECT reject_used_but_not_detected" );
         }
 
     if ( yymore_used )
         {
         indent_puts( "static int yy_more_flag = 0;" );
         indent_puts( "static int yy_doing_yy_more = 0;" );
         indent_puts( "static int yy_more_len = 0;" );
         indent_puts(
             "#define yymore() { yy_more_flag = 1; }" );
         indent_puts(
             "#define YY_MORE_ADJ (yy_doing_yy_more ? yy_more_len : 0)" );
         }
 
     else
         {
         indent_puts( "#define yymore() yymore_used_but_not_detected" );
         indent_puts( "#define YY_MORE_ADJ 0" );
         }
 
     skelout();
 
     if ( ferror( temp_action_file ) )
         flexfatal( "error occurred when writing temporary action file" );
 
     else if ( fseek( temp_action_file,  0L, SEEK_SET) != 0 )
         flexfatal( "error occurred when rewinding temporary action file" );
 
     /* copy prolog from action_file to output file */
     action_out();
 
     skelout();
 
     set_indent( 2 );
 
     if ( yymore_used )
         {
         indent_puts( "yy_more_len = 0;" );
         indent_puts( "yy_doing_yy_more = yy_more_flag;" );
         indent_puts( "if ( yy_doing_yy_more )" );
         indent_up();
         indent_puts( "{" );
         indent_puts( "yy_more_len = yyleng;" );
         indent_puts( "yy_more_flag = 0;" );
         indent_puts( "}" );
         indent_down();
         }
 
     skelout();
 
     gen_start_state();
 
     /* note, don't use any indentation */
     puts( "yy_match:" );
     gen_next_match();
 
     skelout();
     set_indent( 2 );
     gen_find_action();
 
     skelout();
     if ( ddebug )
         {
         indent_puts( "if ( yy_flex_debug )" );
         indent_up();
 
         indent_puts( "{" );
         indent_puts( "if ( yy_act == 0 )" );
         indent_up();
         indent_puts( "fprintf( stderr, \"--scanner backtracking\\n\" );" );
         indent_down();
 
         do_indent();
         printf( "else if ( yy_act < %d )\n", num_rules );
         indent_up();
         indent_puts(
         "fprintf( stderr, \"--accepting rule at line %d (\\\"%s\\\")\\n\"," );
         indent_puts( "         yy_rule_linenum[yy_act], yytext );" );
         indent_down();
 
         do_indent();
         printf( "else if ( yy_act == %d )\n", num_rules );
         indent_up();
         indent_puts(
         "fprintf( stderr, \"--accepting default rule (\\\"%s\\\")\\n\"," );
         indent_puts( "         yytext );" );
         indent_down();
 
         do_indent();
         printf( "else if ( yy_act == %d )\n", num_rules + 1 );
         indent_up();
         indent_puts( "fprintf( stderr, \"--(end of buffer or a NUL)\\n\" );" );
         indent_down();
 
         do_indent();
         printf( "else\n" );
         indent_up();
         indent_puts( "fprintf( stderr, \"--EOF\\n\" );" );
         indent_down();
 
         indent_puts( "}" );
         indent_down();
         }
 
     /* copy actions from action_file to output file */
     skelout();
     indent_up();
     gen_bt_action();
     action_out();
 
     /* generate cases for any missing EOF rules */
     for ( i = 1; i <= lastsc; ++i )
         if ( ! sceof[i] )
             {
             do_indent();
             printf( "case YY_STATE_EOF(%s):\n", scname[i] );
             did_eof_rule = true;
             }
 
     if ( did_eof_rule )
         {
         indent_up();
         indent_puts( "yyterminate();" );
         indent_down();
         }
 
 
     /* generate code for handling NUL's, if needed */
 
     /* first, deal with backtracking and setting up yy_cp if the scanner
      * finds that it should JAM on the NUL
      */
     skelout();
     set_indent( 7 );
 
     if ( fullspd || fulltbl )
         indent_puts( "yy_cp = yy_c_buf_p;" );
 
     else
         { /* compressed table */
         if ( ! reject && ! interactive )
             {
             /* do the guaranteed-needed backtrack to figure out the match */
             indent_puts( "yy_cp = yy_last_accepting_cpos;" );
             indent_puts( "yy_current_state = yy_last_accepting_state;" );
             }
         }
 
 
     /* generate code for yy_get_previous_state() */
     set_indent( 1 );
     skelout();
 
     if ( bol_needed )
         indent_puts( "YY_CHAR *yy_bp = yytext;\n" );
 
     gen_start_state();
 
     set_indent( 2 );
     skelout();
     gen_next_state( true );
 
     set_indent( 1 );
     skelout();
     gen_NUL_trans();
 
     skelout();
 
     /* copy remainder of input to output */
 
     line_directive_out( stdout );
     (void) flexscan(); /* copy remainder of input to output */
     }

void mark_beginning_as_normal ( int )

Definition at line 316 of file nfa.c.

 {
     switch ( state_type[mach] )
         {
         case STATE_NORMAL:
             /* oh, we've already visited here */
             return;
 
         case STATE_TRAILING_CONTEXT:
             state_type[mach] = STATE_NORMAL;
 
             if ( transchar[mach] == SYM_EPSILON )
                 {
                 if ( trans1[mach] != NO_TRANSITION )
                     mark_beginning_as_normal( trans1[mach] );
 
                 if ( trans2[mach] != NO_TRANSITION )
                     mark_beginning_as_normal( trans2[mach] );
                 }
             break;
 
         default:
             flexerror( "bad state type in mark_beginning_as_normal()" );
             break;
         }
     }

void mk1tbl	(	int	,
		int	,
		int	,
		int
	)

Definition at line 647 of file tblcmp.c.

 {
     if ( firstfree < sym )
         firstfree = sym;
 
     while ( chk[firstfree] != 0 )
         if ( ++firstfree >= current_max_xpairs )
             expand_nxt_chk();
 
     base[state] = firstfree - sym;
     def[state] = onedef;
     chk[firstfree] = state;
     nxt[firstfree] = onenxt;
 
     if ( firstfree > tblend )
         {
         tblend = firstfree++;
 
         if ( firstfree >= current_max_xpairs )
             expand_nxt_chk();
         }
     }

void mk2data ( int )

Definition at line 494 of file misc.c.

 {
     if ( datapos >= NUMDATAITEMS )
         {
         putchar( ',' );
         dataflush();
         }
 
     if ( datapos == 0 )
         /* indent */
         fputs( "    ", stdout );
 
     else
         putchar( ',' );
 
     ++datapos;
 
     printf( "%5d", value );
     }

int mkbranch	(	int	,
		int
	)

Definition at line 358 of file nfa.c.

 {
     int eps;
 
     if ( first == NO_TRANSITION )
         return ( second );
 
     else if ( second == NO_TRANSITION )
         return ( first );
 
     eps = mkstate( SYM_EPSILON );
 
     mkxtion( eps, first );
     mkxtion( eps, second );
 
     return ( eps );
     }

int mkclos ( int )

Definition at line 385 of file nfa.c.

 {
     return ( mkopt( mkposcl( state ) ) );
     }

void mkdata ( int )

Definition at line 524 of file misc.c.

 {
     if ( datapos >= NUMDATAITEMS )
         {
         putchar( ',' );
         dataflush();
         }
 
     if ( datapos == 0 )
         /* indent */
         fputs( "    ", stdout );
 
     else
         putchar( ',' );
 
     ++datapos;
 
     printf( "%5d", value );
     }

void mkdeftbl ( void )

Definition at line 467 of file tblcmp.c.

 {
     int i;
 
     jamstate = lastdfa + 1;
 
     ++tblend; /* room for transition on end-of-buffer character */
 
     if ( tblend + numecs > current_max_xpairs )
         expand_nxt_chk();
 
     /* add in default end-of-buffer transition */
     nxt[tblend] = end_of_buffer_state;
     chk[tblend] = jamstate;
 
     for ( i = 1; i <= numecs; ++i )
         {
         nxt[tblend + i] = 0;
         chk[tblend + i] = jamstate;
         }
 
     jambase = tblend;
 
     base[jamstate] = jambase;
     def[jamstate] = 0;
 
     tblend += numecs;
     ++numtemps;
     }

void mkeccl	(	Char	[],
		int	,
		int	[],
		int	[],
		int	,
		int
	)

void mkechar	(	int	,
		int	[],
		int	[]
	)

Definition at line 328 of file ecs.c.

 {
     /* if until now the character has been a proper subset of
      * an equivalence class, break it away to create a new ec
      */
 
     if ( fwd[tch] != NIL )
         bck[fwd[tch]] = bck[tch];
 
     if ( bck[tch] != NIL )
         fwd[bck[tch]] = fwd[tch];
 
     fwd[tch] = NIL;
     bck[tch] = NIL;
     }

int mkopt ( int )

Definition at line 405 of file nfa.c.

 {
     int eps;
 
     if ( ! SUPER_FREE_EPSILON(finalst[mach]) )
         {
         eps = mkstate( SYM_EPSILON );
         mach = link_machines( mach, eps );
         }
 
     /* can't skimp on the following if FREE_EPSILON(mach) is true because
      * some state interior to "mach" might point back to the beginning
      * for a closure
      */
     eps = mkstate( SYM_EPSILON );
     mach = link_machines( eps, mach );
 
     mkxtion( mach, finalst[mach] );
 
     return ( mach );
     }

int mkor	(	int	,
		int
	)

Definition at line 442 of file nfa.c.

 {
     int eps, orend;
 
     if ( first == NIL )
         return ( second );
 
     else if ( second == NIL )
         return ( first );
 
     else
         {
         /* see comment in mkopt() about why we can't use the first state
          * of "first" or "second" if they satisfy "FREE_EPSILON"
          */
         eps = mkstate( SYM_EPSILON );
 
         first = link_machines( eps, first );
 
         mkxtion( first, second );
 
         if ( SUPER_FREE_EPSILON(finalst[first]) &&
              accptnum[finalst[first]] == NIL )
             {
             orend = finalst[first];
             mkxtion( finalst[second], orend );
             }
 
         else if ( SUPER_FREE_EPSILON(finalst[second]) &&
                   accptnum[finalst[second]] == NIL )
             {
             orend = finalst[second];
             mkxtion( finalst[first], orend );
             }
 
         else
             {
             eps = mkstate( SYM_EPSILON );
 
             first = link_machines( first, eps );
             orend = finalst[first];
 
             mkxtion( finalst[second], orend );
             }
         }
 
     finalst[first] = orend;
     return ( first );
     }

int mkposcl ( int )

Definition at line 501 of file nfa.c.

 {
     int eps;
 
     if ( SUPER_FREE_EPSILON(finalst[state]) )
         {
         mkxtion( finalst[state], state );
         return ( state );
         }
 
     else
         {
         eps = mkstate( SYM_EPSILON );
         mkxtion( eps, state );
         return ( link_machines( state, eps ) );
         }
     }

int mkrep	(	int	,
		int	,
		int
	)

Definition at line 532 of file nfa.c.

 {
     int base_mach, tail, copy, i;
 
     base_mach = copysingl( mach, lb - 1 );
 
     if ( ub == INFINITY )
         {
         copy = dupmachine( mach );
         mach = link_machines( mach,
                               link_machines( base_mach, mkclos( copy ) ) );
         }
 
     else
         {
         tail = mkstate( SYM_EPSILON );
 
         for ( i = lb; i < ub; ++i )
             {
             copy = dupmachine( mach );
             tail = mkopt( link_machines( copy, tail ) );
             }
 
         mach = link_machines( mach, link_machines( base_mach, tail ) );
         }
 
     return ( mach );
     }

int mkstate ( int )

Definition at line 578 of file nfa.c.

 {
     if ( ++lastnfa >= current_mns )
         {
         if ( (current_mns += MNS_INCREMENT) >= MAXIMUM_MNS )
             lerrif( "input rules are too complicated (>= %d NFA states)",
                     current_mns );
 
         ++num_reallocs;
 
         firstst = reallocate_integer_array( firstst, current_mns );
         lastst = reallocate_integer_array( lastst, current_mns );
         finalst = reallocate_integer_array( finalst, current_mns );
         transchar = reallocate_integer_array( transchar, current_mns );
         trans1 = reallocate_integer_array( trans1, current_mns );
         trans2 = reallocate_integer_array( trans2, current_mns );
         accptnum = reallocate_integer_array( accptnum, current_mns );
         assoc_rule = reallocate_integer_array( assoc_rule, current_mns );
         state_type = reallocate_integer_array( state_type, current_mns );
         }
 
     firstst[lastnfa] = lastnfa;
     finalst[lastnfa] = lastnfa;
     lastst[lastnfa] = lastnfa;
     transchar[lastnfa] = sym;
     trans1[lastnfa] = NO_TRANSITION;
     trans2[lastnfa] = NO_TRANSITION;
     accptnum[lastnfa] = NIL;
     assoc_rule[lastnfa] = num_rules;
     state_type[lastnfa] = current_state_type;
 
     /* fix up equivalence classes base on this transition.  Note that any
      * character which has its own transition gets its own equivalence class.
      * Thus only characters which are only in character classes have a chance
      * at being in the same equivalence class.  E.g. "a|b" puts 'a' and 'b'
      * into two different equivalence classes.  "[ab]" puts them in the same
      * equivalence class (barring other differences elsewhere in the input).
      */
 
     if ( sym < 0 )
         {
         /* we don't have to update the equivalence classes since that was
          * already done when the ccl was created for the first time
          */
         }
 
     else if ( sym == SYM_EPSILON )
         ++numeps;
 
     else
         {
         if ( useecs )
             /* map NUL's to csize */
             mkechar( sym ? sym : csize, nextecm, ecgroup );
         }
 
     return ( lastnfa );
     }

int myctoi ( Char [] )

void ndinstal	(	char	[],
		Char	[]
	)

void new_rule ( void )

Definition at line 674 of file nfa.c.

 {
     if ( ++num_rules >= current_max_rules )
         {
         ++num_reallocs;
         current_max_rules += MAX_RULES_INCREMENT;
         rule_type = reallocate_integer_array( rule_type, current_max_rules );
         rule_linenum =
             reallocate_integer_array( rule_linenum, current_max_rules );
         }
 
     if ( num_rules > MAX_RULE )
         lerrif( "too many rules (> %d)!", MAX_RULE );
 
     rule_linenum[num_rules] = linenum;
     }

void ntod ( void )

Definition at line 398 of file dfa.c.

 {
     int *accset, ds, nacc, newds;
     int sym, hashval, numstates, dsize;
     int num_full_table_rows = 0;        /* used only for -f */
     int *nset, *dset;
     int targptr, totaltrans, i, comstate, comfreq, targ;
     int *epsclosure(int *t, int *ns_addr, int *accset, int *nacc_addr, int *hv_addr);
     int snstods(int *sns, int numstates, int *accset, int nacc, int hashval, int *newds_addr);
     int symlist[CSIZE + 1];
     int num_start_states;
     int todo_head, todo_next;
 
     /* note that the following are indexed by *equivalence classes*
      * and not by characters.  Since equivalence classes are indexed
      * beginning with 1, even if the scanner accepts NUL's, this
      * means that (since every character is potentially in its own
      * equivalence class) these arrays must have room for indices
      * from 1 to CSIZE, so their size must be CSIZE + 1.
      */
     int duplist[CSIZE + 1], state[CSIZE + 1];
     int targfreq[CSIZE + 1], targstate[CSIZE + 1];
 
     /* this is so find_table_space(...) will know where to start looking in
      * chk/nxt for unused records for space to put in the state
      */
     if ( fullspd )
         firstfree = 0;
 
     accset = allocate_integer_array( num_rules + 1 );
     nset = allocate_integer_array( current_max_dfa_size );
 
     /* the "todo" queue is represented by the head, which is the DFA
      * state currently being processed, and the "next", which is the
      * next DFA state number available (not in use).  We depend on the
      * fact that snstods() returns DFA's \in increasing order/, and thus
      * need only know the bounds of the dfas to be processed.
      */
     todo_head = todo_next = 0;
 
     for ( i = 0; i <= csize; ++i )
         {
         duplist[i] = NIL;
         symlist[i] = false;
         }
 
     for ( i = 0; i <= num_rules; ++i )
         accset[i] = NIL;
 
     if ( trace )
         {
         dumpnfa( scset[1] );
         fputs( "\n\nDFA Dump:\n\n", stderr );
         }
 
     inittbl();
 
     /* check to see whether we should build a separate table for transitions
      * on NUL characters.  We don't do this for full-speed (-F) scanners,
      * since for them we don't have a simple state number lying around with
      * which to index the table.  We also don't bother doing it for scanners
      * unless (1) NUL is in its own equivalence class (indicated by a
      * positive value of ecgroup[NUL]), (2) NUL's equilvalence class is
      * the last equivalence class, and (3) the number of equivalence classes
      * is the same as the number of characters.  This latter case comes about
      * when useecs is false or when its true but every character still
      * manages to land in its own class (unlikely, but it's cheap to check
      * for).  If all these things are true then the character code needed
      * to represent NUL's equivalence class for indexing the tables is
      * going to take one more bit than the number of characters, and therefore
      * we won't be assured of being able to fit it into a YY_CHAR variable.
      * This rules out storing the transitions in a compressed table, since
      * the code for interpreting them uses a YY_CHAR variable (perhaps it
      * should just use an integer, though; this is worth pondering ... ###).
      *
      * Finally, for full tables, we want the number of entries in the
      * table to be a power of two so the array references go fast (it
      * will just take a shift to compute the major index).  If encoding
      * NUL's transitions in the table will spoil this, we give it its
      * own table (note that this will be the case if we're not using
      * equivalence classes).
      */
 
     /* note that the test for ecgroup[0] == numecs below accomplishes
      * both (1) and (2) above
      */
     if ( ! fullspd && ecgroup[0] == numecs )
         { /* NUL is alone in its equivalence class, which is the last one */
         int use_NUL_table = (numecs == csize);
 
         if ( fulltbl && ! use_NUL_table )
             { /* we still may want to use the table if numecs is a power of 2 */
             int power_of_two;
 
             for ( power_of_two = 1; power_of_two <= csize; power_of_two *= 2 )
                 if ( numecs == power_of_two )
                     {
                     use_NUL_table = true;
                     break;
                     }
             }
 
         if ( use_NUL_table )
             nultrans = allocate_integer_array( current_max_dfas );
             /* from now on, nultrans != nil indicates that we're
              * saving null transitions for later, separate encoding
              */
         }
 
 
     if ( fullspd )
         {
         for ( i = 0; i <= numecs; ++i )
             state[i] = 0;
         place_state( state, 0, 0 );
         }
 
     else if ( fulltbl )
         {
         if ( nultrans )
             /* we won't be including NUL's transitions in the table,
              * so build it for entries from 0 .. numecs - 1
              */
             num_full_table_rows = numecs;
 
         else
             /* take into account the fact that we'll be including
              * the NUL entries in the transition table.  Build it
              * from 0 .. numecs.
              */
             num_full_table_rows = numecs + 1;
 
         /* declare it "short" because it's a real long-shot that that
          * won't be large enough.
          */
         printf( "static short int yy_nxt[][%d] =\n    {\n",
                 /* '}' so vi doesn't get too confused */
                 num_full_table_rows );
 
         /* generate 0 entries for state #0 */
         for ( i = 0; i < num_full_table_rows; ++i )
             mk2data( 0 );
 
         /* force ',' and dataflush() next call to mk2data */
         datapos = NUMDATAITEMS;
 
         /* force extra blank line next dataflush() */
         dataline = NUMDATALINES;
         }
 
     /* create the first states */
 
     num_start_states = lastsc * 2;
 
     for ( i = 1; i <= num_start_states; ++i )
         {
         numstates = 1;
 
         /* for each start condition, make one state for the case when
          * we're at the beginning of the line (the '%' operator) and
          * one for the case when we're not
          */
         if ( i % 2 == 1 )
             nset[numstates] = scset[(i / 2) + 1];
         else
             nset[numstates] = mkbranch( scbol[i / 2], scset[i / 2] );
 
         nset = epsclosure( nset, &numstates, accset, &nacc, &hashval );
 
         if ( snstods( nset, numstates, accset, nacc, hashval, &ds ) )
             {
             numas += nacc;
             totnst += numstates;
             ++todo_next;
 
             if ( variable_trailing_context_rules && nacc > 0 )
                 check_trailing_context( nset, numstates, accset, nacc );
             }
         }
 
     if ( ! fullspd )
         {
         if ( ! snstods( nset, 0, accset, 0, 0, &end_of_buffer_state ) )
             flexfatal( "could not create unique end-of-buffer state" );
 
         ++numas;
         ++num_start_states;
         ++todo_next;
         }
 
     while ( todo_head < todo_next )
         {
         targptr = 0;
         totaltrans = 0;
 
         for ( i = 1; i <= numecs; ++i )
             state[i] = 0;
 
         ds = ++todo_head;
 
         dset = dss[ds];
         dsize = dfasiz[ds];
 
         if ( trace )
             fprintf( stderr, "state # %d:\n", ds );
 
         sympartition( dset, dsize, symlist, duplist );
 
         for ( sym = 1; sym <= numecs; ++sym )
             {
             if ( symlist[sym] )
                 {
                 symlist[sym] = 0;
 
                 if ( duplist[sym] == NIL )
                     { /* symbol has unique out-transitions */
                     numstates = symfollowset( dset, dsize, sym, nset );
                     nset = epsclosure( nset, &numstates, accset,
                                        &nacc, &hashval );
 
                     if ( snstods( nset, numstates, accset,
                                   nacc, hashval, &newds ) )
                         {
                         totnst = totnst + numstates;
                         ++todo_next;
                         numas += nacc;
 
                         if ( variable_trailing_context_rules && nacc > 0 )
                             check_trailing_context( nset, numstates,
                                 accset, nacc );
                         }
 
                     state[sym] = newds;
 
                     if ( trace )
                         fprintf( stderr, "\t%d\t%d\n", sym, newds );
 
                     targfreq[++targptr] = 1;
                     targstate[targptr] = newds;
                     ++numuniq;
                     }
 
                 else
                     {
                     /* sym's equivalence class has the same transitions
                      * as duplist(sym)'s equivalence class
                      */
                     targ = state[duplist[sym]];
                     state[sym] = targ;
 
                     if ( trace )
                         fprintf( stderr, "\t%d\t%d\n", sym, targ );
 
                     /* update frequency count for destination state */
 
                     i = 0;
                     while ( targstate[++i] != targ )
                         ;
 
                     ++targfreq[i];
                     ++numdup;
                     }
 
                 ++totaltrans;
                 duplist[sym] = NIL;
                 }
             }
 
         numsnpairs = numsnpairs + totaltrans;
 
         if ( caseins && ! useecs )
             {
             int j;
 
             for ( i = 'A', j = 'a'; i <= 'Z'; ++i, ++j )
                 state[i] = state[j];
             }
 
         if ( ds > num_start_states )
             check_for_backtracking( ds, state );
 
         if ( nultrans )
             {
             nultrans[ds] = state[NUL_ec];
             state[NUL_ec] = 0;  /* remove transition */
             }
 
         if ( fulltbl )
             {
             /* supply array's 0-element */
             if ( ds == end_of_buffer_state )
                 mk2data( -end_of_buffer_state );
             else
                 mk2data( end_of_buffer_state );
 
             for ( i = 1; i < num_full_table_rows; ++i )
                 /* jams are marked by negative of state number */
                 mk2data( state[i] ? state[i] : -ds );
 
             /* force ',' and dataflush() next call to mk2data */
             datapos = NUMDATAITEMS;
 
             /* force extra blank line next dataflush() */
             dataline = NUMDATALINES;
             }
 
         else if ( fullspd )
             place_state( state, ds, totaltrans );
 
         else if ( ds == end_of_buffer_state )
             /* special case this state to make sure it does what it's
              * supposed to, i.e., jam on end-of-buffer
              */
             stack1( ds, 0, 0, JAMSTATE );
 
         else /* normal, compressed state */
             {
             /* determine which destination state is the most common, and
              * how many transitions to it there are
              */
 
             comfreq = 0;
             comstate = 0;
 
             for ( i = 1; i <= targptr; ++i )
                 if ( targfreq[i] > comfreq )
                     {
                     comfreq = targfreq[i];
                     comstate = targstate[i];
                     }
 
             bldtbl( state, ds, totaltrans, comstate, comfreq );
             }
         }
 
     if ( fulltbl )
         dataend();
 
     else if ( ! fullspd )
         {
         cmptmps();  /* create compressed template entries */
 
         /* create tables for all the states with only one out-transition */
         while ( onesp > 0 )
             {
             mk1tbl( onestate[onesp], onesym[onesp], onenext[onesp],
                     onedef[onesp] );
             --onesp;
             }
 
         mkdeftbl();
         }
     }

void pinpoint_message ( char [] )

void place_state	(	int *	,
		int	,
		int
	)

Definition at line 807 of file tblcmp.c.

 {
     int i;
     int *state_ptr;
     int position = find_table_space( state, transnum );
 
     /* base is the table of start positions */
     base[statenum] = position;
 
     /* put in action number marker; this non-zero number makes sure that
      * find_table_space() knows that this position in chk/nxt is taken
      * and should not be used for another accepting number in another state
      */
     chk[position - 1] = 1;
 
     /* put in end-of-buffer marker; this is for the same purposes as above */
     chk[position] = 1;
 
     /* place the state into chk and nxt */
     state_ptr = &state[1];
 
     for ( i = 1; i <= numecs; ++i, ++state_ptr )
         if ( *state_ptr != 0 )
             {
             chk[position + i] = i;
             nxt[position + i] = *state_ptr;
             }
 
     if ( position + numecs > tblend )
         tblend = position + numecs;
     }

void* reallocate_array	(	void *	array,
		int	size,
		int	element_size
	)

Definition at line 707 of file misc.c.

 {
     void *new_array;
 
     /* same worry as in allocate_array(): */
     if ( size * element_size <= 0 )
         flexfatal( "attempt to increase array size by less than 1 byte" );
 
     new_array =
         (void *) realloc( (char *)array, (unsigned) (size * element_size ));
 
     if ( new_array == NULL )
         flexfatal( "attempt to increase array size failed" );
 
     return ( new_array );
     }

void scinstal	(	char	[],
		int
	)

int sclookup ( char [] )

void set_input_file ( char * )

Definition at line 2233 of file scan.c.

     {
     if ( file )
         {
         infilename = file;
         yyin = fopen( infilename, "r" );
 
         if ( yyin == NULL )
             lerrsf( "can't open %s", file );
         }
 
     else
         {
         yyin = stdin;
         infilename = "<stdin>";
         }
     }

void skelout ( void )

Definition at line 734 of file misc.c.

 {
     char buf[MAXLINE];
 
     while ( fgets( buf, MAXLINE, skelfile ) != NULL )
         if ( buf[0] == '%' && buf[1] == '%' )
             break;
         else
             fputs( buf, stdout );
     }

void stack1	(	int	,
		int	,
		int	,
		int
	)

Definition at line 851 of file tblcmp.c.

 {
     if ( onesp >= ONE_STACK_SIZE - 1 )
         mk1tbl( statenum, sym, nextstate, deflink );
 
     else
         {
         ++onesp;
         onestate[onesp] = statenum;
         onesym[onesp] = sym;
         onenext[onesp] = nextstate;
         onedef[onesp] = deflink;
         }
     }

void synerr ( char [] )

void transition_struct_out	(	int	,
		int
	)

Definition at line 756 of file misc.c.

 {
     printf( "%7d, %5d,", element_v, element_n );
 
     datapos += TRANS_STRUCT_PRINT_LENGTH;
 
     if ( datapos >= 75 )
         {
         putchar( '\n' );
 
         if ( ++dataline % 10 == 0 )
             putchar( '\n' );
 
         datapos = 0;
         }
     }

int yylex ( )

Definition at line 56 of file yylex.c.

 {
     int toktype;
     static int beglin = false;
 
     if ( eofseen )
         toktype = EOF;
     else
         toktype = flexscan();
 
     if ( toktype == EOF || toktype == 0 )
         {
         eofseen = 1;
 
         if ( sectnum == 1 )
             {
             synerr( "premature EOF" );
             sectnum = 2;
             toktype = SECTEND;
             }
 
         else if ( sectnum == 2 )
             {
             sectnum = 3;
             toktype = 0;
             }
 
         else
             toktype = 0;
         }
 
     if ( trace )
         {
         if ( beglin )
             {
             fprintf( stderr, "%d\t", num_rules + 1 );
             beglin = 0;
             }
 
         switch ( toktype )
             {
             case '<':
             case '>':
             case '^':
             case '$':
             case '"':
             case '[':
             case ']':
             case '{':
             case '}':
             case '|':
             case '(':
             case ')':
             case '-':
             case '/':
             case '\\':
             case '?':
             case '.':
             case '*':
             case '+':
             case ',':
                 (void) putc( toktype, stderr );
                 break;
 
             case '\n':
                 (void) putc( '\n', stderr );
 
                 if ( sectnum == 2 )
                     beglin = 1;
 
                 break;
 
             case SCDECL:
                 fputs( "%s", stderr );
                 break;
 
             case XSCDECL:
                 fputs( "%x", stderr );
                 break;
 
             case WHITESPACE:
                 (void) putc( ' ', stderr );
                 break;
 
             case SECTEND:
                 fputs( "%%\n", stderr );
 
                 /* we set beglin to be true so we'll start
                  * writing out numbers as we echo rules.  flexscan() has
                  * already assigned sectnum
                  */
 
                 if ( sectnum == 2 )
                     beglin = 1;
 
                 break;
 
             case NAME:
                 fprintf( stderr, "'%s'", nmstr );
                 break;
 
             case CHAR:
                 switch ( yylval )
                     {
                     case '<':
                     case '>':
                     case '^':
                     case '$':
                     case '"':
                     case '[':
                     case ']':
                     case '{':
                     case '}':
                     case '|':
                     case '(':
                     case ')':
                     case '-':
                     case '/':
                     case '\\':
                     case '?':
                     case '.':
                     case '*':
                     case '+':
                     case ',':
                         fprintf( stderr, "\\%c", yylval );
                         break;
 
                     default:
                         if ( ! isascii( yylval ) || ! isprint( yylval ) )
                             fprintf( stderr, "\\%.3o", yylval );
                         else
                             (void) putc( yylval, stderr );
                         break;
                     }
 
                 break;
 
             case NUMBER:
                 fprintf( stderr, "%d", yylval );
                 break;
 
             case PREVCCL:
                 fprintf( stderr, "[%d]", yylval );
                 break;
 
             case EOF_OP:
                 fprintf( stderr, "<<EOF>>" );
                 break;
 
             case 0:
                 fprintf( stderr, "End Marker" );
                 break;
 
             default:
                 fprintf( stderr, "*Something Weird* - tok: %d val: %d\n",
                          toktype, yylval );
                 break;
             }
         }
 
     return ( toktype );
 }

int yywrap ( )

Variable Documentation

int* accptnum

Definition at line 78 of file flex.c.

int* accsiz

Definition at line 94 of file flex.c.

int * actvsc

Definition at line 87 of file flex.c.

int * assoc_rule

Definition at line 78 of file flex.c.

FILE * backtrack_file

Definition at line 104 of file flex.c.

int backtrack_report

Definition at line 68 of file flex.c.

int* base

Definition at line 92 of file flex.c.

int bol_needed

Definition at line 102 of file flex.c.

int caseins

Definition at line 67 of file flex.c.

int * ccllen

Definition at line 96 of file flex.c.

int * cclmap

Definition at line 96 of file flex.c.

int * cclng

Definition at line 96 of file flex.c.

int cclreuse

Definition at line 96 of file flex.c.

struct hash_entry* ccltab[CCL_HASH_SIZE]

Definition at line 47 of file sym.c.

Char* ccltbl

Definition at line 98 of file flex.c.

int * chk

Definition at line 91 of file flex.c.

int continued_action

Definition at line 69 of file flex.c.

int csize

Definition at line 68 of file flex.c.

int current_max_ccl_tbl_size

Definition at line 97 of file flex.c.

int current_max_dfa_size

Definition at line 89 of file flex.c.

int current_max_dfas

Definition at line 90 of file flex.c.

int current_max_rules

Definition at line 76 of file flex.c.

int current_max_scs

Definition at line 87 of file flex.c.

int current_max_template_xpairs

Definition at line 90 of file flex.c.

int current_max_xpairs

Definition at line 89 of file flex.c.

int current_maxccls

Definition at line 96 of file flex.c.

int current_mns

Definition at line 76 of file flex.c.

int current_state_type

Definition at line 79 of file flex.c.

int dataline

Definition at line 71 of file flex.c.

int datapos

Definition at line 71 of file flex.c.

int ddebug

Definition at line 66 of file flex.c.

int * def

Definition at line 92 of file flex.c.

union dfaacc_union * dfaacc

int dfaeql

Definition at line 100 of file flex.c.

int * dfasiz

Definition at line 92 of file flex.c.

int * dhash

Definition at line 94 of file flex.c.

int ** dss

Definition at line 92 of file flex.c.

int ecgroup[CSIZE+1]

Definition at line 83 of file flex.c.

int end_of_buffer_state

Definition at line 105 of file flex.c.

char * endtime

Definition at line 99 of file flex.c.

int eofseen

Definition at line 66 of file flex.c.

int eps2

Definition at line 100 of file flex.c.

int * finalst

Definition at line 77 of file flex.c.

int firstfree

Definition at line 92 of file flex.c.

int firstprot

Definition at line 82 of file flex.c.

int* firstst

Definition at line 77 of file flex.c.

int fullspd

Definition at line 68 of file flex.c.

int fulltbl

Definition at line 67 of file flex.c.

int gen_line_dirs

Definition at line 68 of file flex.c.

int hshcol

Definition at line 100 of file flex.c.

int hshsave

Definition at line 101 of file flex.c.

char* infilename

Definition at line 73 of file flex.c.

char** input_files

Definition at line 106 of file flex.c.

int interactive

Definition at line 67 of file flex.c.

int jambase

Definition at line 95 of file flex.c.

int jamstate

Definition at line 95 of file flex.c.

int lastccl

Definition at line 96 of file flex.c.

int lastdfa

Definition at line 91 of file flex.c.

int lastnfa

Definition at line 76 of file flex.c.

int lastprot

Definition at line 82 of file flex.c.

int lastsc

Definition at line 87 of file flex.c.

int * lastst

Definition at line 77 of file flex.c.

int lasttemp

int linenum

Definition at line 71 of file flex.c.

struct hash_entry* ndtbl[NAME_TABLE_HASH_SIZE]

Definition at line 45 of file sym.c.

int nextecm[CSIZE+1]

Definition at line 83 of file flex.c.

char nmstr[MAXLINE]

Definition at line 99 of file flex.c.

int NUL_ec

Definition at line 92 of file flex.c.

int * nultrans

Definition at line 92 of file flex.c.

int num_backtracking

Definition at line 102 of file flex.c.

int num_input_files

Definition at line 107 of file flex.c.

int num_reallocs

Definition at line 100 of file flex.c.

int num_rules

Definition at line 76 of file flex.c.

int num_xlations

Definition at line 86 of file flex.c.

int numas

Definition at line 94 of file flex.c.

int numdup

Definition at line 101 of file flex.c.

int numecs

Definition at line 83 of file flex.c.

int numeps

Definition at line 100 of file flex.c.

int nummecs

Definition at line 83 of file flex.c.

int nummt

Definition at line 100 of file flex.c.

int numprots

Definition at line 81 of file flex.c.

int numsnpairs

Definition at line 95 of file flex.c.

int numtemps

Definition at line 81 of file flex.c.

int numuniq

Definition at line 101 of file flex.c.

int * nxt

Definition at line 91 of file flex.c.

int onedef[ONE_STACK_SIZE]

Definition at line 75 of file flex.c.

int onenext[ONE_STACK_SIZE]

Definition at line 75 of file flex.c.

int onesp

Definition at line 75 of file flex.c.

int onestate[ONE_STACK_SIZE]

Definition at line 74 of file flex.c.

int onesym[ONE_STACK_SIZE]

Definition at line 74 of file flex.c.

int peakpairs

Definition at line 101 of file flex.c.

int performance_report

Definition at line 68 of file flex.c.

int printstats

Definition at line 66 of file flex.c.

char* program_name

Definition at line 108 of file flex.c.

int protcomst[MSP]

Definition at line 82 of file flex.c.

int protnext[MSP]

Definition at line 81 of file flex.c.

int protprev[MSP]

Definition at line 81 of file flex.c.

int protsave[PROT_SAVE_SIZE]

Definition at line 82 of file flex.c.

int prottbl[MSP]

Definition at line 81 of file flex.c.

int real_reject

Definition at line 69 of file flex.c.

int reject

Definition at line 69 of file flex.c.

int reject_really_used

Definition at line 70 of file flex.c.

int * rule_linenum

Definition at line 78 of file flex.c.

int * rule_type

Definition at line 78 of file flex.c.

int * scbol

Definition at line 87 of file flex.c.

int * sceof

Definition at line 87 of file flex.c.

char** scname

Definition at line 88 of file flex.c.

int * scset

Definition at line 87 of file flex.c.

struct hash_entry* sctbl[START_COND_HASH_SIZE]

Definition at line 46 of file sym.c.

int * scxclu

Definition at line 87 of file flex.c.

int sectnum

Definition at line 100 of file flex.c.

FILE* skelfile

Definition at line 72 of file flex.c.

int spprdflt

Definition at line 66 of file flex.c.

char* starttime

Definition at line 99 of file flex.c.

int * state_type

Definition at line 78 of file flex.c.

int syntaxerror

Definition at line 66 of file flex.c.

int tblend

Definition at line 92 of file flex.c.

int tecbck[CSIZE+1]

Definition at line 84 of file flex.c.

int tecfwd[CSIZE+1]

Definition at line 83 of file flex.c.

FILE * temp_action_file

Definition at line 103 of file flex.c.

int tmpuses

Definition at line 101 of file flex.c.

int * tnxt

Definition at line 91 of file flex.c.

int totnst

Definition at line 101 of file flex.c.

int trace

Definition at line 66 of file flex.c.

int * trans1

Definition at line 77 of file flex.c.

int * trans2

Definition at line 77 of file flex.c.

int * transchar

Definition at line 77 of file flex.c.

int useecs

Definition at line 67 of file flex.c.

int usemecs

Definition at line 67 of file flex.c.

int variable_trailing_context_rules

Definition at line 80 of file flex.c.

int* xlation

Definition at line 85 of file flex.c.

FILE * yyin = (FILE *) 0

Definition at line 290 of file scan.c.

int yymore_really_used

Definition at line 70 of file flex.c.

int yymore_used

Definition at line 69 of file flex.c.

Classes

Macros

Typedefs

Functions

Variables

Macro Definition Documentation

Typedef Documentation

Function Documentation

Variable Documentation