|
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: 5120 (0x1400)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Enum, seg_0497ce
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦5a81ac88f⟧ »Space Info Vol 1«
└─⟦this⟧
with Token_Pkg, Error, Lex, Bounded_String, String_Utilities;
use Token_Pkg;
package body Enum is
------------------------------------------------------------------------
-- <UNIT> Enum
------------------------------------------------------------------------
--
-- <DESCRIPTION> This package defines an operation for parsing the
-- grammatical expresssion : <enum>
--
-- <AUTHOR> Barthe Raphael, Beck Didier, Kempe Laurent
-- <VERSION> 1.0
-- <DATE> 16-Jan-95
-- <MODIFY> 16-Jan-95
--
-- <PKG USED> LEX, Token_Pkg, Error
--
------------------------------------------------------------------------
procedure Parse (Success : in out Boolean) is
------------------------------------------------------------------------
-- <SUBPROGRAM>
-- <UNIT> Parse
--
-- <DESCRIPTION> Try to parse <enum> and return if it was a success
-- or not.
--
-- <EXCEPTIONS> Nothing
--
------------------------------------------------------------------------
Ok : Boolean := True;
Tmp_String : String_Table.I_String;
begin
Liste := String_Table.Int_List.Create;
if Lex.Currenttoken_Is (T_Etre) then
Lex.Next;
if Lex.Currenttoken_Is (T_Ident) then
Bounded_String.Copy (Tmp_String,
String_Utilities.Upper_Case (Lex.Image));
String_Table.Int_List.Attach (Tmp_String, Liste);
Lex.Next;
while Lex.Currenttoken_Is (T_Ou) loop
Lex.Next;
if Lex.Currenttoken_Is (T_Ident) then
Bounded_String.Copy
(Tmp_String, String_Utilities.Upper_Case
(Lex.Image));
String_Table.Int_List.Attach (Tmp_String, Liste);
Lex.Next;
else
Success := False;
Error.Append;
end if;
end loop;
Liste := String_Table.Permute (Liste);
else
Success := False;
Error.Append;
end if;
if Lex.Currenttoken_Is (T_Fin) then
Lex.Next;
else
Success := False;
Error.Append;
end if;
else
Success := False;
Error.Append;
end if;
end Parse;
end Enum;
nblk1=4
nid=4
hdr6=6
[0x00] rec0=1f rec1=00 rec2=01 rec3=006
[0x01] rec0=14 rec1=00 rec2=03 rec3=024
[0x02] rec0=18 rec1=00 rec2=02 rec3=000
[0x03] rec0=16 rec1=00 rec2=04 rec3=000
tail 0x21546e2ae865e68aa34f9 0x42a00088462060003
Free Block Chain:
0x4: 0000 00 00 02 35 80 14 20 20 20 20 20 20 20 45 72 72 ┆ 5 Err┆