home
classes/clusters list
class information
+
Point of view
TYPED_INTERNALS
ANY
PARSE_NON_TERMINAL
PARSE_NT_NODE
ESE_PARSER
PARSE_TABLE
TYPED_INTERNALS
INTERNALS_HANDLER
All features
class PARSE_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 SmartEiffel's manifest notation.
The structure of this notation is:
{
PARSE_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_ATOM
Overview
top
creation features
exported features
is_coherent
:
BOOLEAN
set_default_tree_builders
(non_terminal_builder:
PROCEDURE
[
TUPLE 2
[
STRING
,
TRAVERSABLE
[
STRING
]]], terminal_builder:
PROCEDURE
[
TUPLE 2
[
STRING
,
PARSER_IMAGE
]])
parse
(buffer:
MINI_PARSER_BUFFER
, actions:
COLLECTION
[
TUPLE 2
[
STRING
,
PROCEDURE
[
TUPLE
]]]):
STRING
The Result is an error message which is Void if the parse succeeded.
copy
(other: PARSE_NON_TERMINAL)
Update current object using fields of object attached to
other
, so as to yield equal objects.
is_equal
(other: PARSE_NON_TERMINAL):
BOOLEAN
Is
other
attached to an object considered equal to current object?
add
(rule:
TRAVERSABLE
[
STRING
], action:
PROCEDURE
[
TUPLE
])
parser_tree
:
PARSE_NT_NODE
default_tree_builder_path
:
FAST_ARRAY
[
STRING
]
manifest_make
(needed_capacity:
INTEGER_32
)
manifest_put
(index:
INTEGER_32
, rule:
TRAVERSABLE
[
STRING
], action:
PROCEDURE
[
TUPLE 2
[
STRING
,
TRAVERSABLE
[
STRING
]]])
manifest_semicolon_check
:
INTEGER_32
name
:
STRING
table
:
PARSE_TABLE
set
(a_name:
STRING
, a_table:
PARSE_TABLE
)
set_table
(a_table:
PARSE_TABLE
)
add_error_position
(error:
STRING
, buffer:
MINI_PARSER_BUFFER
)
print_error_position
(o:
OUTPUT_STREAM
, buffer:
MINI_PARSER_BUFFER
)
is_coherent
:
BOOLEAN
effective function
top
ensure
must_be_coherent:
Result
set_default_tree_builders
(non_terminal_builder:
PROCEDURE
[
TUPLE 2
[
STRING
,
TRAVERSABLE
[
STRING
]]], terminal_builder:
PROCEDURE
[
TUPLE 2
[
STRING
,
PARSER_IMAGE
]])
effective procedure
top
require
is_coherent
parse
(buffer:
MINI_PARSER_BUFFER
, actions:
COLLECTION
[
TUPLE 2
[
STRING
,
PROCEDURE
[
TUPLE
]]]):
STRING
effective function
top
The Result is an error message which is Void if the parse succeeded.
require
actions /= Void
ensure
actions.count >= old actions.count
Result /= Void implies buffer.current_index = old buffer.current_index and then actions.count = old actions.count
copy
(other: PARSE_NON_TERMINAL)
effective procedure
top
Update current object using fields of object attached to
other
, so as to yield equal objects.
Note: you can't copy object from a different dynamic type.
require
same_dynamic_type(other)
ensure
is_equal(other)
is_equal
(other: PARSE_NON_TERMINAL):
BOOLEAN
effective function
top
Is
other
attached to an object considered equal to current object?
require
other /= Void
ensure
commutative:
generating_type = other.generating_type implies Result = other.is_equal(Current)
add
(rule:
TRAVERSABLE
[
STRING
], action:
PROCEDURE
[
TUPLE
])
effective procedure
top
require
rule /= Void
parser_tree
:
PARSE_NT_NODE
writable attribute
top
default_tree_builder_path
:
FAST_ARRAY
[
STRING
]
once function
top
manifest_make
(needed_capacity:
INTEGER_32
)
effective procedure
top
manifest_put
(index:
INTEGER_32
, rule:
TRAVERSABLE
[
STRING
], action:
PROCEDURE
[
TUPLE 2
[
STRING
,
TRAVERSABLE
[
STRING
]]])
effective procedure
top
require
rule /= Void
manifest_semicolon_check
:
INTEGER_32
constant attribute
top
name
:
STRING
writable attribute
top
table
:
PARSE_TABLE
writable attribute
top
set
(a_name:
STRING
, a_table:
PARSE_TABLE
)
effective procedure
top
require
not a_name.is_empty
a_table /= Void
ensure
name
= a_name
table
= a_table
set_table
(a_table:
PARSE_TABLE
)
effective procedure
top
require
a_table /= Void
ensure
table
= a_table
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
{PARSE_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.