/* flexdef - definitions file for flex */

/*  Copyright (c) 1990 The Regents of the University of California. */

/*  All rights reserved. */

/*  This code is derived from software contributed to Berkeley by */

/*  Vern Paxson. */

/*  The United States Government has rights in this work pursuant */

/*  to contract no. DE-AC03-76SF00098 between the United States */

/*  Department of Energy and the University of California. */

/*  This file is part of flex. */

/*  Redistribution and use in source and binary forms, with or without */

/*  modification, are permitted provided that the following conditions */

/*  are met: */

/*  1. Redistributions of source code must retain the above copyright */

/*     notice, this list of conditions and the following disclaimer. */

/*  2. Redistributions in binary form must reproduce the above copyright */

/*     notice, this list of conditions and the following disclaimer in the */

/*     documentation and/or other materials provided with the distribution. */

/*  Neither the name of the University nor the names of its contributors */

/*  may be used to endorse or promote products derived from this software */

/*  without specific prior written permission. */

/*  THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR */

/*  IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED */

/*  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */

/*  PURPOSE. */

#ifndef FLEXDEF_H

#define FLEXDEF_H 1

#ifdef HAVE_CONFIG_H

#include <config.h>

#endif

#include <stdio.h>

#include <stdlib.h>

#include <stdarg.h>

#include <setjmp.h>

#include <ctype.h>

#include <libgen.h> /* for XPG version of basename(3) */

#include <string.h>

#include <math.h>

#ifdef HAVE_ASSERT_H

#include <assert.h>

#else

#define assert(Pred)

#endif

#ifdef HAVE_LIMITS_H

#include <limits.h>

#endif

#ifdef HAVE_UNISTD_H

#include <unistd.h>

#endif

#ifdef HAVE_NETINET_IN_H

#include <netinet/in.h>

#endif

#ifdef HAVE_SYS_PARAMS_H

#include <sys/params.h>

#endif

#ifdef HAVE_SYS_STAT_H

#include <sys/stat.h>

#endif

#include <sys/wait.h>

#include <stdbool.h>

#ifdef HAVE_REGEX_H

#include <regex.h>

#endif

#include "flexint.h"

/* We use gettext. So, when we write strings which should be translated, we mark them with _() */

#ifdef ENABLE_NLS

#ifdef HAVE_LOCALE_H

#include <locale.h>

#endif /* HAVE_LOCALE_H */

#include "gettext.h"

#define _(String) gettext (String)

#else

#define _(STRING) STRING

#endif /* ENABLE_NLS */

/* Always be prepared to generate an 8-bit scanner. */

#define CSIZE 256

/* Size of input alphabet - should be size of ASCII set. */

#ifndef DEFAULT_CSIZE

#define DEFAULT_CSIZE 128

#endif

/* Maximum line length we'll have to deal with. */

#define MAXLINE 2048

#ifndef MIN

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

#endif

#ifndef MAX

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

#endif

#ifndef ABS

#define ABS(x) ((x) < 0 ? -(x) : (x))

#endif

#define unspecified -1

/* Special chk[] values marking the slots taking by end-of-buffer and action

 * numbers.

 */

#define EOB_POSITION -1

#define ACTION_POSITION -2

/* Number of data items per line for -f output. */

#define NUMDATAITEMS 10

/* Number of lines of data in -f output before inserting a blank line for

 * readability.

 */

#define NUMDATALINES 10

/* transition_struct_out() definitions. */

#define TRANS_STRUCT_PRINT_LENGTH 14

/* Returns true if an nfa state has an epsilon out-transition slot

 * that can be used.  This definition is currently not used.

 */

#define FREE_EPSILON(state) \

	(transchar[state] == SYM_EPSILON && \

	 trans2[state] == NO_TRANSITION && \

	 finalst[state] != state)

/* Returns true if an nfa state has an epsilon out-transition character

 * and both slots are free

 */

#define SUPER_FREE_EPSILON(state) \

	(transchar[state] == SYM_EPSILON && \

	 trans1[state] == NO_TRANSITION) \

/* Maximum number of NFA states that can comprise a DFA state.  It's real

 * big because if there's a lot of rules, the initial state will have a

 * huge epsilon closure.

 */

#define INITIAL_MAX_DFA_SIZE 750

#define MAX_DFA_SIZE_INCREMENT 750

/* A note on the following masks.  They are used to mark accepting numbers

 * as being special.  As such, they implicitly limit the number of accepting

 * numbers (i.e., rules) because if there are too many rules the rule numbers

 * will overload the mask bits.  Fortunately, this limit is \large/ (0x2000 ==

 * 8192) so unlikely to actually cause any problems.  A check is made in

 * new_rule() to ensure that this limit is not reached.

 */

/* Mask to mark a trailing context accepting number. */

#define YY_TRAILING_MASK 0x2000

/* Mask to mark the accepting number of the "head" of a trailing context

 * rule.

 */

#define YY_TRAILING_HEAD_MASK 0x4000

/* Maximum number of rules, as outlined in the above note. */

#define MAX_RULE (YY_TRAILING_MASK - 1)

/* NIL must be 0.  If not, its special meaning when making equivalence classes

 * (it marks the representative of a given e.c.) will be unidentifiable.

 */

#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 INFINITE_REPEAT -1		/* for x{5,} constructions */

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

#define MAX_CCLS_INCREMENT 100

/* Size of table holding members of character classes. */

#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 */

/* Maximum number of NFA states. */

#define MAXIMUM_MNS 31999

#define MAXIMUM_MNS_LONG 1999999999

/* Enough so that if it's subtracted from an NFA state number, the result

 * is guaranteed to be negative.

 */

#define MARKER_DIFFERENCE (maximum_mns+2)

/* Maximum number of nxt/chk pairs for non-templates. */

#define INITIAL_MAX_XPAIRS 2000

#define MAX_XPAIRS_INCREMENT 2000

/* Maximum number of nxt/chk pairs needed for templates. */

#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 */

/* The following percentages are used to tune table compression:

 * The percentage the number of out-transitions a state must be of the

 * number of equivalence classes in order to be considered for table

 * compaction by using protos.

 */

#define PROTO_SIZE_PERCENTAGE 15

/* The percentage the number of homogeneous out-transitions of a state

 * must be of the number of total out-transitions of the state in order

 * that the state's transition table is first compared with a potential

 * template of the most common out-transition instead of with the first

 * proto in the proto queue.

 */

#define CHECK_COM_PERCENTAGE 50

/* The percentage the number of differences between a state's transition

 * table and the proto it was first compared with must be of the total

 * number of out-transitions of the state in order to keep the first

 * proto as a good match and not search any further.

 */

#define FIRST_MATCH_DIFF_PERCENTAGE 10

/* The percentage the number of differences between a state's transition

 * table and the most similar proto must be of the state's total number

 * of out-transitions to use the proto as an acceptable close match.

 */

#define ACCEPTABLE_DIFF_PERCENTAGE 50

/* The percentage the number of homogeneous out-transitions of a state

 * must be of the number of total out-transitions of the state in order

 * to consider making a template from the state.

 */

#define TEMPLATE_SAME_PERCENTAGE 60

/* The percentage the number of differences between a state's transition

 * table and the most similar proto must be of the state's total number

 * of out-transitions to create a new proto from the state.

 */

#define NEW_PROTO_DIFF_PERCENTAGE 20

/* The percentage the total number of out-transitions of a state must be

 * of the number of equivalence classes in order to consider trying to

 * fit the transition table into "holes" inside the nxt/chk table.

 */

#define INTERIOR_FIT_PERCENTAGE 15

/* Size of region set aside to cache the complete transition table of

 * protos on the proto queue to enable quick comparisons.

 */

#define PROT_SAVE_SIZE 2000

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

/* Maximum number of out-transitions a state can have that we'll rummage

 * around through the interior of the internal fast table looking for a

 * spot for it.

 */

#define MAX_XTIONS_FULL_INTERIOR_FIT 4

/* Maximum number of rules which will be reported as being associated

 * with a DFA state.

 */

#define MAX_ASSOC_RULES 100

/* Number that, if used to subscript an array, has a good chance of producing

 * an error; should be small enough to fit into a short.

 */

#define BAD_SUBSCRIPT -32767

/* Absolute value of largest number that can be stored in a short, with a

 * bit of slop thrown in for general paranoia.

 */

#define MAX_SHORT 32700

/* Declarations for global variables. */

/* Variables for flags:

 * printstats - if true (-v), dump statistics

 * syntaxerror - true if a syntax error has been found

 * eofseen - true if we've seen an eof in the input file

 * ddebug - if true (-d), make a "debug" scanner

 * trace - if true (-T), trace processing

 * nowarn - if true (-w), do not generate warnings

 * spprdflt - if true (-s), suppress the default rule

 * interactive - if true (-I), generate an interactive scanner

 * lex_compat - if true (-l), maximize compatibility with AT&T lex

 * posix_compat - if true (-X), maximize compatibility with POSIX lex

 * do_yylineno - if true, generate code to maintain yylineno

 * useecs - if true (-Ce flag), use equivalence classes

 * fulltbl - if true (-Cf flag), don't compress the DFA state table

 * usemecs - if true (-Cm flag), use meta-equivalence classes

 * fullspd - if true (-F flag), use Jacobson method of table representation

 * gen_line_dirs - if true (i.e., no -L flag), generate #line directives

 * performance_report - if > 0 (i.e., -p flag), generate a report relating

 *   to scanner performance; if > 1 (-p -p), report on minor performance

 *   problems, too

 * backing_up_report - if true (i.e., -b flag), generate "lex.backup" file

 *   listing backing-up states

 * C_plus_plus - if true (i.e., -+ flag), generate a C++ scanner class;

 *   otherwise, a standard C scanner

 * reentrant - if true (-R), generate a reentrant C scanner.

 * bison_bridge_lval - if true (--bison-bridge), bison pure calling convention.

 * bison_bridge_lloc - if true (--bison-locations), bison yylloc.

 * long_align - if true (-Ca flag), favor long-word alignment.

 * use_read - if true (-f, -F, or -Cr) then use read() for scanner input;

 *   otherwise, use fread().

 * yytext_is_array - if true (i.e., %array directive), then declare

 *   yytext as a array instead of a character pointer.  Nice and inefficient.

 * do_yywrap - do yywrap() processing on EOF.  If false, EOF treated as

 *   "no more files".

 * csize - size of character set for the scanner we're generating;

 *   128 for 7-bit chars and 256 for 8-bit

 * yymore_used - if true, yymore() is used in input rules

 * reject - if true, generate back-up tables for REJECT macro

 * real_reject - if true, scanner really uses REJECT (as opposed to just

 *   having "reject" set for variable trailing context)

 * continued_action - true if this rule's action is to "fall through" to

 *   the next rule's action (i.e., the '|' action)

 * in_rule - true if we're inside an individual rule, false if not.

 * yymore_really_used - whether to treat yymore() as really used, regardless

 *   of what we think based on references to it in the user's actions.

 * reject_really_used - same for REJECT

 * trace_hex - use hexadecimal numbers in trace/debug outputs instead of octals

 */

extern int printstats, syntaxerror, eofseen, ddebug, trace, nowarn,

	spprdflt;

extern int interactive, lex_compat, posix_compat, do_yylineno;

extern int useecs, fulltbl, usemecs, fullspd;

extern int gen_line_dirs, performance_report, backing_up_report;

extern int reentrant, bison_bridge_lval, bison_bridge_lloc;

extern bool ansi_func_defs, ansi_func_protos;

extern int C_plus_plus, long_align, use_read, yytext_is_array, do_yywrap;

extern int csize;

extern int yymore_used, reject, real_reject, continued_action, in_rule;

extern int yymore_really_used, reject_really_used;

extern int trace_hex;

/* Variables used in the flex input routines:

 * datapos - characters on current output line

 * dataline - number of contiguous lines of data in current data

 * 	statement.  Used to generate readable -f output

 * linenum - current input line number

 * skelfile - the skeleton file

 * skel - compiled-in skeleton array

 * skel_ind - index into "skel" array, if skelfile is nil

 * yyin - input file

 * backing_up_file - file to summarize backing-up states to

 * infilename - name of input file

 * outfilename - name of output file

 * headerfilename - name of the .h file to generate

 * did_outfilename - whether outfilename was explicitly set

 * prefix - the prefix used for externally visible names ("yy" by default)

 * yyclass - yyFlexLexer subclass to use for YY_DECL

 * do_stdinit - whether to initialize yyin/yyout to stdin/stdout

 * use_stdout - the -t flag

 * input_files - array holding names of input files

 * num_input_files - size of input_files array

 * program_name - name with which program was invoked

 *

 * action_array - array to hold the rule actions

 * action_size - size of action_array

 * defs1_offset - index where the user's section 1 definitions start

 *	in action_array

 * prolog_offset - index where the prolog starts in action_array

 * action_offset - index where the non-prolog starts in action_array

 * action_index - index where the next action should go, with respect

 * 	to "action_array"

 */

extern int datapos, dataline, linenum;

extern FILE *skelfile, *backing_up_file;

extern const char *skel[];

extern int skel_ind;

extern char *infilename, *outfilename, *headerfilename;

extern int did_outfilename;

extern char *prefix, *yyclass, *extra_type;

extern int do_stdinit, use_stdout;

extern char **input_files;

extern int num_input_files;

extern char *program_name;

extern char *action_array;

extern int action_size;

extern int defs1_offset, prolog_offset, action_offset, action_index;

/* Variables for stack of states having only one out-transition:

 * onestate - state number

 * onesym - transition symbol

 * onenext - target state

 * onedef - default base entry

 * onesp - stack pointer

 */

extern int onestate[ONE_STACK_SIZE], onesym[ONE_STACK_SIZE];

extern int onenext[ONE_STACK_SIZE], onedef[ONE_STACK_SIZE], onesp;

/* Variables for nfa machine data:

 * maximum_mns - maximal number of NFA states supported by tables

 * current_mns - current maximum on number of NFA states

 * num_rules - number of the last accepting state; also is number of

 * 	rules created so far

 * num_eof_rules - number of <<EOF>> rules

 * default_rule - number of the default rule

 * current_max_rules - current maximum number of rules

 * lastnfa - last nfa state number created

 * firstst - physically the first state of a fragment

 * lastst - last physical state of fragment

 * finalst - last logical state of fragment

 * transchar - transition character

 * trans1 - transition state

 * trans2 - 2nd transition state for epsilons

 * accptnum - accepting number

 * assoc_rule - rule associated with this NFA state (or 0 if none)

 * state_type - a STATE_xxx type identifying whether the state is part

 * 	of a normal rule, the leading state in a trailing context

 * 	rule (i.e., the state which marks the transition from

 * 	recognizing the text-to-be-matched to the beginning of

 * 	the trailing context), or a subsequent state in a trailing

 * 	context rule

 * rule_type - a RULE_xxx type identifying whether this a ho-hum

 * 	normal rule or one which has variable head & trailing

 * 	context

 * rule_linenum - line number associated with rule

 * rule_useful - true if we've determined that the rule can be matched

 * rule_has_nl - true if rule could possibly match a newline

 * ccl_has_nl - true if current ccl could match a newline

 * nlch - default eol char

 */

extern int maximum_mns, current_mns, current_max_rules;

extern int num_rules, num_eof_rules, default_rule, lastnfa;

extern int *firstst, *lastst, *finalst, *transchar, *trans1, *trans2;

extern int *accptnum, *assoc_rule, *state_type;

extern int *rule_type, *rule_linenum, *rule_useful;

extern bool *rule_has_nl, *ccl_has_nl;

extern int nlch;

/* Different types of states; values are useful as masks, as well, for

 * routines like check_trailing_context().

 */

#define STATE_NORMAL 0x1

#define STATE_TRAILING_CONTEXT 0x2

/* Global holding current type of state we're making. */

extern int current_state_type;

/* Different types of rules. */

#define RULE_NORMAL 0

#define RULE_VARIABLE 1

/* True if the input rules include a rule with both variable-length head

 * and trailing context, false otherwise.

 */

extern int variable_trailing_context_rules;

/* Variables for protos:

 * numtemps - number of templates created

 * numprots - number of protos created

 * protprev - backlink to a more-recently used proto

 * protnext - forward link to a less-recently used proto

 * prottbl - base/def table entry for proto

 * protcomst - common state of proto

 * firstprot - number of the most recently used proto

 * lastprot - number of the least recently used proto

 * protsave contains the entire state array for protos

 */

extern int numtemps, numprots, protprev[MSP], protnext[MSP], prottbl[MSP];

extern int protcomst[MSP], firstprot, lastprot, protsave[PROT_SAVE_SIZE];

/* Variables for managing equivalence classes:

 * numecs - number of equivalence classes

 * nextecm - forward link of Equivalence Class members

 * ecgroup - class number or backward link of EC members

 * nummecs - number of meta-equivalence classes (used to compress

 *   templates)

 * tecfwd - forward link of meta-equivalence classes members

 * tecbck - backward link of MEC's

 */

/* Reserve enough room in the equivalence class arrays so that we

 * can use the CSIZE'th element to hold equivalence class information

 * for the NUL character.  Later we'll move this information into

 * the 0th element.

 */

extern int numecs, nextecm[CSIZE + 1], ecgroup[CSIZE + 1], nummecs;

/* Meta-equivalence classes are indexed starting at 1, so it's possible

 * that they will require positions from 1 .. CSIZE, i.e., CSIZE + 1

 * slots total (since the arrays are 0-based).  nextecm[] and ecgroup[]

 * don't require the extra position since they're indexed from 1 .. CSIZE - 1.

 */

extern int tecfwd[CSIZE + 1], tecbck[CSIZE + 1];

/* Variables for start conditions:

 * lastsc - last start condition created

 * current_max_scs - current limit on number of start conditions

 * scset - set of rules active in start condition

 * scbol - set of rules active only at the beginning of line in a s.c.

 * scxclu - true if start condition is exclusive

 * sceof - true if start condition has EOF rule

 * scname - start condition name

 */

extern int lastsc, *scset, *scbol, *scxclu, *sceof;

extern int current_max_scs;

extern char **scname;

/* Variables for dfa machine data:

 * current_max_dfa_size - current maximum number of NFA states in DFA

 * current_max_xpairs - current maximum number of non-template xtion pairs

 * current_max_template_xpairs - current maximum number of template pairs

 * current_max_dfas - current maximum number DFA states

 * lastdfa - last dfa state number created

 * nxt - state to enter upon reading character

 * chk - check value to see if "nxt" applies

 * tnxt - internal nxt table for templates

 * base - offset into "nxt" for given state

 * def - where to go if "chk" disallows "nxt" entry

 * nultrans - NUL transition for each state

 * NUL_ec - equivalence class of the NUL character

 * tblend - last "nxt/chk" table entry being used

 * firstfree - first empty entry in "nxt/chk" table

 * dss - nfa state set for each dfa

 * dfasiz - size of nfa state set for each dfa

 * dfaacc - accepting set for each dfa state (if using REJECT), or accepting

 *	number, if not

 * accsiz - size of accepting set for each dfa state

 * dhash - dfa state hash value

 * numas - number of DFA accepting states created; note that this

 *	is not necessarily the same value as num_rules, which is the analogous

 *	value for the NFA

 * numsnpairs - number of state/nextstate transition pairs

 * jambase - position in base/def where the default jam table starts

 * jamstate - state number corresponding to "jam" state

 * end_of_buffer_state - end-of-buffer dfa state number

 */

extern int current_max_dfa_size, current_max_xpairs;

extern int current_max_template_xpairs, current_max_dfas;

extern int lastdfa, *nxt, *chk, *tnxt;

extern int *base, *def, *nultrans, NUL_ec, tblend, firstfree, **dss,

	*dfasiz;

extern union dfaacc_union {

	int    *dfaacc_set;

	int     dfaacc_state;

}      *dfaacc;

extern int *accsiz, *dhash, numas;

extern int numsnpairs, jambase, jamstate;

extern int end_of_buffer_state;

/* Variables for ccl information:

 * lastccl - ccl index of the last created ccl

 * current_maxccls - current limit on the maximum number of unique ccl's

 * cclmap - maps a ccl index to its set pointer

 * ccllen - gives the length of a ccl

 * cclng - true for a given ccl if the ccl is negated

 * cclreuse - counts how many times a ccl is re-used

 * current_max_ccl_tbl_size - current limit on number of characters needed

 *	to represent the unique ccl's

 * ccltbl - holds the characters in each ccl - indexed by cclmap

 */

extern int lastccl, *cclmap, *ccllen, *cclng, cclreuse;

extern int current_maxccls, current_max_ccl_tbl_size;

extern unsigned char *ccltbl;

/* Variables for miscellaneous information:

 * nmstr - last NAME scanned by the scanner

 * sectnum - section number currently being parsed

 * nummt - number of empty nxt/chk table entries

 * hshcol - number of hash collisions detected by snstods

 * dfaeql - number of times a newly created dfa was equal to an old one

 * numeps - number of epsilon NFA states created

 * eps2 - number of epsilon states which have 2 out-transitions

 * num_reallocs - number of times it was necessary to realloc() a group

 *	  of arrays

 * tmpuses - number of DFA states that chain to templates

 * totnst - total number of NFA states used to make DFA states

 * peakpairs - peak number of transition pairs we had to store internally

 * numuniq - number of unique transitions

 * numdup - number of duplicate transitions

 * hshsave - number of hash collisions saved by checking number of states

 * num_backing_up - number of DFA states requiring backing up

 * bol_needed - whether scanner needs beginning-of-line recognition

 */

extern char nmstr[MAXLINE];

extern int sectnum, nummt, hshcol, dfaeql, numeps, eps2, num_reallocs;

extern int tmpuses, totnst, peakpairs, numuniq, numdup, hshsave;

extern int num_backing_up, bol_needed;

#ifndef HAVE_REALLOCARRAY

void *reallocarray(void *, size_t, size_t);

#endif

void   *allocate_array(int, size_t);

void   *reallocate_array(void *, int, size_t);

#define allocate_integer_array(size) \

	allocate_array(size, sizeof(int))

#define reallocate_integer_array(array,size) \

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

#define allocate_bool_array(size) \

	allocate_array(size, sizeof(bool))

#define reallocate_bool_array(array,size) \

	reallocate_array((void *) array, size, sizeof(bool))

#define allocate_int_ptr_array(size) \

	allocate_array(size, sizeof(int *))

#define allocate_char_ptr_array(size) \

	allocate_array(size, sizeof(char *))

#define allocate_dfaacc_union(size) \

	allocate_array(size, sizeof(union dfaacc_union))

#define reallocate_int_ptr_array(array,size) \

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

#define reallocate_char_ptr_array(array,size) \

	reallocate_array((void *) array, size, sizeof(char *))

#define reallocate_dfaacc_union(array, size) \

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

#define allocate_character_array(size) \

	allocate_array( size, sizeof(char))

#define reallocate_character_array(array,size) \

	reallocate_array((void *) array, size, sizeof(char))

#define allocate_Character_array(size) \

	allocate_array(size, sizeof(unsigned char))

#define reallocate_Character_array(array,size) \

	reallocate_array((void *) array, size, sizeof(unsigned char))

/* External functions that are cross-referenced among the flex source files. */

/* from file ccl.c */

extern void ccladd(int, int);	/* add a single character to a ccl */

extern int cclinit(void);	/* make an empty ccl */

extern void cclnegate(int);	/* negate a ccl */

extern int ccl_set_diff (int a, int b); /* set difference of two ccls. */

extern int ccl_set_union (int a, int b); /* set union of two ccls. */

/* List the members of a set of characters in CCL form. */

extern void list_character_set(FILE *, int[]);

/* from file dfa.c */

/* Check a DFA state for backing up. */

extern void check_for_backing_up(int, int[]);

/* Check to see if NFA state set constitutes "dangerous" trailing context. */

extern void check_trailing_context(int *, int, int *, int);

/* Construct the epsilon closure of a set of ndfa states. */

extern int *epsclosure(int *, int *, int[], int *, int *);

/* Increase the maximum number of dfas. */

extern void increase_max_dfas(void);

extern void ntod(void);	/* convert a ndfa to a dfa */

/* Converts a set of ndfa states into a dfa state. */

extern int snstods(int[], int, int[], int, int, int *);

/* from file ecs.c */

/* Convert character classes to set of equivalence classes. */

extern void ccl2ecl(void);

/* Associate equivalence class numbers with class members. */

extern int cre8ecs(int[], int[], int);

/* Update equivalence classes based on character class transitions. */

extern void mkeccl(unsigned char[], int, int[], int[], int, int);

/* Create equivalence class for single character. */

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

/* from file gen.c */

extern void do_indent(void);	/* indent to the current level */

/* Generate the code to keep backing-up information. */

extern void gen_backing_up(void);

/* Generate the code to perform the backing up. */

extern void gen_bu_action(void);

/* Generate full speed compressed transition table. */

extern void genctbl(void);

/* Generate the code to find the action number. */

extern void gen_find_action(void);

extern void genftbl(void);	/* generate full transition table */

/* Generate the code to find the next compressed-table state. */

extern void gen_next_compressed_state(char *);

/* Generate the code to find the next match. */

extern void gen_next_match(void);

/* Generate the code to find the next state. */

extern void gen_next_state(int);

/* Generate the code to make a NUL transition. */

extern void gen_NUL_trans(void);

/* Generate the code to find the start state. */

extern void gen_start_state(void);

/* Generate data statements for the transition tables. */

extern void gentabs(void);

/* Write out a formatted string at the current indentation level. */

extern void indent_put2s(const char *, const char *);

/* Write out a string + newline at the current indentation level. */

extern void indent_puts(const char *);

extern void make_tables(void);	/* generate transition tables */

/* from file main.c */

extern void check_options(void);

extern void flexend(int);

extern void usage(void);

/* from file misc.c */

/* Add a #define to the action file. */

extern void action_define(const char *defname, int value);

/* Add the given text to the stored actions. */

extern void add_action(const char *new_text);

/* True if a string is all lower case. */

extern int all_lower(char *);

/* True if a string is all upper case. */

extern int all_upper(char *);

/* Compare two integers for use by qsort. */

extern int intcmp(const void *, const void *);

/* Check a character to make sure it's in the expected range. */

extern void check_char(int c);

/* Replace upper-case letter to lower-case. */

extern unsigned char clower(int);

/* strdup() that fails fatally on allocation failures. */

extern char *xstrdup(const char *);

/* Compare two characters for use by qsort with '\0' sorting last. */

extern int cclcmp(const void *, const void *);

/* Finish up a block of data declarations. */

extern void dataend(void);

/* Flush generated data statements. */

extern void dataflush(void);

/* Report an error message and terminate. */

extern void flexerror(const char *);

/* Report a fatal error message and terminate. */

extern void flexfatal(const char *);

/* Report a fatal error with a pinpoint, and terminate */

#if HAVE_DECL___FUNC__

#define flex_die(msg) \

    do{ \

        fprintf (stderr,\

                _("%s: fatal internal error at %s:%d (%s): %s\n"),\

                program_name, __FILE__, (int)__LINE__,\

                __func__,msg);\

        FLEX_EXIT(1);\

    }while(0)

#else /* ! HAVE_DECL___FUNC__ */

#define flex_die(msg) \

    do{ \

        fprintf (stderr,\

                _("%s: fatal internal error at %s:%d %s\n"),\

                program_name, __FILE__, (int)__LINE__,\

                msg);\

        FLEX_EXIT(1);\

    }while(0)

#endif /* ! HAVE_DECL___func__ */

/* Convert a hexadecimal digit string to an integer value. */

extern int htoi(unsigned char[]);

/* Report an error message formatted  */

extern void lerr(const char *, ...)

#if defined(__GNUC__) && __GNUC__ >= 3

    __attribute__((__format__(__printf__, 1, 2)))

#endif

;

/* Like lerr, but also exit after displaying message. */

extern void lerr_fatal(const char *, ...)

#if defined(__GNUC__) && __GNUC__ >= 3

    __attribute__((__format__(__printf__, 1, 2)))

#endif

;

/* Spit out a "#line" statement. */

extern void line_directive_out(FILE *, int);

/* Mark the current position in the action array as the end of the section 1

 * user defs.

 */

extern void mark_defs1(void);

/* Mark the current position in the action array as the end of the prolog. */

extern void mark_prolog(void);

/* Generate a data statment for a two-dimensional array. */

extern void mk2data(int);

extern void mkdata(int);	/* generate a data statement */

/* Return the integer represented by a string of digits. */

extern int myctoi(const char *);