|
DataMuseum.dkPresents historical artifacts from the history of: Rational R1000/400 |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about Rational R1000/400 Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - download
Length: 7168 (0x1c00)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body More_List1, seg_037e7c, seg_038acb
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
with Block_Class;
with Bounded_String;
with Msg_Report;
with Object;
with Scanner;
with String_Utilities;
with Symbol_Table;
with Unparse_Report;
package body More_List1 is
procedure Bs_Copy (A_String : in out Scanner.B_String; A_Value : String)
renames Bounded_String.Copy;
function Bs_Image (A_String : Scanner.B_String) return String
renames Bounded_String.Image;
function Is_Equal_String
(Str1 : String; Str2 : String; Ignore_Case : Boolean := True)
return Boolean renames String_Utilities.Equal;
function Su_Capitalize (A_String : String) return String
renames String_Utilities.Capitalize;
type Node_Structure is
record
Info : Natural range 0 .. 1 := 0;
Mol1 : More_List1.Node := More_List1.Empty_Node;
Iden : Scanner.B_String;
Lign : Integer;
end record;
procedure Parse (N : in out Node; Error : out Boolean) is
Failed : Boolean := False;
begin
Msg_Report.Information ("I enter in more_list1's parse");
N := new Node_Structure;
N.Lign := Scanner.Line_Number;
Bs_Copy (N.Iden, Scanner.Value);
Scanner.Next;
if More_List1.Is_First (Scanner.Symbol) then
N.Info := 1;
More_List1.Parse (N.Mol1, Failed);
end if;
Msg_Report.Information ("I leave more_list1's parse with failed = " &
Boolean'Image (Failed));
Error := Failed;
end Parse;
procedure Unparse (N : Node) is
begin
Unparse_Report.Write (Su_Capitalize (Bs_Image (N.Iden)) & " ");
if N.Info = 1 then
More_List1.Unparse (N.Mol1);
end if;
end Unparse;
function Is_First (T : Scanner.Token) return Boolean is
use Scanner;
begin
return T = L_Identifier;
end Is_First;
function Interpret
(N : Node;
Inherited : Object.Reference := Object.Void_Reference;
A_Keyword_Mess : Message.Selector := Message.Void_Selector;
A_List : Arguments.List := Arguments.Void_Arguments)
return Object.Reference is
Result : Object.Reference := Object.Void_Reference;
Arg : Object.Reference;
Arg_List : Arguments.List;
Keyword_Mess, Msg : Message.Selector := Message.Void_Selector;
begin
Msg_Report.Information ("I enter in more_list1's interpret");
Msg_Report.Set_Line_Number (N.Lign);
Keyword_Mess := A_Keyword_Mess;
Message.Extract_Keyword (Keyword_Mess, Msg);
if Is_Equal_String (Message.Image (Msg), Block_Class.Evaluate_Msg) then
Arg_List := A_List;
Arguments.Read (Arg_List, Arg);
Symbol_Table.Insert (N.Iden, Arg);
else
Msg_Report.Interpret_Error
("Incorrect call parameter :" & Message.Image (Msg));
raise Incorrect_Call_Parameter;
end if;
if N.Info = 1 then
Result := More_List1.Interpret (N.Mol1,
A_Keyword_Mess => Keyword_Mess,
A_List => Arg_List);
end if;
Msg_Report.Information ("I leave more_list1's interpret with result :");
Msg_Report.Continue
("class = " & Object.Class'Image (Object.The_Class (Result)) &
" ident = " & Integer'Image (Object.Identificator (Result)));
return Object.Void_Reference;
end Interpret;
end More_List1;
nblk1=6
nid=6
hdr6=8
[0x00] rec0=22 rec1=00 rec2=01 rec3=048
[0x01] rec0=25 rec1=00 rec2=05 rec3=03c
[0x02] rec0=19 rec1=00 rec2=03 rec3=060
[0x03] rec0=19 rec1=00 rec2=02 rec3=000
[0x04] rec0=07 rec1=00 rec2=04 rec3=000
[0x05] rec0=42 rec1=61 rec2=3b rec3=1b6
tail 0x215313e1c84e647990864 0x42a00088462060003
Free Block Chain:
0x6: 0000 00 04 00 ea 80 2f 50 61 72 73 65 20 28 4e 20 3a ┆ /Parse (N :┆
0x4: 0000 00 00 00 b9 80 0f 61 73 73 20 28 52 65 73 75 6c ┆ ass (Resul┆