DataMuseum.dk

top - download

    Length: 1485 (0x5cd)
    Types: TextFile
    Names: »B«

└─⟦a7d1ea751⟧ Bits:30000550 8mm tape, Rational 1000, !users!projects 94_04_11
    └─ ⟦129cab021⟧ »DATA« 
        └─⟦this⟧ 

TextFile

with Lex;
with Object;
with List;
with Error_Broadcaster;
with Unparser;
package body Arguments is
    type Node_Structure is
        record
            Rule : Natural range 0 .. 1 := 0;
            Lst : List.Node := List.Empty_Node;
        end record;

    procedure Parse (N : in out Node; Error : out Boolean) is
        Failed : Boolean := False;

    begin
        N := new Node_Structure;
        case Lex.Get_Token is

            when Lex.Avec =>
                N.Rule := 1;
                Lex.Next_Token;
                List.Parse (N.Lst, Failed);
                if not Failed then
                    if Lex.Token'Pos (Lex.Get_Token) =
                       Lex.Token'Pos (Lex.Dot) then
                        Lex.Next_Token;
                    else
                        raise Error_Broadcaster.Dot_Is_Missing;
                    end if;
                end if;

            when others =>
                null;
        end case;
        Error := Failed;
    end Parse;

    procedure Unparse (N : in out Node) is
    begin
        case N.Rule is
            when 0 =>
                null;
            when 1 =>
                Unparser.Put ("avec ");
                List.Unparse (N.Lst);
                Unparser.Put (".");
                Unparser.Put_Line ("");
        end case;
    end Unparse;

    procedure Set (N : Node; The_Argument : in out Object.Parameters.List) is

    begin
        List.Set (N.Lst, The_Argument);
    end Set;


end Arguments;