forgex_syntax_tree_graph_m Module


Uses


Derived Types

type, public ::  tree_t

This derived-type contains all node of syntax-tree in the tree_node_t type array nodes.

Components

Type Visibility Attributes Name Initial
integer, public :: code = SYNTAX_VALID
logical, public :: is_valid = .true.
type(tree_node_t), public, allocatable :: nodes(:)
integer, public :: num_alloc = 0
integer, public :: paren_balance
type(tape_t), public :: tape
integer, public :: top = INVALID_INDEX

Type-Bound Procedures

procedure, public :: build => tree_graph__build_syntax_tree
procedure, public :: caret_dollar => tree_graph__make_tree_caret_dollar
procedure, public :: char_class => tree_graph__char_class
procedure, public :: connect_left => tree_graph__connect_left
procedure, public :: connect_right => tree_graph__connect_right
procedure, public :: crlf => tree_graph__make_tree_crlf
procedure, public :: deallocate => tree_graph__deallocate
procedure, public :: get_top => tree_graph__get_top
procedure, public :: hex2cp => tree_graph__hexadecimal_to_codepoint
procedure, public :: hex2seg => tree_graph__hexadecimal_to_segment
procedure, public :: primary => tree_graph__primary
procedure, public :: print => print_tree_wrap
procedure, public :: property => tree_graph__unicode_property
procedure, public :: reallocate => tree_graph__reallocate
procedure, public :: regex => tree_graph__regex
procedure, public :: register => tree_graph__register_node
procedure, public :: register_connector => tree_graph__register_connector
procedure, public :: shorthand => tree_graph__shorthand
procedure, public :: suffix_op => tree_graph__suffix_op
procedure, public :: term => tree_graph__term
procedure, public :: times => tree_graph__times

Functions

private function print_class_simplify(tree, root_i) result(str)

Arguments

Type IntentOptional Attributes Name
type(tree_node_t), intent(in) :: tree(:)
integer(kind=int32) :: root_i

Return Value character(len=:), allocatable

private pure function tree_graph__get_top(self) result(node)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(in) :: self

Return Value type(tree_node_t)


Subroutines

public subroutine dump_tree_table(tree)

Arguments

Type IntentOptional Attributes Name
class(tree_node_t), intent(in) :: tree(:)

public pure subroutine interpret_class_string(str, cube, is_valid, ierr)

This subroutine parses a pattern string and outputs a list of segment_t type.

Arguments

Type IntentOptional Attributes Name
character(len=*), intent(in) :: str
type(cube_t), intent(inout) :: cube
logical, intent(inout) :: is_valid
integer, intent(inout) :: ierr

private pure subroutine convert_escaped_character_into_segments(chara, seg_list)

This subroutine converts escaped character of the argument chara into segment seg_list.

Arguments

Type IntentOptional Attributes Name
character(len=*), intent(in) :: chara
type(segment_t), intent(inout), allocatable :: seg_list(:)

private recursive subroutine print_tree_internal(tree, node_i, uni)

Arguments

Type IntentOptional Attributes Name
type(tree_node_t), intent(in) :: tree(:)
integer, intent(in) :: node_i
integer, intent(in) :: uni

private subroutine print_tree_wrap(self, uni)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(in) :: self
integer, intent(in) :: uni

private pure subroutine tree_graph__build_syntax_tree(self, pattern)

This procedure builds an AST corresponding to a given (regular expression) pattern from it.

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self
character(len=*), intent(in) :: pattern

private pure subroutine tree_graph__char_class(self)

This subroutine treats character class expression, and does not call any other recursive procedures.

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure subroutine tree_graph__connect_left(self, parent, child)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self
integer, intent(in) :: parent
integer, intent(in) :: child

private pure subroutine tree_graph__connect_right(self, parent, child)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self
integer, intent(in) :: parent
integer, intent(in) :: child

private pure subroutine tree_graph__deallocate(self)

This procedure deallocates nodes of tree_t

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure subroutine tree_graph__hexadecimal_to_codepoint(self, cp)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self
integer(kind=int32), intent(inout) :: cp

private pure subroutine tree_graph__hexadecimal_to_segment(self, seglist)

This procedure handles a escape sequence with '\x'.

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self
type(segment_t), intent(inout), allocatable :: seglist(:)

private pure subroutine tree_graph__make_tree_caret_dollar(self)

This function constructs a tree node for carriage return (CR) and line feed (LF) characters.

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure subroutine tree_graph__make_tree_crlf(self)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure recursive subroutine tree_graph__primary(self)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure subroutine tree_graph__reallocate(self)

This procedure handles the reallcation of the tree_node_t type array within the component of the tree_t object. However, it is not be used in v4.2.

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure recursive subroutine tree_graph__regex(self)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure subroutine tree_graph__register_connector(self, node, left, right)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self
type(tree_node_t), intent(inout) :: node
type(tree_node_t), intent(in) :: left
type(tree_node_t), intent(in) :: right

private pure subroutine tree_graph__register_node(self, node)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self
type(tree_node_t), intent(inout) :: node

private pure subroutine tree_graph__shorthand(self)

This function handles shorthand escape sequences (\t, \n, \r, \d, \D, \w, \W, \s, \S). It does not call any other recursive procedures.

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure recursive subroutine tree_graph__suffix_op(self)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure recursive subroutine tree_graph__term(self)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure subroutine tree_graph__times(self)

This subroutine handles a quantifier range, and does not call any other recursive procedures.

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self

private pure subroutine tree_graph__unicode_property(self, seglist)

Arguments

Type IntentOptional Attributes Name
class(tree_t), intent(inout) :: self
type(segment_t), intent(inout), allocatable :: seglist(:)