+
Point of view
All features
class DESCENDING_NON_TERMINAL
Summary
top
A non-terminal meant to be put in a PARSE_TABLE.
The only way to create a non-terminal is to use Liberty Eiffel's manifest notation.
The structure of this notation is: 
   {DESCENDING_NON_TERMINAL << rule, agent;
                               rule, agent;
                                 . . .
                               rule, agent
                            >>}
where each rule is a TRAVERSABLE[STRING] (with each String being the name of an atom of the PARSE_TABLE), and each agent may either be Void or a PROCEDURE[TUPLE] called when reducing the non-terminal.
Direct parents
Inherit list: PARSE_NON_TERMINAL
Overview
top
Creation features
Features
{ANY}
{PARSE_TABLE}
{PARSER_FACET}
{ANY}
{DESCENDING_NON_TERMINAL}
{}
{}
{ANY}
{PARSE_TABLE}
{}
{ANY}
{}
  • log: LOGGER
    There is one logger per concrete type; for performance reasons it is cached in each instance.
  • log_memory__0_: LOGGER
    The cached logger.
out_in_tagged_out_memory
effective procedure
{ANY}
top
require
    • locked: tagged_out_locked
      • locked: tagged_out_locked
      • locked: tagged_out_locked
ensure
  • still_locked: tagged_out_locked
  • not_cleared: tagged_out_memory.count >= old tagged_out_memory.count
  • append_only: old tagged_out_memory.twin.is_equal(tagged_out_memory.substring(1, old tagged_out_memory.count))
is_coherent: BOOLEAN
effective function
{ANY}
top
require
  • table /= Void
ensure
  • must_be_coherent: Result
pretty_print_on (stream: OUTPUT_STREAM)
effective procedure
{ANY}
top
require
  • stream.is_connected
set_default_tree_builders (non_terminal_builder: PROCEDURE[TUPLE 2[FIXED_STRING, TRAVERSABLE[FIXED_STRING]]], terminal_builder: PROCEDURE[TUPLE 2[FIXED_STRING, PARSER_IMAGE]])
effective procedure
{PARSE_TABLE}
top
require
  • is_coherent
effective function
{PARSER_FACET}
top
The Result is yes if the parsing succeeded, no if there was a syntax error, or maybe if the parse could complete with some more text.
require
  • context /= Void
ensure
  • context.actions.count >= old context.actions.count
  • not Result.is_equal(yes) implies context.buffer.current_index = old context.buffer.current_index and then context.actions.count = old context.actions.count
copy (other: DESCENDING_NON_TERMINAL)
effective procedure
{ANY}
top
require
    • not immutable
    • same_dynamic_type(other)
      • not immutable
      • same_dynamic_type(other)
      • not immutable
      • same_dynamic_type(other)
ensure
  • is_equal(other)
is_equal (other: DESCENDING_NON_TERMINAL): BOOLEAN
effective function
{ANY}
top
require
    • other /= Void
      • other /= Void
      • other /= Void
ensure
  • commutative: generating_type = other.generating_type implies Result = other.is_equal(Current)
add (rule: TRAVERSABLE[FIXED_STRING], action: PROCEDURE[TUPLE])
effective procedure
{ANY}
top
parser_tree: DESCENDING_NT_NODE
writable attribute
{DESCENDING_NON_TERMINAL}
top
tree_builder_path_used: FAST_ARRAY[FAST_ARRAY[FIXED_STRING]]
once function
{}
top
tree_builder_path_free: FAST_ARRAY[FAST_ARRAY[FIXED_STRING]]
once function
{}
top
tree_builder_path: FAST_ARRAY[FIXED_STRING]
writable attribute
{}
top
save_tree_builder_path
effective procedure
{}
top
ensure
restore_tree_builder_path
effective procedure
{}
top
require ensure
free_tree_builder_path: FAST_ARRAY[FIXED_STRING]
effective function
{}
top
ensure
  • Result.is_empty
manifest_make (needed_capacity: INTEGER_32)
effective procedure
{}
top
effective procedure
{}
top
require
  • rule /= Void
manifest_semicolon_check: INTEGER_32
is 2
constant attribute
{}
top
writable attribute
{ANY}
top
table: PARSE_TABLE[C_]
writable attribute
{ANY}
top
set (a_name: ABSTRACT_STRING, a_table: PARSE_TABLE[C_])
effective procedure
{PARSE_TABLE}
top
require
  • name = Void
  • table = Void
  • not a_name.is_empty
  • a_table /= Void
ensure
set_table (a_table: PARSE_TABLE[C_])
effective procedure
{PARSE_TABLE}
top
require
  • a_table /= Void
ensure
add_error_position (error: STRING, buffer: MINI_PARSER_BUFFER)
effective procedure
{}
top
print_error_position (o: OUTPUT_STREAM, buffer: MINI_PARSER_BUFFER)
effective procedure
{}
top
yes: TRISTATE
effective function
{ANY}
top
effective function
{ANY}
top
maybe: TRISTATE
effective function
{ANY}
top
log: LOGGER
effective function
{}
top
There is one logger per concrete type; for performance reasons it is cached in each instance.
ensure
  • Result /= Void
log_memory__0_: LOGGER
writable attribute
{}
top
The cached logger.
The ugly name is intentional. Don't use directly.