forgex_parameters_m Module


Uses


Variables

Type Visibility Attributes Name Initial
integer(kind=int32), public, parameter :: ACCEPTED_EMPTY = -2
integer(kind=int32), public, parameter :: ALLOC_COUNT_INITTIAL = 0

This constant is used as the initial value when the derived-type manages the number of allocations.
integer(kind=int32), public, parameter :: DFA_INITIAL_INDEX = 1

This cosntant is used to initialize the current top index of the array representing the DFA graph.
integer(kind=int32), public, parameter :: DFA_INIT_TRANSITION_TOP = 0

This constant is used to represent that the array of DFA transitions has been initialized.
integer(kind=int32), public, parameter :: DFA_INVALID_INDEX = 0

This constant is used for the purpose of determining invalid DFA index.
integer(kind=int32), public, parameter :: DFA_NOT_INIT = -1

This constant represents an uninitialized index of a DFA node.
integer(kind=int32), public, parameter :: DFA_NOT_INIT_TRAENSITION_TOP = -999

This constant is used to represent that the array of DFA transitions has not yet been initialized.
integer(kind=int32), public, parameter :: DFA_NULL_TRANSITION = -1

This constant represents the destinationless transition of a deterministic finite automaton (DFA) construction.
integer(kind=int32), public, parameter :: DFA_STATE_BASE = 0

Lower bound of the array represents an DFA.
integer(kind=int32), public, parameter :: DFA_STATE_HARD_LIMIT = DFA_STATE_LIMIT

If this limit is exceeded, program will do ERROR STOP. This hard limit is approximately on the order of gigabytes.
integer(kind=int32), public, parameter :: DFA_STATE_LIMIT = 1024*16+1

This constant is provided to define the upper limit of DFA nodes, but is currently only used to define DFA_STATE_HARD_LIMIT.
integer(kind=int32), public, parameter :: DFA_STATE_UNIT = 16

This constant defines the unit of reallocation for the array representing a DFA graph.
integer(kind=int32), public, parameter :: DFA_TRANSITION_BASE = 1

This constant defines the lower bound of the array that represents the DFA transitions.
integer(kind=int32), public, parameter :: DFA_TRANSITION_UNIT = 32

This constant defines the unit of additional allocation for DFA transitions.
character(len=1), public, parameter :: ESCAPE_D = 'd'
character(len=1), public, parameter :: ESCAPE_D_CAPITAL = 'D'
character(len=1), public, parameter :: ESCAPE_N = 'n'
character(len=1), public, parameter :: ESCAPE_R = 'r'
character(len=1), public, parameter :: ESCAPE_S = 's'
character(len=1), public, parameter :: ESCAPE_S_CAPITAL = 'S'
character(len=1), public, parameter :: ESCAPE_T = 't'
character(len=1), public, parameter :: ESCAPE_W = 'w'
character(len=1), public, parameter :: ESCAPE_W_CAPITAL = 'W'
integer(kind=int32), public, parameter :: INFINITE = -2
integer, public, parameter :: INVALID_CHAR_INDEX = -1
integer(kind=int32), public, parameter :: INVALID_INDEX = -1

This constant is used to indicate that the left and right destination have not yet been registered.
integer(kind=int32), public, parameter :: INVALID_REPEAT_VAL = -1
integer(kind=int32), public, parameter :: LIT_OPTS_INDEX_UNIT = 32
integer(kind=int32), public, parameter :: NFA_C_SIZE = 16

Upper limit of segments size of NFA transition instance
integer(kind=int32), public, parameter :: NFA_NULL_TRANSITION = -1

This constant represents the destinationless transition of an non-deterministic finite automaton (NFA) construction.
integer(kind=int32), public, parameter :: NFA_STATE_BASE = 1

Lower end of NFA state instance
integer(kind=int32), public, parameter :: NFA_STATE_LIMIT = 1024+1

Upper limit of NFA state nodes
integer(kind=int32), public, parameter :: NFA_STATE_UNIT = 16

This constant defines the unit of reallocation for the array representing a NFA graph.
integer(kind=int32), public, parameter :: NFA_TRANSITION_UNIT = 16

Upper limit of NFA transition instance
character(len=1), public, parameter :: SYMBOL_BSLH = '\'
character(len=1), public, parameter :: SYMBOL_CRET = '^'
character(len=1), public, parameter :: SYMBOL_DOLL = '$'
character(len=1), public, parameter :: SYMBOL_DOT = '.'
character(len=1), public, parameter :: SYMBOL_HYPN = '-'
character(len=1), public, parameter :: SYMBOL_LCRB = '{'
character(len=1), public, parameter :: SYMBOL_LPAR = '('
character(len=1), public, parameter :: SYMBOL_LSBK = '['
character(len=1), public, parameter :: SYMBOL_PLUS = '+'
character(len=1), public, parameter :: SYMBOL_QUES = '?'
character(len=1), public, parameter :: SYMBOL_RCRB = '}'
character(len=1), public, parameter :: SYMBOL_RPAR = ')'
character(len=1), public, parameter :: SYMBOL_RSBK = ']'
character(len=1), public, parameter :: SYMBOL_STAR = '*'
character(len=1), public, parameter :: SYMBOL_VBAR = '|'
integer(kind=int32), public, parameter :: TERMINAL_INDEX = 0

This constant is used to represent a terminal node in a syntax tree that has no destination nodes to the left or right.
integer(kind=int32), public, parameter :: TREE_NODE_BASE = 1

This constant defines the lower bound of the array that represents AST.
integer(kind=int32), public, parameter :: TREE_NODE_HARD_LIMIT = TREE_NODE_LIMIT

The maximum value that can be allocated to a syntax tree graph; exceeding this will cause ERROR STOP.
integer(kind=int32), public, parameter :: TREE_NODE_LIMIT = TREE_NODE_UNIT*64

The initial maximum size of nodes for building AST.
integer(kind=int32), public, parameter :: TREE_NODE_UNIT = 32

This constant defines the unit for adding nodes in the abstract syntax tree (AST). If it's too large it will cause a stack overflow.
integer(kind=int32), public, parameter :: UTF8_CHAR_SIZE = 4
integer(kind=int32), public, parameter :: UTF8_CODE_EMPTY = 0
integer(kind=int32), public, parameter :: UTF8_CODE_INVALID = -1
integer(kind=int32), public, parameter :: UTF8_CODE_MAX = 2**21-1
integer(kind=int32), public, parameter :: UTF8_CODE_MIN = 32
integer(kind=int32), public, parameter :: ZERO_C_TOP = 0