|
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: 6144 (0x1800)
Types: Ada Source
Notes: 03_class, FILE, R1k_Segment, e3_tag, package body Pnjs, seg_0497f5
└─⟦8527c1e9b⟧ Bits:30000544 8mm tape, Rational 1000, Arrival backup of disks in PAM's R1000
└─ ⟦cfc2e13cd⟧ »Space Info Vol 2«
└─⟦this⟧
with String_Table, Lex, Error, Token_Pkg, Attributs,
Bounded_String, String_Utilities, Struct_Component;
use Token_Pkg;
package body Pnjs is
------------------------------------------------------------------------
-- <UNIT> Pnjs
------------------------------------------------------------------------
--
-- <DESCRIPTION> This package defines an operation for parsing the
-- grammatical expresssion : <pnjs>
--
-- <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, String_table
--
------------------------------------------------------------------------
Index : Natural := 1;
procedure Parse (Success : in out Boolean) is
------------------------------------------------------------------------
-- <SUBPROGRAM>
-- <UNIT> Parse
--
-- <DESCRIPTION> Try to parse <pnjs> and return if it was a success
-- or not.
--
-- <EXCEPTIONS> Nothing
--
------------------------------------------------------------------------
Ok : Boolean := True;
Struct : Struct_Component.Structure;
Tmp_List : Struct_Component.Liste_Structure.List;
begin
Liste := Struct_Component.Liste_Structure.Create;
Tmp_List := Struct_Component.Liste_Structure.Create;
if Lex.Currenttoken_Is (T_Ident) then
while Lex.Currenttoken_Is (T_Ident) loop
Bounded_String.Copy (Struct.Name,
String_Utilities.Upper_Case (Lex.Image));
String_Table.Put (Table, Index, 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, Tmp_List);
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;
Index := Index + 1;
end loop;
else
Success := False;
Error.Append;
end if;
Pnj_Courant := Struct_Component.Liste_Structure.Makelistiter (Liste);
end Parse;
end Pnjs;
nblk1=5
nid=2
hdr6=6
[0x00] rec0=1b rec1=00 rec2=01 rec3=04a
[0x01] rec0=17 rec1=00 rec2=04 rec3=014
[0x02] rec0=1c rec1=00 rec2=03 rec3=000
[0x03] rec0=04 rec1=00 rec2=02 rec3=000
[0x04] rec0=c0 rec1=00 rec2=00 rec3=100
tail 0x2174de4d8865e68f83f45 0x42a00088462060003
Free Block Chain:
0x2: 0000 00 05 00 03 00 00 00 01 00 00 00 00 00 00 00 00 ┆ ┆
0x5: 0000 00 00 00 04 80 01 20 01 02 03 04 00 67 b0 48 e5 ┆ g H ┆