|
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 - metrics - download
Length: 7168 (0x1c00)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Monde, seg_04799b
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
with Lex, Token_Pkg, Directions, Pieces, Error, Text_Io, Actions,
Scenario, Structures, Objets, Pnjs, Struct_Component;
use Token_Pkg;
package body Monde is
------------------------------------------------------------------------
-- <UNIT> Monde
------------------------------------------------------------------------
--
-- <DESCRIPTION> This package defines an operation for parsing the
-- grammatical expresssion : <monde>
--
-- <AUTHOR> Barthe Raphael, Beck Didier, Kempe Laurent
-- <VERSION> 1.0
-- <DATE> 16-Jan-94
-- <MODIFY> 16-Jan-95
--
-- <PKG USED> LEX, Token_Pkg, Error, Directions, objets, pieces,
-- liens, pnjs, hero, Actions, Scenario
--
------------------------------------------------------------------------
procedure Parse (Success : in out Boolean) is
------------------------------------------------------------------------
-- <SUBPROGRAM>
-- <UNIT> Parse
--
-- <DESCRIPTION> Try to parse <monde> and return if it was a success
-- or not.
--
-- <EXCEPTIONS> Nothing
--
------------------------------------------------------------------------
Ok : Boolean := True;
begin
if Lex.Currenttoken_Is (T_Directions) then
Lex.Next;
Text_Io.Put_Line (" Directions ... ");
Directions.Parse (Ok);
Text_Io.Put_Line (" OK");
Success := Success and Ok;
else
Success := False;
Error.Append;
end if;
if Lex.Currenttoken_Is (T_Pieces) then
Lex.Next;
Text_Io.Put_Line (" Pieces ... ");
Pieces.Parse (Ok);
Text_Io.Put_Line (" OK");
Success := Success and Ok;
else
Success := False;
Error.Append;
end if;
if Lex.Currenttoken_Is (T_Pnjs) then
Lex.Next;
Text_Io.Put_Line (" Pnjs ...");
Pnjs.Parse (Ok);
Text_Io.Put_Line (" OK");
Success := Success and Ok;
end if;
if Lex.Currenttoken_Is (T_Hero) then
Lex.Next;
Structures.Parse (Ok);
Struct_Component.Liste_Structure.Attach
(Struct_Component.Liste_Structure.Firstvalue (Structures.Liste),
Pnjs.Liste);
Success := Success and Ok;
else
Success := False;
Error.Append;
end if;
if Lex.Currenttoken_Is (T_Objets) then
Lex.Next;
Text_Io.Put_Line (" Objets ... ");
Objets.Parse (Ok);
Text_Io.Put_Line (" OK");
Success := Success and Ok;
else
Success := False;
Error.Append;
end if;
if Lex.Currenttoken_Is (T_Liens) then
Lex.Next;
Text_Io.Put_Line (" Liens ...");
Structures.Parse (Ok);
Text_Io.Put_Line (" OK");
Liste_Lien := Struct_Component.Permute (Structures.Liste);
Success := Success and Ok;
else
Success := False;
Error.Append;
end if;
Table_Parsed := True;
if Lex.Currenttoken_Is (T_Actions) then
Lex.Next;
Actions.Parse (Ok);
Success := Success and Ok;
else
Success := False;
Error.Append;
end if;
if Lex.Currenttoken_Is (T_Scenario) then
Lex.Next;
Scenario.Parse (Ok);
Success := Success and Ok;
else
Success := False;
Error.Append;
end if;
end Parse;
end Monde;
nblk1=6
nid=3
hdr6=8
[0x00] rec0=1a rec1=00 rec2=01 rec3=016
[0x01] rec0=22 rec1=00 rec2=04 rec3=014
[0x02] rec0=1f rec1=00 rec2=06 rec3=02a
[0x03] rec0=22 rec1=00 rec2=05 rec3=000
[0x04] rec0=1a rec1=00 rec2=02 rec3=000
[0x05] rec0=1b rec1=00 rec2=03 rec3=001
tail 0x2174b304c865477ad977d 0x42a00088462060003
Free Block Chain:
0x3: 0000 00 02 03 fc 80 13 3c 55 4e 49 54 3e 20 20 20 20 ┆ <UNIT> ┆
0x2: 0000 00 00 00 26 80 16 74 6f 6b 65 6e 5f 49 73 20 28 ┆ & token_Is (┆