|
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: 9216 (0x2400)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Liste_Mots_Voca, seg_047e68
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
with Error, Un_Mot_Du_Voca, Dynamic_Value;
package body Liste_Mots_Voca is
procedure Create_Null_Complement
(Dyn_Node_Complement : in out Dynamic_Node.Object) is
Dyn_Val_Default : Dynamic_Value.Object;
Dyn_Node_Default : Dynamic_Node.Object;
begin
Dynamic_Value.Set_Value (Dyn_Val_Default, "", Dynamic_Value.Voca_Value);
Dynamic_Node.Create_Value (Dyn_Node_Default);
Dynamic_Node.Set_Value (Dyn_Node_Default, Dyn_Val_Default);
Dynamic_Node.Create_Unary_Operator
(Dyn_Node_Complement, Dynamic_Node.Complement);
Dynamic_Node.Set_Argument (Dyn_Node_Complement, Dyn_Node_Default);
end Create_Null_Complement;
--c'est en fait une liste de complement
procedure Parse (Dyn_Node : in out Dynamic_Node.Object) is
use Lexical_Analyzer;
Dyn_Node_Complement1, Dyn_Node_Complement2 : Dynamic_Node.Object;
begin
if (Liste_Mots_Voca.Is_First (Lexical_Analyzer.Get_Token)) then
Dynamic_Node.Create_Ternary_Operator
(Dyn_Node, Dynamic_Node.Sentence);
Un_Mot_Du_Voca.Parse (Dyn_Node_Complement1);
if Dynamic_Node.Get_Operator (Dyn_Node_Complement1) /=
"COMPLEMENT" then
Error.Set_Type_Error (Error.Complement_Was_Expected_Before);
raise Error.Excep_Semantic_Error;
end if;
if Dynamic_Value.Get_Value
(Dynamic_Node.Get_Value
(Dynamic_Node.Get_Argument (Dyn_Node_Complement1))) =
"complement2" then
Error.Set_Type_Error
(Error.Complement2_Should_Be_In_Second_Place_After_Verb);
raise Error.Excep_Semantic_Error;
end if;
Dynamic_Node.Set_Argument (Dyn_Node, Dyn_Node_Complement1,
Dynamic_Node.Cplt1_Position);
--creation d'un complement 2 contenant la chaine null par defaut
Create_Null_Complement (Dyn_Node_Complement2);
Dynamic_Node.Set_Argument (Dyn_Node, Dyn_Node_Complement2,
Dynamic_Node.Cplt2_Position);
if (Un_Mot_Du_Voca.Is_First (Lexical_Analyzer.Get_Token)) then
Dynamic_Node.Disconnect (Dyn_Node_Complement2);
Un_Mot_Du_Voca.Parse (Dyn_Node_Complement2);
if Dynamic_Node.Get_Operator (Dyn_Node_Complement2) /=
"COMPLEMENT" then
Error.Set_Type_Error (Error.Complement_Expected);
raise Error.Excep_Semantic_Error;
end if;
if Dynamic_Value.Get_Value
(Dynamic_Node.Get_Value
(Dynamic_Node.Get_Argument (Dyn_Node_Complement2))) =
"complement1" then
Error.Set_Type_Error
(Error.Complement1_Should_Be_In_First_Place_After_Verb);
raise Error.Excep_Semantic_Error;
end if;
Dynamic_Node.Set_Argument (Dyn_Node, Dyn_Node_Complement2,
Dynamic_Node.Cplt2_Position);
end if;
end if;
end Parse;
function Is_First (Un_Token : Lexical_Analyzer.Tokens) return Boolean is
use Lexical_Analyzer;
begin
return ((Un_Token = Complement_Or_Verbe) or
(Un_Token = Complement1) or (Un_Token = Complement2));
end Is_First;
function Is_Follow (Un_Token : Lexical_Analyzer.Tokens) return Boolean is
use Lexical_Analyzer;
begin
return ((Un_Token = Right_Bracket) or
(Un_Token = Terminator) or (Un_Token = Alors));
end Is_Follow;
end Liste_Mots_Voca;
nblk1=8
nid=3
hdr6=a
[0x00] rec0=1e rec1=00 rec2=01 rec3=026
[0x01] rec0=15 rec1=00 rec2=05 rec3=000
[0x02] rec0=03 rec1=00 rec2=08 rec3=04a
[0x03] rec0=16 rec1=00 rec2=02 rec3=008
[0x04] rec0=17 rec1=00 rec2=07 rec3=000
[0x05] rec0=18 rec1=00 rec2=02 rec3=000
[0x06] rec0=5b rec1=2c rec2=00 rec3=026
[0x07] rec0=08 rec1=60 rec2=48 rec3=359
tail 0x21544f7d4865779f20b4a 0x42a00088462060003
Free Block Chain:
0x3: 0000 00 04 00 2b 80 18 31 2c 20 44 79 6e 5f 4e 6f 64 ┆ + 1, Dyn_Nod┆
0x4: 0000 00 06 00 09 80 06 74 31 5f 53 6f 75 06 72 2e 09 ┆ t1_Sou r. ┆
0x6: 0000 00 00 03 fc 80 38 20 20 20 20 20 20 20 20 20 44 ┆ 8 D┆