|
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: 5120 (0x1400)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Structures, seg_0497ff
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
with Lex, Error, Token_Pkg, Attributs, Struct_Component,
Bounded_String, String_Utilities;
use Token_Pkg;
package body Structures is
------------------------------------------------------------------------
-- <UNIT> Structures
------------------------------------------------------------------------
--
-- <DESCRIPTION> This package defines an operation for parsing the
-- grammatical expresssion : <structures>
--
-- <AUTHOR> Barthe Raphael, Beck Didier, Kempe Laurent
-- <VERSION> 1.0
-- <DATE> 16-Jan-95
-- <MODIFY> 16-Jan-95
--
-- <PKG USED> LEX, Token_Pkg, Error, Attributs
--
------------------------------------------------------------------------
procedure Parse (Success : in out Boolean) is
------------------------------------------------------------------------
-- <SUBPROGRAM>
-- <UNIT> Parse
--
-- <DESCRIPTION> Try to parse <structures> and return if it was a success
-- or not.
--
-- <EXCEPTIONS> Nothing
--
------------------------------------------------------------------------
Ok : Boolean := True;
Struct : Struct_Component.Structure;
begin
Liste := Struct_Component.Liste_Structure.Create;
if Lex.Currenttoken_Is (T_Ident) then
while Lex.Currenttoken_Is (T_Ident) loop
Struct := Struct_Component.Create;
Bounded_String.Copy (Struct.Name,
String_Utilities.Upper_Case (Lex.Image));
Lex.Next;
if Lex.Currenttoken_Is (T_Constitue) then
Lex.Next;
if Lex.Currenttoken_Is (T_De) then
Lex.Next;
Attributs.Parse (Ok);
Struct.Attribut := Attributs.Liste;
Struct_Component.Liste_Structure.Attach (Struct, Liste);
Success := Success and Ok;
if Lex.Currenttoken_Is (T_Fin) then
Lex.Next;
else
Success := False;
Error.Append;
end if;
else
Success := False;
Error.Append;
end if;
else
Success := False;
Error.Append;
end if;
end loop;
-- Liste := Struct_Component.Permute (Liste);
else
Success := False;
Error.Append;
end if;
end Parse;
end Structures;
nblk1=4
nid=4
hdr6=6
[0x00] rec0=1b rec1=00 rec2=01 rec3=090
[0x01] rec0=17 rec1=00 rec2=03 rec3=038
[0x02] rec0=19 rec1=00 rec2=02 rec3=000
[0x03] rec0=17 rec1=00 rec2=02 rec3=000
tail 0x2174de56c865e69416b8a 0x42a00088462060003
Free Block Chain:
0x4: 0000 00 00 00 0b 80 08 6f 20 70 61 72 73 65 20 08 20 ┆ o parse ┆