Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
deferred class TERMINAL General cluster: parse description: "Constructs to be parsed by lexical analysis classes" Ancestors CONSTRUCT* Queries arity: INTEGER_32 at alias "@" (i: INTEGER_32): [like child_item] detachable CONSTRUCT binary_representation: BINARY_TREE [detachable CONSTRUCT] changeable_comparison_criterion: BOOLEAN child: [like first_child] detachable CONSTRUCT child_after: BOOLEAN child_before: BOOLEAN child_capacity: INTEGER_32 child_cursor: CONSTRUCT_CURSOR child_extendible: BOOLEAN child_index: INTEGER_32 child_isfirst: BOOLEAN child_islast: BOOLEAN child_item: detachable CONSTRUCT child_off: BOOLEAN child_readable: BOOLEAN child_writable: BOOLEAN committed: BOOLEAN construct_name: STRING_8 count: INTEGER_32 Document: INPUT exhausted: BOOLEAN Extendible: BOOLEAN first: [like child_item] detachable CONSTRUCT first_child: [like parent] detachable CONSTRUCT for_all (test: FUNCTION [detachable CONSTRUCT, BOOLEAN]): BOOLEAN has (v: detachable CONSTRUCT): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like child_item] detachable CONSTRUCT index_of (v: [like child_item] detachable CONSTRUCT; i: INTEGER_32): INTEGER_32 is_empty: BOOLEAN is_equal (other: [like Current] TERMINAL): BOOLEAN is_inserted (v: detachable CONSTRUCT): BOOLEAN is_leaf: BOOLEAN is_optional: BOOLEAN is_root: BOOLEAN is_sibling (other: [attached like parent] attached CONSTRUCT): BOOLEAN item: detachable CONSTRUCT item_for_iteration: detachable CONSTRUCT last: [like child_item] detachable CONSTRUCT last_child: [like parent] detachable CONSTRUCT Left_recursion: BOOLEAN left_sibling: [detachable like Current] detachable TERMINAL linear_representation: LINEAR [detachable CONSTRUCT] Lower: INTEGER_32 new_cursor: TWO_WAY_TREE_ITERATION_CURSOR [detachable CONSTRUCT] node_is_equal (other: [like Current] TERMINAL): BOOLEAN object_comparison: BOOLEAN occurrences (v: [like child_item] detachable CONSTRUCT): INTEGER_32 parent: detachable CONSTRUCT parsed: BOOLEAN Print_mode: CELL [BOOLEAN] Production: LINKED_LIST [CONSTRUCT] prunable: BOOLEAN Readable: BOOLEAN readable_child: BOOLEAN replaceable: BOOLEAN right_sibling: [detachable like Current] detachable TERMINAL sequential_has (v: [like child_item] detachable CONSTRUCT): BOOLEAN sequential_index_of (v: [like child_item] detachable CONSTRUCT; i: INTEGER_32): INTEGER_32 sequential_occurrences (v: [like child_item] detachable CONSTRUCT): INTEGER_32 sublist: [detachable like Current] detachable TERMINAL there_exists (test: FUNCTION [detachable CONSTRUCT, BOOLEAN]): BOOLEAN token: detachable TOKEN token_type: INTEGER_32 Twl_full: BOOLEAN twl_has (v: [like child_item] detachable CONSTRUCT): BOOLEAN twl_new_cursor: TWO_WAY_LIST_ITERATION_CURSOR [detachable CONSTRUCT] valid_cursor (p: CURSOR): BOOLEAN valid_cursor_index (i: INTEGER_32): BOOLEAN valid_index (i: INTEGER_32): BOOLEAN Writable: BOOLEAN writable_child: BOOLEAN Commands action append (s: SEQUENCE [detachable CONSTRUCT]) chain_wipe_out child_back child_extend (v: [like child_item] detachable CONSTRUCT) child_finish child_forth child_go_i_th (i: INTEGER_32) child_go_to (p: CURSOR) child_put (v: [like child_item] detachable CONSTRUCT) child_put_left (v: [like child_item] detachable CONSTRUCT) child_put_right (v: [like child_item] detachable CONSTRUCT) child_replace (v: [like child_item] detachable CONSTRUCT) child_start commit compare_objects compare_references copy (other: [like Current] TERMINAL) do_all (action: PROCEDURE [detachable CONSTRUCT]) do_if (action: PROCEDURE [detachable CONSTRUCT]; test: FUNCTION [detachable CONSTRUCT, BOOLEAN]) extend (v: [like item] detachable CONSTRUCT) fill_from_binary (b: BINARY_TREE [detachable CONSTRUCT]) force (v: [like child_item] detachable CONSTRUCT) forget_left forget_right ll_merge_right (other: [like Current] TERMINAL) ll_move (i: INTEGER_32) ll_put_front (v: [like child_item] detachable CONSTRUCT) ll_put_right (v: [like child_item] detachable CONSTRUCT) ll_wipe_out make merge_tree_after (other: [like new_cell] CONSTRUCT) merge_tree_before (other: [like new_cell] CONSTRUCT) move (i: INTEGER_32) parse print_name process prune (n: [like new_cell] CONSTRUCT) prune_all (v: [like child_item] detachable CONSTRUCT) put_child (n: [like new_cell] CONSTRUCT) put_child_left (n: [like new_cell] CONSTRUCT) put_child_right (n: [like new_cell] CONSTRUCT) put_front (v: [like child_item] detachable CONSTRUCT) put_i_th (v: [like child_item] detachable CONSTRUCT; i: INTEGER_32) remove_child remove_i_th (i: INTEGER_32) remove_left_child remove_right_child remove_sublist replace (v: [like item] detachable CONSTRUCT) replace_child (n: [like new_cell] CONSTRUCT) search_child (v: [like child_item] detachable CONSTRUCT) semantics sequence_put (v: [like child_item] detachable CONSTRUCT) set_optional split (n: INTEGER_32) sprout swap (i: INTEGER_32) twl_fill (other: CONTAINER [detachable CONSTRUCT]) twl_merge_left (other: CONSTRUCT) twl_merge_right (other: CONSTRUCT) twl_prune (v: [like child_item] detachable CONSTRUCT) twt_put (v: [like item] detachable CONSTRUCT) unused_pre_action wipe_out
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

-- Generated by Eiffel Studio --
For more details: eiffel.org