xia-1.00/0040755000076600007670000000000010212335306011074 5ustar g315padadevxia-1.00/xpath.g0100666000076600007670000002134610212334133012374 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ token_macros DIGIT [0-9] INTEGER ({DIGIT}{DIGIT}*\.?) DECIMAL_LITERAL ({DIGIT}*\.{DIGIT}+) DQ_LITERAL (\"[^\"]*\") SQ_LITERAL (\'[^\']*\') LETTER ([a-zA-Z]) NCNAMECHAR ({LETTER}|{DIGIT}|[\.\-_]) NCNAME (({LETTER}|_)({NCNAMECHAR})*) tokens -- Reserved Words ANCESTOR ancestor ANCESTOR_OR_SELF ancestor-or-self ATTRIBUTE attribute CHILD child DESCENDANT descendant DESCENDANT_OR_SELF descendant-or-self FOLLOWING following FOLLOWING_SIBLING following-sibling NAMESPACE namespace PARENT parent PRECEDING preceding PRECEDING_SIBLING preceding-sibling SELF self COMMENT comment TEXT text PROCESSING_INSTRUCTION processing-instruction NODE node AND and DIV div MOD mod OR or -- Delimiters L_PAREN "(" R_PAREN ")" L_BRACKET "[" R_BRACKET "]" STAR "*" PLUS "+" MINUS "-" DOT "." DOUBLE_DOT ".." SLASH "/" DOUBLE_SLASH "//" COLON ":" DOUBLE_COLON "::" AT_SIGN "@" COMMA "," DOLLAR "$" V_BAR "|" EQ "=" NE "!=" GT ">" GE ">=" LT "<" LE "<=" -- Literals SQ_LITERAL {SQ_LITERAL} DQ_LITERAL {DQ_LITERAL} INTEGER {INTEGER} DECIMAL_LITERAL {DECIMAL_LITERAL} NCNAME {NCNAME} --Some code removed here related to dealing with situations like x'a'b that make --dealing with one character literals a little harder -- Whitespace and Comments --Must be "ignore", special connotations for ADAGoop --ignore [\ \t\r\n]* global_methods Pathify --XPath grammar goes here grammar %start Location_Path Location_Path : Relative_Location_Path | Absolute_Location_Path ; Absolute_Location_Path : SLASH | SLASH Relative_Location_Path | Abbreviated_Absolute_Location_Path ; Relative_Location_Path : Step | Relative_Location_Path SLASH Step | Abbreviated_Relative_Location_Path ; Step : Step_Base Predicates | Abbreviated_Step ; Predicates : | Predicates Predicate ; Step_Base : Axis_Specifier Node_Test | Abbreviated_Step_Base ; Abbreviated_Step_Base : Node_Test | AT_SIGN Node_Test ; Predicate : L_BRACKET Predicate_Expr R_BRACKET ; Axis_Specifier : Axis_Name DOUBLE_COLON ; Axis_Name : ANCESTOR | ANCESTOR_OR_SELF | ATTRIBUTE | CHILD | DESCENDANT | DESCENDANT_OR_SELF | FOLLOWING | FOLLOWING_SIBLING | NAMESPACE | PARENT | PRECEDING | PRECEDING_SIBLING | SELF ; Node_Test : Name_Test | Node_Type L_PAREN R_PAREN | PROCESSING_INSTRUCTION L_PAREN LITERAL R_PAREN ; Node_Type : COMMENT | TEXT | PROCESSING_INSTRUCTION | NODE ; Name_Test : STAR | QName | NCNAME_Or_ID COLON STAR ; QName : NCNAME_Or_ID | NCNAME_Or_ID COLON NCNAME_Or_ID ; NCNAME_Or_ID : NCNAME | Axis_Name | Node_Type | AND | OR | MOD | DIV ; Predicate_Expr : Expr ; Abbreviated_Absolute_Location_Path : DOUBLE_SLASH Relative_Location_Path ; Abbreviated_Relative_Location_Path : Relative_Location_Path DOUBLE_SLASH Step ; Abbreviated_Step : DOT | DOUBLE_DOT ; Expr : Or_Expr ; Primary_Expr : Variable_Reference | L_PAREN Expr R_PAREN | LITERAL | Number | Function_Call ; Variable_Reference : DOLLAR QName ; Function_Call : Function_Name L_PAREN Arguments R_PAREN ; Arguments : | Argument | Arguments COMMA Argument ; Argument : Expr ; Function_Name : QName ; Union_Expr : Path_Expr | Union_Expr V_BAR Path_Expr ; Path_Expr : Location_Path | Filter_Expr | Filter_Expr SLASH Relative_Location_Path | Filter_Expr DOUBLE_SLASH Relative_Location_Path ; Filter_Expr : Primary_Expr | Filter_Expr Predicate ; Or_Expr : And_Expr | Or_Expr OR And_Expr ; And_Expr : Equality_Expr | And_Expr AND Equality_Expr ; Equality_Expr : Relational_Expr | Equality_Expr EQ Relational_Expr | Equality_Expr NE Relational_Expr ; Relational_Expr : Additive_Expr | Relational_Expr LT Additive_Expr | Relational_Expr GT Additive_Expr | Relational_Expr LE Additive_Expr | Relational_Expr GE Additive_Expr ; Additive_Expr : Multiplicative_Expr | Additive_Expr PLUS Multiplicative_Expr | Additive_Expr MINUS Multiplicative_Expr ; Multiplicative_Expr : Unary_Expr | Multiplicative_Expr STAR Unary_Expr | Multiplicative_Expr DIV Unary_Expr | Multiplicative_Expr MOD Unary_Expr ; Unary_Expr : Union_Expr | MINUS Unary_Expr ; Number : INTEGER | DECIMAL_LITERAL ; Literal : DQ_LITERAL | SQ_LITERAL ; xia-1.00/booch4xia/0040777000076600007670000000000010212333762012764 5ustar g315padadevxia-1.00/booch4xia/bc.ads0100644000076600007670000000551010212333762014033 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc.ads,v $ -- $Revision: 1.8.2.3 $ -- $Date: 2002/12/24 11:42:44 $ -- $Author: simon $ package BC is -- This is the top level package in the Booch Component Hierarchy. -- The following exceptions may be raised by improper use of the -- Components. Duplicate : exception; -- Attempt to insert an item in a Map under a duplicate key. Is_Null : exception; -- A Graph, List, or Tree isn't designating any actual Container. Not_Found : exception; -- Raised when a "done" Iterator is used. Not_Root : exception; -- Attempt to insert, append or join Lists or Trees other than at -- an "end". Overflow : exception; -- Attempt to fill a bounded Container beyond its capacity. Range_Error : exception; -- Attempt to Insert or Append at an invalid position. Referenced : exception; -- Attempt to Remove a List element that's aliased by another -- List. Sort_Error : exception; -- Attempt to sort an inappropriate Container (Bag, Map, Set). Storage_Error : exception; -- Raised by BC.Support.Managed_Storage when the requested size is -- too large or zero. Underflow : exception; -- Raised on attempts to access elements in an empty Container. Should_Have_Been_Overridden : exception; -- Raised if the Components have failed to override a primitive -- subprogram that should have been overridden for a derived type. -- Used only where the subprogram is private (and therefore can't -- be abstract). Not_Yet_Implemented : exception; -- Raised when a feature hasn't yet been implemented. end BC; xia-1.00/booch4xia/bc-containers.adb0100644000076600007670000001033610212333762016157 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers.adb,v $ -- $Revision: 1.15.2.1 $ -- $Date: 2002/12/26 11:43:52 $ -- $Author: simon $ package body BC.Containers is -- Iteration support procedure Access_Current_Item (In_The_Iterator : Iterator'Class) is begin Apply (Current_Item_Ptr (In_The_Iterator).all); end Access_Current_Item; procedure Visit (Using : in out Iterator'Class) is Success : Boolean; begin Reset (Using); while not Is_Done (Using) loop Apply (Current_Item_Ptr (Using).all, Success); exit when not Success; Next (Using); end loop; end Visit; procedure Visit_With_In_Param (Using : in out Iterator'Class; Param : Param_Type) is Success : Boolean; begin Reset (Using); while not Is_Done (Using) loop Apply (Current_Item_Ptr (Using).all, Param, Success); exit when not Success; Next (Using); end loop; end Visit_With_In_Param; procedure Visit_With_In_Out_Param (Using : in out Iterator'Class; Param : in out Param_Type) is Success : Boolean; begin Reset (Using); while not Is_Done (Using) loop Apply (Current_Item_Ptr (Using).all, Param, Success); exit when not Success; Next (Using); end loop; end Visit_With_In_Out_Param; procedure Modify (Using : in out Iterator'Class) is Success : Boolean; begin Reset (Using); while not Is_Done (Using) loop Apply (Current_Item_Ptr (Using).all, Success); exit when not Success; Next (Using); end loop; end Modify; procedure Modify_With_In_Param (Using : in out Iterator'Class; Param : in Param_Type) is Success : Boolean; begin Reset (Using); while not Is_Done (Using) loop Apply (Current_Item_Ptr (Using).all, Param, Success); exit when not Success; Next (Using); end loop; end Modify_With_In_Param; procedure Modify_With_In_Out_Param (Using : in out Iterator'Class; Param : in out Param_Type) is Success : Boolean; begin Reset (Using); while not Is_Done (Using) loop Apply (Current_Item_Ptr (Using).all, Param, Success); exit when not Success; Next (Using); end loop; end Modify_With_In_Out_Param; -- Primitive implementations procedure Lock (C : in out Container) is pragma Warnings (Off, C); begin null; end Lock; procedure Unlock (C : in out Container) is pragma Warnings (Off, C); begin null; end Unlock; function Item_At (C : Container; Index : Positive) return Item_Ptr is begin raise Should_Have_Been_Overridden; return null; end Item_At; function Current_Item_Ptr (It : Iterator) return Item_Ptr is begin raise Should_Have_Been_Overridden; return null; end Current_Item_Ptr; end BC.Containers; xia-1.00/booch4xia/bc-containers.ads0100644000076600007670000001472710212333762016210 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers.ads,v $ -- $Revision: 1.17.2.2 $ -- $Date: 2002/12/26 11:43:52 $ -- $Author: simon $ with Ada.Finalization; generic type Item is private; with function "=" (L, R : Item) return Boolean is <>; package BC.Containers is pragma Elaborate_Body; -- This package specifies the common protocol of all Container -- classes. This common protocol consists of Iterators. type Container is abstract tagged private; function Null_Container return Container is abstract; -- Active iteration type Iterator (<>) is abstract tagged private; function New_Iterator (For_The_Container : Container) return Iterator'Class is abstract; -- Return a reset Iterator bound to the specific Container. procedure Reset (It : in out Iterator) is abstract; -- Reset the Iterator to the beginning. procedure Next (It : in out Iterator) is abstract; -- Advance the Iterator to the next Item in the Container. function Is_Done (It : Iterator) return Boolean is abstract; -- Return True if there are no more Items in the Container. function Current_Item (It : Iterator) return Item is abstract; -- Return a copy of the current Item. generic with procedure Apply (Elem : in out Item); procedure Access_Current_Item (In_The_Iterator : Iterator'Class); -- Call Apply for the Iterator's current Item. procedure Delete_Item_At (It : in out Iterator) is abstract; -- Remove the current item. -- Passive iteration generic with procedure Apply (Elem : in Item; OK : out Boolean); procedure Visit (Using : in out Iterator'Class); -- Call Apply with a copy of each Item in the Container to which -- the iterator Using is bound. The iteration will terminate early -- if Apply sets OK to False. generic type Param_Type is private; with procedure Apply (Elem : in Item; Param : in Param_Type; OK : out Boolean); procedure Visit_With_In_Param (Using : in out Iterator'Class; Param : in Param_Type); -- Call Apply with a Parameter for each Item in the Container to -- which the iterator Using is bound. The iteration will terminate -- early if Apply sets OK to False. generic type Param_Type is private; with procedure Apply (Elem : in Item; Param : in out Param_Type; OK : out Boolean); procedure Visit_With_In_Out_Param (Using : in out Iterator'Class; Param : in out Param_Type); -- Call Apply with a Parameter for each Item in the Container to -- which the iterator Using is bound. The iteration will terminate -- early if Apply sets OK to False. generic with procedure Apply (Elem : in out Item; OK : out Boolean); procedure Modify (Using : in out Iterator'Class); -- Call Apply with a copy of each Item in the Container to which -- the iterator Using is bound. The iteration will terminate early -- if Apply sets OK to False. generic type Param_Type is private; with procedure Apply (Elem : in out Item; Param : in Param_Type; OK : out Boolean); procedure Modify_With_In_Param (Using : in out Iterator'Class; Param : in Param_Type); -- Call Apply with a Parameter each Item in the Container to which -- the iterator Using is bound. The iteration will terminate early -- if Apply sets OK to False. generic type Param_Type is private; with procedure Apply (Elem : in out Item; Param : in out Param_Type; OK : out Boolean); procedure Modify_With_In_Out_Param (Using : in out Iterator'Class; Param : in out Param_Type); -- Call Apply with a copy of each Item in the Container to which -- the iterator Using is bound. The iteration will terminate early -- if Apply sets OK to False. private -- We need access to Items; but we must make sure that no actual -- allocations occur using this type. type Item_Ptr is access all Item; for Item_Ptr'Storage_Size use 0; type Container is abstract new Ada.Finalization.Controlled with null record; -- Support for concurrency protection. The base implementation of -- these procedures does nothing; derived types override as -- required. procedure Lock (C : in out Container); procedure Unlock (C : in out Container); -- Private primitive operations of Container. These should -- ideally be abstract; instead, we provide implementations, but -- they raise Should_Have_Been_Overridden. function Item_At (C : Container; Index : Positive) return Item_Ptr; -- Iteration type Container_Ptr is access all Container'Class; for Container_Ptr'Storage_Size use 0; type Iterator is abstract tagged record For_The_Container : Container_Ptr; end record; -- Private primitive operations of Iterator. These should ideally -- be abstract; instead, we provide implementations, but they -- raise Should_Have_Been_Overridden. function Current_Item_Ptr (It : Iterator) return Item_Ptr; end BC.Containers; xia-1.00/booch4xia/bc-containers-sets.adb0100644000076600007670000001131110212333762017125 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-sets.adb,v $ -- $Revision: 1.13.2.3 $ -- $Date: 2002/12/29 16:41:45 $ -- $Author: simon $ package body BC.Containers.Sets is function Are_Equal (L, R : Abstract_Set'Class) return Boolean is It : Iterator'Class := New_Iterator (L); begin -- XXX left out the optimisation which checks whether L, R are -- identical. if Extent (L) /= Extent (R) then return False; end if; while not Is_Done (It) loop if not Is_Member (R, Current_Item (It)) then return False; end if; Next (It); end loop; return True; end Are_Equal; procedure Union (S : in out Abstract_Set'Class; O : Abstract_Set'Class) is It : Iterator'Class := New_Iterator (O); begin -- XXX left out the optimisation which checks whether L, R are -- identical. while not Is_Done (It) loop declare This_Item : Item renames Current_Item (It); begin if not Is_Member (S, This_Item) then Add (S, This_Item); end if; end; Next (It); end loop; end Union; procedure Intersection (S : in out Abstract_Set'Class; O : Abstract_Set'Class) is Tmp : Abstract_Set'Class := S; It : Iterator'Class := New_Iterator (Tmp); begin -- XXX left out the optimisation which checks whether L, R are -- identical. while not Is_Done (It) loop declare This_Item : Item renames Current_Item (It); begin if not Is_Member (O, This_Item) then Remove (S, This_Item); end if; Next (It); end; end loop; end Intersection; procedure Difference (S : in out Abstract_Set'Class; O : Abstract_Set'Class) is It : Iterator'Class := New_Iterator (O); begin -- XXX left out the optimisation which checks whether L, R are -- identical. while not Is_Done (It) loop declare This_Item : Item renames Current_Item (It); begin if Is_Member (S, This_Item) then Remove (S, This_Item); end if; end; Next (It); end loop; end Difference; function Is_Subset (S : Abstract_Set'Class; O : Abstract_Set'Class) return Boolean is It : Iterator'Class := New_Iterator (S); begin -- XXX left out the optimisation which checks whether L, R are -- identical. if Extent (S) > Extent (O) then return False; end if; while not Is_Done (It) loop if not Is_Member (O, Current_Item (It)) then return False; end if; Next (It); end loop; return True; end Is_Subset; function Is_Proper_Subset (S : Abstract_Set'Class; O : Abstract_Set'Class) return Boolean is It : Iterator'Class := New_Iterator (S); begin -- XXX left out the optimisation which checks whether L, R are -- identical. if Extent (S) >= Extent (O) then return False; end if; while not Is_Done (It) loop if not Is_Member (O, Current_Item (It)) then return False; end if; Next (It); end loop; return True; end Is_Proper_Subset; function Available (S : in Abstract_Set) return Natural is pragma Warnings (Off, S); begin return Natural'Last; end Available; end BC.Containers.Sets; xia-1.00/booch4xia/bc-containers-sets.ads0100644000076600007670000001261310212333762017154 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-sets.ads,v $ -- $Revision: 1.11.2.3 $ -- $Date: 2002/12/29 16:41:46 $ -- $Author: simon $ generic package BC.Containers.Sets is pragma Elaborate_Body; -- A set denotes a collection of items, drawn from some -- well-defined universe. A set may not contain duplicate items. -- The parameter Item denotes the universe from which the set -- draws its items. Items may be a primitive type or user-defined. type Abstract_Set is abstract new Container with private; function Are_Equal (L, R : Abstract_Set'Class) return Boolean; -- Return True if and only if both sets have the same number of -- distinct items, and the same items themselves; return False -- otherwise. Can't call this "=" because of the standard one for -- Set. procedure Clear (S : in out Abstract_Set) is abstract; -- Empty the set of all items. procedure Add (S : in out Abstract_Set; I : Item; Added : out Boolean) is abstract; -- Add the item to the set. If the item is not already a distinct -- member of the set, copy the item and add it to the set and set -- Added to True. If the item already exists, then set Added to -- False. procedure Add (S : in out Abstract_Set; I : Item) is abstract; -- Add the item to the set. If the item is not already a distinct -- member of the set, copy the item and add it to the set. procedure Remove (S : in out Abstract_Set; I : Item) is abstract; -- If the item is not a member of the set, raise -- BC.Not_Found. Otherwise, remove the item from the set. procedure Union (S : in out Abstract_Set'Class; O : Abstract_Set'Class); -- Perform a logical set union; at the completion of this -- operation, the set S contains the items found in its original -- state combined with the set O (but without duplication). For -- each item in the set O, if the item is not already a distinct -- member of the set S, copy the item and add it to the set S. If -- the item already is a member, do nothing. procedure Intersection (S : in out Abstract_Set'Class; O : Abstract_Set'Class); -- Perform a logical set intersection; at the completion of this -- operation, the set S contains the items found both in its -- original state and in the set O. For each item in the set O, if -- the item is not already a distinct member of the set S, do -- nothing. If the item already is a member of S, do -- nothing. Items in the set S but not in the set O are also -- removed. procedure Difference (S : in out Abstract_Set'Class; O : Abstract_Set'Class); -- Perform a logical set difference; at the completion of this -- operation, the set S contains the items found in its original -- state, less those found in the set O. For each item in the set -- O, if the item is not already a distinct member of the set S, -- do nothing. If the item is a member, remove the item from the -- set S. function Available (S : Abstract_Set) return Natural; -- Return the number of unused slots in the set. function Extent (S : Abstract_Set) return Natural is abstract; -- Return the number of distinct items in the set. function Is_Empty (S : Abstract_Set) return Boolean is abstract; -- Return True if and only if there are no items in the set. function Is_Member (S : Abstract_Set; I : Item) return Boolean is abstract; -- Return True if and only if the item exists in the set. function Is_Subset (S : Abstract_Set'Class; O : Abstract_Set'Class) return Boolean; -- Return True if and only if all the items in the set S are also -- in the set O. function Is_Proper_Subset (S : Abstract_Set'Class; O : Abstract_Set'Class) return Boolean; -- Return True if and only if all the items in the set S are also -- in the set O, and there is at least one item in O that is not -- in S. private type Abstract_Set is abstract new Container with null record; type Set_Iterator is abstract new Iterator with record Bucket_Index : Natural := 0; Index : Natural := 0; end record; end BC.Containers.Sets; xia-1.00/booch4xia/bc-containers-sets-unbounded.adb0100644000076600007670000001170210212333762021112 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-sets-unbounded.adb,v $ -- $Revision: 1.10.2.4 $ -- $Date: 2002/12/29 16:41:51 $ -- $Author: simon $ with BC.Support.Exceptions; with System.Address_To_Access_Conversions; package body BC.Containers.Sets.Unbounded is package BSE renames BC.Support.Exceptions; procedure Assert is new BSE.Assert ("BC.Containers.Sets.Unbounded"); procedure Clear (S : in out Unconstrained_Set) is begin Tables.Clear (S.Rep); end Clear; procedure Add (S : in out Unconstrained_Set; I : Item; Added : out Boolean) is begin if Tables.Is_Bound (S.Rep, I) then Added := False; else Tables.Bind (S.Rep, I, True); Added := True; end if; end Add; procedure Add (S : in out Unconstrained_Set; I : Item) is begin if not Tables.Is_Bound (S.Rep, I) then Tables.Bind (S.Rep, I, True); end if; end Add; procedure Remove (S : in out Unconstrained_Set; I : Item) is begin Assert (Tables.Is_Bound (S.Rep, I), BC.Not_Found'Identity, "Remove", BSE.Missing); Tables.Unbind (S.Rep, I); end Remove; function Extent (S : Unconstrained_Set) return Natural is begin return Tables.Extent (S.Rep); end Extent; function Is_Empty (S : Unconstrained_Set) return Boolean is begin return Tables.Extent (S.Rep) = 0; end Is_Empty; function Is_Member (S : Unconstrained_Set; I : Item) return Boolean is begin return Tables.Is_Bound (S.Rep, I); end Is_Member; package Address_Conversions is new System.Address_To_Access_Conversions (Unconstrained_Set); function New_Iterator (For_The_Set : Unconstrained_Set) return Iterator'Class is Result : Unbounded_Set_Iterator; begin Result.For_The_Container := Address_Conversions.To_Pointer (For_The_Set'Address).all'Access; Reset (Result); return Result; end New_Iterator; -- Null containers Empty_Container : Set; pragma Warnings (Off, Empty_Container); function Null_Container return Unconstrained_Set is begin return Empty_Container; end Null_Container; -- Iterators procedure Reset (It : in out Unbounded_Set_Iterator) is S : Unconstrained_Set'Class renames Unconstrained_Set'Class (It.For_The_Container.all); begin Tables.Reset (S.Rep, It.Bucket_Index, It.Index); end Reset; procedure Next (It : in out Unbounded_Set_Iterator) is S : Unconstrained_Set'Class renames Unconstrained_Set'Class (It.For_The_Container.all); begin Tables.Next (S.Rep, It.Bucket_Index, It.Index); end Next; function Is_Done (It : Unbounded_Set_Iterator) return Boolean is S : Unconstrained_Set'Class renames Unconstrained_Set'Class (It.For_The_Container.all); begin return Tables.Is_Done (S.Rep, It.Bucket_Index, It.Index); end Is_Done; function Current_Item (It : Unbounded_Set_Iterator) return Item is S : Unconstrained_Set'Class renames Unconstrained_Set'Class (It.For_The_Container.all); begin return Tables.Current_Item_Ptr (S.Rep, It.Bucket_Index, It.Index).all; end Current_Item; function Current_Item_Ptr (It : Unbounded_Set_Iterator) return Item_Ptr is S : Unconstrained_Set'Class renames Unconstrained_Set'Class (It.For_The_Container.all); begin return Tables.Current_Item_Ptr (S.Rep, It.Bucket_Index, It.Index); end Current_Item_Ptr; procedure Delete_Item_At (It : in out Unbounded_Set_Iterator) is S : Unconstrained_Set'Class renames Unconstrained_Set'Class (It.For_The_Container.all); begin Tables.Delete_Item_At (S.Rep, It.Bucket_Index, It.Index); end Delete_Item_At; end BC.Containers.Sets.Unbounded; xia-1.00/booch4xia/bc-containers-sets-unbounded.ads0100644000076600007670000001303110212333762021130 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-sets-unbounded.ads,v $ -- $Revision: 1.13.2.6 $ -- $Date: 2002/12/29 16:41:52 $ -- $Author: simon $ with BC.Support.Unbounded; with BC.Support.Hash_Tables; with System.Storage_Pools; generic with function Hash (V : Item) return Natural is <>; Buckets : Positive; Storage : in out System.Storage_Pools.Root_Storage_Pool'Class; package BC.Containers.Sets.Unbounded is pragma Elaborate_Body; -- A set denotes a collection of items, drawn from some -- well-defined universe. A set may not contain duplicate items. -- The hash function (the generic parameter Hash) determines the -- allocation of items to hash buckets. The value returned must -- not change during the lifetime of a given Item. The range of -- hash values need not be constrained to the number of buckets in -- the set. -- The hash function must satisfy the condition that, for objects -- A and B, if A = B, then Hash (A) must equal Hash (B). The hash -- function should attempt to spread the set of possible items -- uniformly across the number of buckets. The quality of the hash -- function has a significant impact upon performance. type Unconstrained_Set (Number_Of_Buckets : Positive) is new Abstract_Set with private; subtype Set is Unconstrained_Set (Number_Of_Buckets => Buckets); function Null_Container return Unconstrained_Set; -- Note, this function has to be provided but the object returned -- is in fact a Set (ie, it is constrained). procedure Clear (S : in out Unconstrained_Set); -- Empty the set of all items. procedure Add (S : in out Unconstrained_Set; I : Item; Added : out Boolean); -- Add the item to the set. If the item is not already a distinct -- member of the set, copy the item and add it to the set and set -- Added to True. If the item already exists, then set Added to -- False. procedure Add (S : in out Unconstrained_Set; I : Item); -- Add the item to the set. If the item is not already a distinct -- member of the set, copy the item and add it to the set. procedure Remove (S : in out Unconstrained_Set; I : Item); -- If the item is not a member of the set, raise -- BC.Not_Found. Otherwise, remove the item from the set. function Extent (S : Unconstrained_Set) return Natural; -- Return the number of items in the set. function Is_Empty (S : Unconstrained_Set) return Boolean; -- Return True if and only if there are no items in the set. function Is_Member (S : Unconstrained_Set; I : Item) return Boolean; -- Return True if and only if the item exists in the set. function New_Iterator (For_The_Set : Unconstrained_Set) return Iterator'Class; -- Return a reset Iterator bound to the specific Set. private package IC is new BC.Support.Unbounded (Item => Item, Item_Ptr => Item_Ptr, Storage => Storage); use IC; package Items is new BC.Support.Hash_Tables.Item_Signature (Item => Item, Item_Ptr => Item_Ptr, Item_Container => IC.Unb_Node); -- We need a dummy type for the Value component of the hash table. type Boolean_Ptr is access all Boolean; package VC is new BC.Support.Unbounded (Item => Boolean, Item_Ptr => Boolean_Ptr, Storage => Storage); use VC; package Values is new BC.Support.Hash_Tables.Value_Signature (Value => Boolean, Value_Ptr => Boolean_Ptr, Value_Container => VC.Unb_Node); package Tables is new BC.Support.Hash_Tables.Tables (Items => Items, Values => Values); type Unconstrained_Set (Number_Of_Buckets : Positive) is new Abstract_Set with record Rep : Tables.Table (Number_Of_Buckets => Number_Of_Buckets); end record; -- Iterators type Unbounded_Set_Iterator is new Set_Iterator with null record; procedure Reset (It : in out Unbounded_Set_Iterator); procedure Next (It : in out Unbounded_Set_Iterator); function Is_Done (It : Unbounded_Set_Iterator) return Boolean; function Current_Item (It : Unbounded_Set_Iterator) return Item; function Current_Item_Ptr (It : Unbounded_Set_Iterator) return Item_Ptr; procedure Delete_Item_At (It : in out Unbounded_Set_Iterator); end BC.Containers.Sets.Unbounded; xia-1.00/booch4xia/bc-containers-trees.ads0100644000076600007670000001137610212333762017325 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-trees.ads,v $ -- $Revision: 1.9.2.1 $ -- $Date: 2002/12/29 16:42:01 $ -- $Author: simon $ generic package BC.Containers.Trees is -- A binary tree is a rooted collection of nodes and arcs, where -- each node has two children and where arcs may not have cycles -- or cross-references (as in graphs). A multiway tree is a rooted -- collection of nodes and arcs, where each node may have an -- arbitrary number of children and where arcs may not have cycles -- or cross-references. AVL trees are a form of balance tree -- (following the algorithm of Adelson-Velskii and Landis) whose -- behavior only exposes operations to insert, delete, and search -- for items. -- Binary and multiway trees are polylithic structures, and hence -- the semantics of copying, assignment, and equality involve -- structural sharing. Care must be taken in manipulating the same -- tree named by more than one alias. AVL trees are monolithic. -- These classes are not intended to be subclassed, and so provide -- no virtual members. -- These abstractions have been carefully constructed to eliminate -- all storage leaks, except in the case of intentional -- abuses. When a tree is manipulated, all items that become -- unreachable are automatically reclaimed. Furthermore, this -- design protects against dangling references: an item is never -- reclaimed if there exists a reference to it. -- Unreachable items are those that belong to a tree or a subtree -- whose root is not designated by any alias. For example, -- consider the tree (A (B C (D E))), with the root of the tree -- designated by T1. T1 initially points to the root of the tree, -- at item A. Invoking the operation Right_Child on T1 now causes -- T1 to point to item C. Because A is now considered unreachable, -- the storage associated with item A is reclaimed; the parent of -- C is now null. Additionally, the sibling subtree rooted at B is -- also now unreachable, and so is reclaimed (along with its -- children, and recursively so). Similarly, consider the same -- tree, with the root of the tree designated by both T1 and -- T2. Both T1 and T2 are aliases that initially point to the root -- of the tree at item A. Invoking the operation Right_Child on T1 -- now causes T1 to point to item C; T2 is unaffected. No storage -- is reclaimed, since every element of the tree is still -- reachable. Suppose we now invoke the member function Clear on -- T2. The semantics of this operation are such that only -- unreachable items are reclaimed. Thus, the storage associated -- with item A is reclaimed, because it is no longer reachable; -- additionally, the sibling B (and recursively so, its children) -- is reclaimed, because it is also now unreachable; the subtree -- denoted by T1 is unaffected. T2 is now null, and the parent of -- C is now null. -- It is possible, but not generally desirable, to produce -- multi-headed trees. In such cases, the parent of the item at -- the neck of a multi-headed tree points to the most recently -- attached root. -- The binary and multiway trees have a similar protocol, except -- that the binary tree adds two operations, Left_Child and -- Right_Child, and the multiway tree overloads the Append -- operation and adds the operation Arity. The AVL tree has a -- completely different protocol, with a much more limited set of -- operations. end BC.Containers.Trees; xia-1.00/booch4xia/bc-containers-trees-avl.adb0100644000076600007670000004536510212333762020071 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-trees-avl.adb,v $ -- $Revision: 1.10.2.1 $ -- $Date: 2002/12/29 16:42:02 $ -- $Author: simon $ with Ada.Unchecked_Deallocation; package body BC.Containers.Trees.AVL is procedure Delete is new Ada.Unchecked_Deallocation (AVL_Node, AVL_Node_Ref); -- Supporting subprograms procedure Purge (Node : in out AVL_Node_Ref); procedure Search_Insert (T : in out AVL_Tree; Element : Item; Node : in out AVL_Node_Ref; Increased : in out Boolean; Inserted : out Boolean); procedure Search_Delete (T : in out AVL_Tree; Element : Item; Node : in out AVL_Node_Ref; Decreased : in out Boolean; Deleted : out Boolean); procedure Balance_Left (Node : in out AVL_Node_Ref; Decreased : in out Boolean); procedure Balance_Right (Node : in out AVL_Node_Ref; Decreased : in out Boolean); procedure Delete (To_Be_Deleted, Candidate_Replacement : in out AVL_Node_Ref; Decreased : in out Boolean); function Search (T : AVL_Tree; Element : Item; Node : AVL_Node_Ref) return Boolean; procedure Purge (Node : in out AVL_Node_Ref) is begin if Node /= null then Purge (Node.Left); Purge (Node.Right); Delete (Node); end if; end Purge; procedure Search_Insert (T : in out AVL_Tree; Element : Item; Node : in out AVL_Node_Ref; Increased : in out Boolean; Inserted : out Boolean) is P1, P2 : AVL_Node_Ref; begin Inserted := True; if Node = null then Node := new AVL_Node'(Element => Element, Left => null, Right => null, Balance => Middle); Increased := True; elsif Element < Node.Element then Search_Insert (T, Element, Node.Left, Increased, Inserted); if Increased then case Node.Balance is when Right => Node.Balance := Middle; Increased := False; when Middle => Node.Balance := Left; when Left => P1 := Node.Left; if P1.Balance = Left then Node.Left := P1.Right; P1.Right := Node; Node.Balance := Middle; Node := P1; else P2 := P1.Right; P1.Right := P2.Left; P2.Left := P1; Node.Left := P2.Right; P2.Right := Node; if P2.Balance = Left then Node.Balance := Right; else Node.Balance := Middle; end if; if P2.Balance = Right then P1.Balance := Left; else P1.Balance := Middle; end if; Node := P2; end if; Node.Balance := Middle; Increased := False; end case; end if; elsif Node.Element < Element then Search_Insert (T, Element, Node.Right, Increased, Inserted); if Increased then case Node.Balance is when Left => Node.Balance := Middle; Increased := False; when Middle => Node.Balance := Right; when Right => P1 := Node.Right; if P1.Balance = Right then Node.Right := P1.Left; P1.Left := Node; Node.Balance := Middle; Node := P1; else P2 := P1.Left; P1.Left := P2.Right; P2.Right := P1; Node.Right := P2.Left; P2.Left := Node; if P2.Balance = Right then Node.Balance := Left; else Node.Balance := Middle; end if; if P2.Balance = Left then P1.Balance := Right; else P1.Balance := Middle; end if; Node := P2; end if; Node.Balance := Middle; Increased := False; end case; end if; else -- We need to cope with the case where elements _compare_ -- equal but their non-key data content has changed. Node.Element := Element; Inserted := False; end if; end Search_Insert; procedure Balance_Left (Node : in out AVL_Node_Ref; Decreased : in out Boolean) is P1, P2 : AVL_Node_Ref; Balance1, Balance2 : Node_Balance; begin case Node.Balance is when Left => Node.Balance := Middle; when Middle => Node.Balance := Right; Decreased := False; when Right => P1 := Node.Right; Balance1 := P1.Balance; if Balance1 >= Middle then Node.Right := P1.Left; P1.Left := Node; if Balance1 = Middle then Node.Balance := Right; P1.Balance := Left; Decreased := False; else Node.Balance := Middle; P1.Balance := Middle; end if; Node := P1; else P2 := P1.Left; Balance2 := P2.Balance; P1.Left := P2.Right; P2.Right := P1; Node.Right := P2.Left; P2.Left := Node; if Balance2 = Right then Node.Balance := Left; else Node.Balance := Middle; end if; if Balance2 = Left then P1.Balance := Right; else P1.Balance := Middle; end if; Node := P2; P2.Balance := Middle; end if; end case; end Balance_Left; procedure Balance_Right (Node : in out AVL_Node_Ref; Decreased : in out Boolean) is P1, P2 : AVL_Node_Ref; Balance1, Balance2 : Node_Balance; begin case Node.Balance is when Right => Node.Balance := Middle; when Middle => Node.Balance := Left; Decreased := False; when Left => P1 := Node.Left; Balance1 := P1.Balance; if Balance1 <= Middle then Node.Left := P1.Right; P1.Right := Node; if Balance1 = Middle then Node.Balance := Left; P1.Balance := Right; Decreased := False; else Node.Balance := Middle; P1.Balance := Middle; end if; Node := P1; else P2 := P1.Right; Balance2 := P2.Balance; P1.Right := P2.Left; P2.Left := P1; Node.Left := P2.Right; P2.Right := Node; if Balance2 = Left then Node.Balance := Right; else Node.Balance := Middle; end if; if Balance2 = Right then P1.Balance := Left; else P1.Balance := Middle; end if; Node := P2; P2.Balance := Middle; end if; end case; end Balance_Right; -- On entry, To_Be_Deleted is the node which contains the value -- that is to be deleted. Candidate_Replacement starts off as the -- left child of To_Be_Deleted, but the procedure recurses until -- Candidate_Replacement is the rightmost (largest) child of the -- left subtree of To_Be_Deleted. -- -- The value at Candidate_Replacement is then transferred to the -- node To_Be_Deleted, and the pointer To_Be_Deleted is made to -- point to the rightmost child (so that that what eventually gets -- deleted is that rightmost child). -- -- The tree is rebalanced as the recursion unwinds. procedure Delete (To_Be_Deleted, Candidate_Replacement : in out AVL_Node_Ref; Decreased : in out Boolean) is begin if Candidate_Replacement.Right /= null then -- Recurse down the right branch Delete (To_Be_Deleted, Candidate_Replacement.Right, Decreased); if Candidate_Replacement.Left = null and then Candidate_Replacement.Right = null then Candidate_Replacement.Balance := Middle; elsif Decreased then Balance_Right (Candidate_Replacement, Decreased); end if; else -- We've found the rightmost child. -- Copy the value there to the node that contained the value -- to be deleted. To_Be_Deleted.Element := Candidate_Replacement.Element; -- Replace the pointer to the node that contained the value -- to be deleted with a pointer to the rightmost child of -- the left subtree (no longer needed, and to be deleted by -- the caller). To_Be_Deleted := Candidate_Replacement; -- Candidate_Replacement is the actual pointer in the parent -- node; it needs to point to the left subtree, if any, of -- the node that was the rightmost child and which we are -- about to delete. Candidate_Replacement := Candidate_Replacement.Left; -- We've definitely reduced the depth. Decreased := True; end if; end Delete; procedure Search_Delete (T : in out AVL_Tree; Element : Item; Node : in out AVL_Node_Ref; Decreased : in out Boolean; Deleted : out Boolean) is Q : AVL_Node_Ref; begin Deleted := False; if Node /= null then if Element < Node.Element then Search_Delete (T, Element, Node.Left, Decreased, Deleted); if Decreased then Balance_Left (Node, Decreased); end if; elsif Node.Element < Element then Search_Delete (T, Element, Node.Right, Decreased, Deleted); if Decreased then Balance_Right (Node, Decreased); end if; else Q := Node; Deleted := True; if Q.Right = null then Node := Q.Left; Decreased := True; elsif Q.Left = null then Node := Q.Right; Decreased := True; else Delete (Q, Q.Left, Decreased); if Decreased then Balance_Left (Node, Decreased); end if; end if; Delete (Q); end if; end if; end Search_Delete; function Search (T : AVL_Tree; Element : Item; Node : AVL_Node_Ref) return Boolean is begin if Node /= null then if Node.Element = Element then return True; elsif Element < Node.Element then return Search (T, Element, Node.Left); else return Search (T, Element, Node.Right); end if; else return False; end if; end Search; -- end supporting functions function "=" (L, R : AVL_Tree) return Boolean is -- Once we know that the sizes are the same, we only need to -- check that all members of L are in R, because we don't allow -- duplicate members. procedure Check_In_Right (Elem : in Item; Found : out Boolean); procedure Compare is new Visit (Apply => Check_In_Right); Are_Equal : Boolean := True; procedure Check_In_Right (Elem : in Item; Found : out Boolean) is begin Found := Is_Member (R, Elem); -- to terminate early if not Found then Are_Equal := False; end if; end Check_In_Right; begin if L.Size /= R.Size then return False; end if; Compare (Over_The_Tree => L); return Are_Equal; end "="; procedure Clear (T : in out AVL_Tree) is begin Purge (T.Rep); T.Size := 0; end Clear; procedure Insert (T : in out AVL_Tree; Element : Item; Not_Found : out Boolean) is Increased : Boolean := False; Result : Boolean; begin Search_Insert (T, Element, T.Rep, Increased, Result); if Result then T.Size := T.Size + 1; Not_Found := True; else Not_Found := False; end if; end Insert; procedure Delete (T : in out AVL_Tree; Element : Item; Found : out Boolean) is Decreased : Boolean := False; Result : Boolean; begin Search_Delete (T, Element, T.Rep, Decreased, Result); if Result then T.Size := T.Size - 1; Found := True; else Found := False; end if; end Delete; function Extent (T : in AVL_Tree) return Natural is begin return T.Size; end Extent; function Is_Null (T : in AVL_Tree) return Boolean is begin return T.Rep = null; end Is_Null; function Is_Member (T : in AVL_Tree; Element : Item) return Boolean is begin return Search (T, Element, T.Rep); end Is_Member; procedure Access_Actual_Item (In_The_Tree : AVL_Tree; Elem : Item; Found : out Boolean) is procedure Access_Actual_Item (Node : AVL_Node_Ref); procedure Access_Actual_Item (Node : AVL_Node_Ref) is begin if Node /= null then if Node.Element = Elem then Found := True; Apply (Node.Element); elsif Elem < Node.Element then Access_Actual_Item (Node.Left); else Access_Actual_Item (Node.Right); end if; end if; end Access_Actual_Item; begin Found := False; Access_Actual_Item (In_The_Tree.Rep); end Access_Actual_Item; -- function Traverse (Node : AVL_Node_Ref; -- Iter_Func : Iteration_Function) return Boolean is -- Temp : AVL_Node_Ref; -- begin -- if Node /= null then -- Temp := Node.Left; -- if not Traverse (Temp, Iter_Func) then -- return False; -- end if; -- if not Iter_Func (Temp.Element) then -- return False; -- end if; -- Temp := Node.Right; -- if not Traverse (Temp, Iter_Func) then -- return False; -- end if; -- end if; -- return True; -- end Traverse; procedure Visit (Over_The_Tree : AVL_Tree) is Continue : Boolean := True; procedure Visit (Node : AVL_Node_Ref); procedure Visit (Node : AVL_Node_Ref) is begin if Node /= null then Visit (Node.Left); if not Continue then return; end if; Apply (Node.Element, Continue); if not Continue then return; end if; Visit (Node.Right); end if; end Visit; begin Visit (Over_The_Tree.Rep); end Visit; procedure Modify (Over_The_Tree : AVL_Tree) is Continue : Boolean := True; procedure Modify (Node : AVL_Node_Ref); procedure Modify (Node : AVL_Node_Ref) is begin if Node /= null then Modify (Node.Left); if not Continue then return; end if; Apply (Node.Element, Continue); if not Continue then return; end if; Modify (Node.Right); end if; end Modify; begin Modify (Over_The_Tree.Rep); end Modify; procedure Initialize (T : in out AVL_Tree) is pragma Warnings (Off, T); begin null; end Initialize; procedure Adjust (T : in out AVL_Tree) is New_Tree : AVL_Tree; procedure Add (Elem : in Item; OK : out Boolean); procedure Copy is new Visit (Apply => Add); procedure Add (Elem : in Item; OK : out Boolean) is Inserted : Boolean; begin Insert (T => New_Tree, Element => Elem, Not_Found => Inserted); -- XXX should test Inserted? OK := True; end Add; begin -- Create a deep copy of the representation Copy (Over_The_Tree => T); -- Replace the original representation with the copy T.Rep := New_Tree.Rep; -- Null out the spare reference to the copy (so that when -- New_Tree gets finalized on exit from this procedure, we -- don't Clear it down). NB, mustn't do a whole-record -- assignment here or we'll end up with a recursive disaster). New_Tree.Rep := null; New_Tree.Size := 0; end Adjust; procedure Finalize (T : in out AVL_Tree) is begin Clear (T); end Finalize; end BC.Containers.Trees.AVL; xia-1.00/booch4xia/bc-containers-trees-avl.ads0100644000076600007670000001046010212333762020076 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-trees-avl.ads,v $ -- $Revision: 1.8.2.1 $ -- $Date: 2002/12/29 16:42:03 $ -- $Author: simon $ with Ada.Finalization; with System.Storage_Pools; generic with function "<" (L, R : Item) return Boolean is <>; Storage : in out System.Storage_Pools.Root_Storage_Pool'Class; package BC.Containers.Trees.AVL is pragma Elaborate_Body; type AVL_Tree is private; function "=" (L, R : AVL_Tree) return Boolean; -- return True if both trees contain the same Elements. procedure Clear (T : in out AVL_Tree); -- Make the tree null and reclaim the storage associated with its items. procedure Insert (T : in out AVL_Tree; Element : Item; Not_Found : out Boolean); -- Add the item to the tree, preserving the tree's -- balance. Not_Found is set to True if the item had not -- previously existed in the tree, and to False otherwise. procedure Delete (T : in out AVL_Tree; Element : Item; Found : out Boolean); -- Remove the item from the tree, preserving the tree's -- balance. Found is set to True if the item was in fact found in -- the tree and removed, and to False otherwise. function Extent (T : AVL_Tree) return Natural; -- Return the number of items in the tree. function Is_Null (T : AVL_Tree) return Boolean; -- Return True if and only if the tree has no items. function Is_Member (T : AVL_Tree; Element : Item) return Boolean; -- Return True if and only if the item exists in the tree. generic with procedure Apply (Elem : in out Item); procedure Access_Actual_Item (In_The_Tree : AVL_Tree; Elem : Item; Found : out Boolean); -- If an Item "=" to Elem is present in the Tree, call Apply for -- it and set Found to True; otherwise, set Found to False. -- Apply MUST NOT alter the result of the ordering operation "<". generic with procedure Apply (Elem : in Item; OK : out Boolean); procedure Visit (Over_The_Tree : AVL_Tree); -- Call Apply with a copy of each Item in the Tree, in order. The -- iteration will terminate early if Apply sets OK to False. generic with procedure Apply (Elem : in out Item; OK : out Boolean); procedure Modify (Over_The_Tree : AVL_Tree); -- Call Apply for each Item in the Tree, in order. The iteration will -- terminate early if Apply sets OK to False. -- Apply MUST NOT alter the result of the ordering operation "<". private type AVL_Node; type AVL_Node_Ref is access AVL_Node; for AVL_Node_Ref'Storage_Pool use Storage; type Node_Balance is (Left, Middle, Right); type AVL_Node is record Element : Item; Left, Right : AVL_Node_Ref; Balance : Node_Balance := Middle; end record; type AVL_Tree is new Ada.Finalization.Controlled with record Rep : AVL_Node_Ref; Size : Natural := 0; end record; procedure Initialize (T : in out AVL_Tree); procedure Adjust (T : in out AVL_Tree); procedure Finalize (T : in out AVL_Tree); end BC.Containers.Trees.AVL; xia-1.00/booch4xia/bc-support.ads0100644000076600007670000000257210212333762015552 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-support.ads,v $ -- $Revision: 1.5.2.1 $ -- $Date: 2002/12/26 14:48:03 $ -- $Author: simon $ package BC.Support is end BC.Support; xia-1.00/booch4xia/bc-support-exceptions.adb0100644000076600007670000000777510212333762017722 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-support-exceptions.adb,v $ -- $Revision: 1.5.2.1 $ -- $Date: 2002/12/26 14:48:10 $ -- $Author: simon $ package body BC.Support.Exceptions is function Reason_Message (For_The_Reason : Reason) return String; function Reason_Message (For_The_Reason : Reason) return String is begin case For_The_Reason is when No_Reason_Given => return ""; when Disjoint => return "objects are members of different structures"; when Duplicate => return "object already exists"; when Empty => return "object is empty"; when Full => return "object is full"; when Illegal => return "illegal pattern"; when Invalid_Index => return "index is out of range"; when Invalid_Number => return "string does not denote a valid number"; when Missing => return "object does not exist"; when Not_Empty => return "object is not empty"; when Not_Root => return "object is not at root of structure"; when Is_Null => return "object is null"; when Out_Of_Memory => return "storage requested not available"; when Referenced => return "object is referenced and cannot be destroyed"; when Timing => return "possible race condition"; when Too_Large => return "object is too large"; when Too_Small => return "object is too small"; end case; end Reason_Message; procedure Assert (Condition : Boolean; Raising_If_False : Ada.Exceptions.Exception_Id; From_Subprogram : String; With_Reason : Reason := No_Reason_Given) is begin if not Condition then if With_Reason = No_Reason_Given then Ada.Exceptions.Raise_Exception (Raising_If_False, Module & "." & From_Subprogram); else Ada.Exceptions.Raise_Exception (Raising_If_False, Module & "." & From_Subprogram & ": " & Reason_Message (With_Reason)); end if; end if; end Assert; procedure Report (The_Exception : Ada.Exceptions.Exception_Occurrence; To : Ada.Text_IO.File_Type := Ada.Text_IO.Standard_Output) is use Ada.Text_IO; begin if Ada.Exceptions.Exception_Message (The_Exception)'Length = 0 then Put_Line (File => To, Item => "Exception " & Ada.Exceptions.Exception_Name (The_Exception) & " occurred."); else Put_Line (File => To, Item => "Exception " & Ada.Exceptions.Exception_Name (The_Exception) & " (" & Ada.Exceptions.Exception_Message (The_Exception) & ") occurred."); end if; end Report; end BC.Support.Exceptions; xia-1.00/booch4xia/bc-support-exceptions.ads0100644000076600007670000000463610212333762017734 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-support-exceptions.ads,v $ -- $Revision: 1.5.2.1 $ -- $Date: 2002/12/26 14:48:11 $ -- $Author: simon $ with Ada.Exceptions; with Ada.Text_IO; package BC.Support.Exceptions is pragma Elaborate_Body; -- These codes are shorthand for standard messages type Reason is (No_Reason_Given, Disjoint, Duplicate, Empty, Full, Illegal, Invalid_Index, Invalid_Number, Missing, Not_Empty, Not_Root, Is_Null, Out_Of_Memory, Referenced, Timing, Too_Large, Too_Small); generic Module : String; procedure Assert (Condition : Boolean; Raising_If_False : Ada.Exceptions.Exception_Id; From_Subprogram : String; With_Reason : Reason := No_Reason_Given); pragma Inline (Assert); procedure Report (The_Exception : Ada.Exceptions.Exception_Occurrence; To : Ada.Text_IO.File_Type := Ada.Text_IO.Standard_Output); end BC.Support.Exceptions; xia-1.00/booch4xia/bc-support-hash_tables.adb0100644000076600007670000002135710212333762020006 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-support-hash_tables.adb,v $ -- $Revision: 1.12.2.6 $ -- $Date: 2002/12/26 14:48:12 $ -- $Author: simon $ with Ada.Exceptions; with BC.Support.Exceptions; package body BC.Support.Hash_Tables is package BSE renames BC.Support.Exceptions; procedure Assert is new BSE.Assert ("BC.Support.Hash_Tables"); package body Tables is function "=" (L, R : Table) return Boolean is begin -- optimisation if L, R are the same Table? if L.Size = R.Size then for B in 1 .. L.Number_Of_Buckets loop for Index in 1 .. Items.Length (L.Items (B)) loop declare This_Item : Items.Item renames Items.Item_At (L.Items (B), Index); function "=" (L, R : Values.Value) return Boolean renames Values."="; -- There seems to be a problem wrt the 'function "=" -- (L, R : Values.Value) return Boolean"'. This version -- works with GNAT 3.12, OA & APEX. Other versions (eg, -- 'use type Values.Value', 'Values."="') cause -- problems with one or the other. begin if not Is_Bound (R, This_Item) or else not (Values.Item_At (L.Values (B), Index) = Value_Of (R, This_Item)) then return False; end if; end; end loop; end loop; return True; else return False; end if; end "="; procedure Clear (T : in out Table) is begin for B in 1 .. T.Number_Of_Buckets loop Items.Clear (T.Items (B)); Values.Clear (T.Values (B)); T.Size := 0; end loop; end Clear; procedure Bind (T : in out Table; I : Items.Item; V : Values.Value) is Bucket : constant Positive := (Items.Hash (I) mod T.Number_Of_Buckets) + 1; begin Assert (Items.Location (T.Items (Bucket), I, 1) = 0, BC.Duplicate'Identity, "Bind", BSE.Duplicate); Items.Insert (T.Items (Bucket), I); Values.Insert (T.Values (Bucket), V); T.Size := T.Size + 1; end Bind; procedure Rebind (T : in out Table; I : Items.Item; V : Values.Value) is Bucket : constant Positive := (Items.Hash (I) mod T.Number_Of_Buckets) + 1; Index : constant Natural := Items.Location (T.Items (Bucket), I, 1); begin Assert (Index /= 0, BC.Not_Found'Identity, "Rebind", BSE.Missing); Values.Replace (T.Values (Bucket), Index, V); end Rebind; procedure Unbind (T : in out Table; I : Items.Item) is Bucket : constant Positive := (Items.Hash (I) mod T.Number_Of_Buckets) + 1; Index : constant Natural := Items.Location (T.Items (Bucket), I, 1); begin Assert (Index /= 0, BC.Not_Found'Identity, "Unbind", BSE.Missing); Items.Remove (T.Items (Bucket), Index); Values.Remove (T.Values (Bucket), Index); T.Size := T.Size - 1; end Unbind; function Extent (T : Table) return Natural is begin return T.Size; end Extent; function Is_Bound (T : Table; I : Items.Item) return Boolean is Bucket : constant Positive := (Items.Hash (I) mod T.Number_Of_Buckets) + 1; begin return Items.Location (T.Items (Bucket), I, 1) /= 0; end Is_Bound; function Value_Of (T : Table; I : Items.Item) return Values.Value is Bucket : constant Positive := (Items.Hash (I) mod T.Number_Of_Buckets) + 1; Index : constant Natural := Items.Location (T.Items (Bucket), I, 1); begin Assert (Index /= 0, BC.Not_Found'Identity, "Value_Of", BSE.Missing); return Values.Item_At (T.Values (Bucket), Index); end Value_Of; procedure Reset (T : Table; Bucket : out Positive; Index : out Positive) is begin if T.Size = 0 then Bucket := T.Number_Of_Buckets + 1; Index := Positive'Last; -- we have to ensure it's > 0 else Bucket := 1; loop exit when Bucket > T.Number_Of_Buckets; if Items.Length (T.Items (Bucket)) > 0 then Index := 1; return; end if; Bucket := Bucket + 1; end loop; Ada.Exceptions.Raise_Exception (Program_Error'Identity, "BC.Support.Hash_Tables.Reset: no items found"); end if; end Reset; function Is_Done (T : Table; Bucket : Positive; Index : Positive) return Boolean is pragma Warnings (Off, Index); begin return Bucket > T.Number_Of_Buckets; end Is_Done; function Current_Item_Ptr (T : Table; Bucket : Positive; Index : Positive) return Items.Item_Ptr is begin Assert (Bucket <= T.Number_Of_Buckets, BC.Not_Found'Identity, "Current_Item_Ptr", BSE.Missing); return Items.Item_At (T.Items (Bucket), Index); end Current_Item_Ptr; function Current_Value_Ptr (T : Table; Bucket : Positive; Index : Positive) return Values.Value_Ptr is begin Assert (Bucket <= T.Number_Of_Buckets, BC.Not_Found'Identity, "Current_Value_Ptr", BSE.Missing); return Values.Item_At (T.Values (Bucket), Index); end Current_Value_Ptr; procedure Delete_Item_At (T : in out Table; Bucket : in out Positive; Index : in out Positive) is begin Assert (Bucket <= T.Number_Of_Buckets, BC.Not_Found'Identity, "Delete_Item_At", BSE.Missing); Items.Remove (T.Items (Bucket), Index); Values.Remove (T.Values (Bucket), Index); if Index > Items.Length (T.Items (Bucket)) then loop Bucket := Bucket + 1; exit when Bucket > T.Number_Of_Buckets; if Items.Length (T.Items (Bucket)) > 0 then Index := 1; exit; end if; end loop; end if; T.Size := T.Size - 1; end Delete_Item_At; procedure Next (T : Table; Bucket : in out Positive; Index : in out Positive) is begin Assert (Bucket <= T.Number_Of_Buckets, BC.Not_Found'Identity, "Next", BSE.Missing); if Items.Length (T.Items (Bucket)) > Index then Index := Index + 1; else loop Bucket := Bucket + 1; exit when Bucket > T.Number_Of_Buckets; if Items.Length (T.Items (Bucket)) > 0 then Index := 1; exit; end if; end loop; end if; end Next; end Tables; end BC.Support.Hash_Tables; xia-1.00/booch4xia/bc-support-hash_tables.ads0100644000076600007670000001746010212333762020027 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-support-hash_tables.ads,v $ -- $Revision: 1.9.2.3 $ -- $Date: 2002/12/26 14:48:14 $ -- $Author: simon $ package BC.Support.Hash_Tables is pragma Elaborate_Body; -- In the generic signature packages, Item denotes the universe -- from which the hash table draws its items. Value denotes the -- universe from which the hash table draws its values. Items and -- Values may be either primitive types or user-defined -- non-limited types. -- Item_Container and Value_Container provide the concrete -- container for each bucket. These types will normally be -- provided by instantiations of the bounded, dynamic, and -- unbounded support packages defined for this library. generic type Item is private; type Item_Ptr is access all Item; with function "=" (L, R : Item) return Boolean is <>; with function Hash (V : Item) return Natural is <>; type Item_Container is private; -- The <> subprograms for Items are provided by one of -- BC.Support.Bounded, Dynamic or Unbounded as appropriate. with procedure Clear (C : in out Item_Container) is <>; with procedure Insert (C : in out Item_Container; I : Item) is <>; with procedure Append (C : in out Item_Container; I : Item) is <>; with procedure Remove (C : in out Item_Container; From : Positive) is <>; with procedure Replace (C : in out Item_Container; Index : Positive; I : Item) is <>; with function Length (C : Item_Container) return Natural is <>; with function Item_At (C : Item_Container; Index : Positive) return Item is <>; with function Item_At (C : Item_Container; Index : Positive) return Item_Ptr is <>; with function Location (C : Item_Container; I : Item; Start : Positive) return Natural is <>; package Item_Signature is end Item_Signature; generic type Value is private; type Value_Ptr is access all Value; with function "=" (L, R : Value) return Boolean is <>; type Value_Container is private; -- The <> subprograms for Values are provided by one of -- BC.Support.Bounded, Dynamic or Unbounded as appropriate. with procedure Clear (C : in out Value_Container) is <>; with procedure Insert (C : in out Value_Container; V : Value) is <>; with procedure Append (C : in out Value_Container; V : Value) is <>; with procedure Remove (C : in out Value_Container; From : Positive) is <>; with procedure Replace (C : in out Value_Container; Index : Positive; V : Value) is <>; with function Length (C : Value_Container) return Natural is <>; with function Item_At (C : Value_Container; Index : Positive) return Value is <>; with function Item_At (C : Value_Container; Index : Positive) return Value_Ptr is <>; with function Location (C : Value_Container; V : Value; Start : Positive) return Natural is <>; package Value_Signature is end Value_Signature; generic with package Items is new Item_Signature (<>); with package Values is new Value_Signature (<>); package Tables is -- The type Table represents an open hash table whose buckets -- may be formed by bounded, dynamic, or unbounded -- containers. Each table contains n buckets, wherein each -- bucket is a container of item/value pairs. To insert, -- remove, or locate a pair in the table, the operation first -- generates a hash value upon the item to select a specific -- bucket, and then the given operation is performed upon the -- selected container. -- This is a low-level abstraction that specifies no policies -- for the order in which items may be added and removed from -- the container. This class is not intended to be subclassed. type Item_Array is array (Positive range <>) of Items.Item_Container; type Value_Array is array (Positive range <>) of Values.Value_Container; type Table (Number_Of_Buckets : Positive) is record Items : Item_Array (1 .. Number_Of_Buckets); Values : Value_Array (1 .. Number_Of_Buckets); Size : Natural := 0; end record; function "=" (L, R : Table) return Boolean; procedure Clear (T : in out Table); -- Empty the hash table of all item/value pairs. procedure Bind (T : in out Table; I : Items.Item; V : Values.Value); -- Generate a hash value for the item to select a bucket. If -- the item already exists in that bucket, raise BC.Duplicate; -- otherwise, insert the Item/value pair in the selected -- container. procedure Rebind (T : in out Table; I : Items.Item; V : Values.Value); -- Generate a hash value for the item to select a bucket. If -- the item already exists in that bucket, change the item's -- corresponding value; otherwise, raise BC.Not_Found. procedure Unbind (T : in out Table; I : Items.Item); -- Generate a hash value for the item to select a bucket. If -- the item already exists in that bucket, remove the -- item/value pair; otherwise, BC.Not_Found. function Extent (T : Table) return Natural; -- Return the number of item/value pairs in the hash table. function Is_Bound (T : Table; I : Items.Item) return Boolean; -- Return True if the item has a binding in the hash table; -- otherwise, return False. function Value_Of (T : Table; I : Items.Item) return Values.Value; -- If the item does not have a binding in the hash table, raise -- BC.Not_Found; otherwise, return the value corresponding to -- this item. -- Iterator support procedure Reset (T : Table; Bucket : out Positive; Index : out Positive); function Is_Done (T : Table; Bucket : Positive; Index : Positive) return Boolean; function Current_Item_Ptr (T : Table; Bucket : Positive; Index : Positive) return Items.Item_Ptr; function Current_Value_Ptr (T : Table; Bucket : Positive; Index : Positive) return Values.Value_Ptr; procedure Delete_Item_At (T : in out Table; Bucket : in out Positive; Index : in out Positive); procedure Next (T : Table; Bucket : in out Positive; Index : in out Positive); end Tables; end BC.Support.Hash_Tables; xia-1.00/booch4xia/bc-support-standard_storage.ads0100644000076600007670000000300410212333762021063 0ustar g315padadev-- Copyright 2001 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-support-standard_storage.ads,v $ -- $Revision: 1.3.2.1 $ -- $Date: 2002/12/26 14:48:18 $ -- $Author: simon $ with System.Storage_Pools; package BC.Support.Standard_Storage is type T is access Integer; -- arbitrary subtype Pool : System.Storage_Pools.Root_Storage_Pool'Class renames T'Storage_Pool; end BC.Support.Standard_Storage; xia-1.00/booch4xia/bc-support-unbounded.adb0100644000076600007670000003226010212333762017507 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-support-unbounded.adb,v $ -- $Revision: 1.17.2.1 $ -- $Date: 2002/12/26 14:48:23 $ -- $Author: simon $ with Ada.Unchecked_Deallocation; with BC.Support.Exceptions; with System.Address_To_Access_Conversions; package body BC.Support.Unbounded is package BSE renames BC.Support.Exceptions; procedure Assert is new BSE.Assert ("BC.Support.Unbounded"); -- We can't take 'Access of components of constant (in parameter) -- objects; but we need to be able to do this so that we can -- update the cache (which doesn't violate the abstraction, just -- the Ada restriction). This technique is due to Matthew Heaney. package Allow_Access is new System.Address_To_Access_Conversions (Unb_Node); -- We can't take 'Access of non-aliased components. But if we -- alias discriminated objects they become constrained - even if -- the discriminant has a default. package Allow_Element_Access is new System.Address_To_Access_Conversions (Item); function Create (I : Item; Previous, Next : Node_Ref) return Node_Ref; pragma Inline (Create); function Create (I : Item; Previous, Next : Node_Ref) return Node_Ref is Result : Node_Ref; begin Result := new Node'(Element => I, Previous => Previous, Next => Next); if Previous /= null then Previous.Next := Result; end if; if Next /= null then Next.Previous := Result; end if; return Result; end Create; procedure Delete_Node is new Ada.Unchecked_Deallocation (Node, Node_Ref); procedure Update_Cache (Obj : in out Unb_Node; Index : Positive); procedure Update_Cache (Obj : in out Unb_Node; Index : Positive) is begin Assert (Index <= Obj.Size, BC.Range_Error'Identity, "Update_Cache", BSE.Invalid_Index); if Obj.Cache /= null then if Index = Obj.Cache_Index then return; elsif Index = Obj.Cache_Index + 1 then Obj.Cache := Obj.Cache.Next; Obj.Cache_Index := Index; return; elsif Index = Obj.Cache_Index - 1 then Obj.Cache := Obj.Cache.Previous; Obj.Cache_Index := Index; return; end if; end if; declare Ptr : Node_Ref := Obj.Rep; begin for I in 1 .. Index - 1 loop Ptr := Ptr.Next; end loop; Obj.Cache := Ptr; Obj.Cache_Index := Index; end; end Update_Cache; function "=" (Left, Right : in Unb_Node) return Boolean is begin if Left.Size = Right.Size then declare Temp_L : Node_Ref := Left.Rep; Temp_R : Node_Ref := Right.Rep; begin while Temp_L /= null loop if Temp_L.Element /= Temp_R.Element then return False; end if; Temp_L := Temp_L.Next; Temp_R := Temp_R.Next; end loop; return True; end; else return False; end if; end "="; procedure Clear (Obj : in out Unb_Node) is Empty_Node : Unb_Node; Ptr : Node_Ref; begin while Obj.Rep /= null loop Ptr := Obj.Rep; Obj.Rep := Obj.Rep.Next; Delete_Node (Ptr); end loop; Obj := Empty_Node; end Clear; procedure Insert (Obj : in out Unb_Node; Elem : Item) is begin Obj.Rep := Create (Elem, Previous => null, Next => Obj.Rep); if Obj.Last = null then Obj.Last := Obj.Rep; end if; Obj.Size := Obj.Size + 1; Obj.Cache := Obj.Rep; Obj.Cache_Index := 1; end Insert; procedure Insert (Obj : in out Unb_Node; Elem : Item; Before : Positive) is begin Assert (Before <= Obj.Size, BC.Range_Error'Identity, "Insert", BSE.Invalid_Index); if Obj.Size = 0 or else Before = 1 then Insert (Obj, Elem); else declare Temp_Node : Node_Ref; begin Update_Cache (Obj, Before); Temp_Node := Create (Elem, Previous => Obj.Cache.Previous, Next => Obj.Cache); if Temp_Node.Previous = null then Obj.Rep := Temp_Node; end if; Obj.Size := Obj.Size + 1; Obj.Cache := Temp_Node; end; end if; end Insert; procedure Append (Obj : in out Unb_Node; Elem : Item) is begin Obj.Last := Create (Elem, Previous => Obj.Last, Next => null); if Obj.Last.Previous /= null then Obj.Last.Previous.Next := Obj.Last; end if; if Obj.Rep = null then Obj.Rep := Obj.Last; end if; Obj.Size := Obj.Size + 1; Obj.Cache := Obj.Last; Obj.Cache_Index := Obj.Size; end Append; procedure Append (Obj : in out Unb_Node; Elem : Item; After : Positive) is begin Assert (After <= Obj.Size, BC.Range_Error'Identity, "Append", BSE.Invalid_Index); if Obj.Size = 0 then Append (Obj, Elem); else declare Temp_Node : Node_Ref; begin Update_Cache (Obj, After); Temp_Node := Create (Elem, Previous => Obj.Cache, Next => Obj.Cache.Next); if Temp_Node.Previous /= null then Temp_Node.Previous.Next := Temp_Node; end if; if Temp_Node.Next = null then Obj.Last := Temp_Node; end if; Obj.Size := Obj.Size + 1; Obj.Cache := Temp_Node; Obj.Cache_Index := Obj.Cache_Index + 1; end; end if; end Append; procedure Remove (Obj : in out Unb_Node; From : Positive) is begin Assert (From <= Obj.Size, BC.Range_Error'Identity, "Remove", BSE.Invalid_Index); Assert (Obj.Size > 0, BC.Underflow'Identity, "Remove", BSE.Empty); if Obj.Size = 1 then Clear (Obj); else declare Ptr : Node_Ref; begin Update_Cache (Obj, From); Ptr := Obj.Cache; if Ptr.Previous = null then Obj.Rep := Ptr.Next; else Ptr.Previous.Next := Ptr.Next; end if; if Ptr.Next = null then Obj.Last := Ptr.Previous; else Ptr.Next.Previous := Ptr.Previous; end if; Obj.Size := Obj.Size - 1; if Ptr.Next /= null then Obj.Cache := Ptr.Next; elsif Ptr.Previous /= null then Obj.Cache := Ptr.Previous; Obj.Cache_Index := Obj.Cache_Index - 1; else Obj.Cache := null; Obj.Cache_Index := 0; end if; Delete_Node (Ptr); end; end if; end Remove; procedure Replace (Obj : in out Unb_Node; Index : Positive; Elem : Item) is begin Assert (Index <= Obj.Size, BC.Range_Error'Identity, "Replace", BSE.Invalid_Index); if not ((Obj.Cache /= null) and then (Index = Obj.Cache_Index)) then declare Ptr : Node_Ref := Obj.Rep; begin for I in 1 .. Obj.Size loop if I = Index then Obj.Cache := Ptr; Obj.Cache_Index := I; exit; else Ptr := Ptr.Next; end if; end loop; end; end if; Obj.Cache.Element := Elem; end Replace; function Length (Obj : Unb_Node) return Natural is begin return Obj.Size; end Length; function First (Obj : Unb_Node) return Item is begin Assert (Obj.Size > 0, BC.Underflow'Identity, "First", BSE.Empty); return Obj.Rep.Element; end First; function Last (Obj : Unb_Node) return Item is begin Assert (Obj.Size > 0, BC.Underflow'Identity, "Last", BSE.Empty); return Obj.Last.Element; end Last; function Item_At (Obj : Unb_Node; Index : Positive) return Item is Tmp : Item_Ptr; begin Assert (Index <= Obj.Size, BC.Range_Error'Identity, "Item_At", BSE.Invalid_Index); Tmp := Item_At (Obj, Index); return Tmp.all; end Item_At; function Item_At (Obj : Unb_Node; Index : Positive) return Item_Ptr is U : Allow_Access.Object_Pointer := Allow_Access.To_Pointer (Obj'Address); -- Note, although (GNAT 3.11p) the value in Obj is successfully -- updated via U, the optimiser can get fooled; when we return -- next/previous cache hits, we must return via U. I don't -- think this is a bug; the pointer aliasing is a nasty trick, -- after all. begin Assert (Index <= Obj.Size, BC.Range_Error'Identity, "Item_At", BSE.Invalid_Index); Update_Cache (U.all, Index); return Item_Ptr (Allow_Element_Access.To_Pointer (U.Cache.Element'Address)); end Item_At; function Location (Obj : Unb_Node; Elem : Item; Start : Positive := 1) return Natural is Ptr : Node_Ref := Obj.Rep; U : Allow_Access.Object_Pointer := Allow_Access.To_Pointer (Obj'Address); begin -- XXX the C++ (which indexes from 0) nevertheless checks -- "start <= count". We have to special-case the empty Node; -- the C++ indexes from 0, so it can legally start with index 0 -- when the Node is empty. if Obj.Size = 0 then return 0; end if; Assert (Start <= Obj.Size, BC.Range_Error'Identity, "Location", BSE.Invalid_Index); if (Start = Obj.Cache_Index) and then (Elem = Obj.Cache.Element) then return Obj.Cache_Index; end if; for I in 1 .. Start - 1 loop Ptr := Ptr.Next; -- advance to Start point end loop; for I in Start .. Obj.Size loop if Ptr.Element = Elem then U.Cache := Ptr; U.Cache_Index := I; return I; else Ptr := Ptr.Next; end if; end loop; return 0; end Location; procedure Adjust (U : in out Unb_Node) is Tmp : Node_Ref := U.Last; begin if Tmp /= null then U.Last := Create (Tmp.Element, Previous => null, Next => null); U.Rep := U.Last; Tmp := Tmp.Previous; -- move to previous node from orig list while Tmp /= null loop U.Rep := Create (Tmp.Element, Previous => null, Next => U.Rep); Tmp := Tmp.Previous; end loop; end if; U.Cache := null; U.Cache_Index := 0; end Adjust; procedure Finalize (U : in out Unb_Node) is Ptr : Node_Ref; begin -- code to delete Rep copied from Clear() while U.Rep /= null loop Ptr := U.Rep; U.Rep := U.Rep.Next; Delete_Node (Ptr); end loop; end Finalize; procedure Write_Unb_Node (Stream : access Ada.Streams.Root_Stream_Type'Class; Obj : Unb_Node) is N : Node_Ref := Obj.Rep; begin Integer'Write (Stream, Obj.Size); while N /= null loop Item'Output (Stream, N.Element); N := N.Next; end loop; end Write_Unb_Node; procedure Read_Unb_Node (Stream : access Ada.Streams.Root_Stream_Type'Class; Obj : out Unb_Node) is Count : Integer; begin Clear (Obj); Integer'Read (Stream, Count); for I in 1 .. Count loop declare Elem : constant Item := Item'Input (Stream); begin Append (Obj, Elem); end; end loop; end Read_Unb_Node; end BC.Support.Unbounded; xia-1.00/booch4xia/bc-support-unbounded.ads0100644000076600007670000001025010212333762017523 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1994-1997 David Weller -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-support-unbounded.ads,v $ -- $Revision: 1.15.2.1 $ -- $Date: 2002/12/26 14:48:24 $ -- $Author: simon $ with Ada.Finalization; with Ada.Streams; with System.Storage_Pools; generic type Item is private; with function "=" (L, R : Item) return Boolean is <>; type Item_Ptr is access all Item; Storage : in out System.Storage_Pools.Root_Storage_Pool'Class; package BC.Support.Unbounded is pragma Elaborate_Body; type Unb_Node is private; -- An unpacked container whose items are stored on the heap. -- Items are effectively indexed from 1. function "=" (Left, Right : Unb_Node) return Boolean; procedure Clear (Obj : in out Unb_Node); -- Empty the container of all Items procedure Insert (Obj : in out Unb_Node; Elem : Item); -- Add an item to the front of the container procedure Insert (Obj : in out Unb_Node; Elem : Item; Before : Positive); -- Add an item to the container, before the given index procedure Append (Obj : in out Unb_Node; Elem : Item); -- Add an item to the end of the container procedure Append (Obj : in out Unb_Node; Elem : Item; After : Positive); -- Add an item to the container, after the given index procedure Remove (Obj : in out Unb_Node; From : Positive); -- Remove the item at the given index procedure Replace (Obj : in out Unb_Node; Index : Positive; Elem : Item); -- Replace the item at index with the new elem function Length (Obj : Unb_Node) return Natural; -- Returns the number of items in the container function First (Obj : Unb_Node) return Item; -- Returns the item at the front of the container function Last (Obj : Unb_Node) return Item; -- Returns the item at the end of the container function Item_At (Obj : Unb_Node; Index : Positive) return Item; function Item_At (Obj : Unb_Node; Index : Positive) return Item_Ptr; -- Returns the item at the given index function Location (Obj : Unb_Node; Elem : Item; Start : Positive := 1) return Natural; -- Returns the first index in which the given item is -- found. Returns 0 if unsuccessful. private type Node; type Node_Ref is access Node; for Node_Ref'Storage_Pool use Storage; type Node is record Element : Item; Next : Node_Ref; Previous : Node_Ref; end record; type Unb_Node is new Ada.Finalization.Controlled with record Rep : Node_Ref; Last : Node_Ref; Size : Natural := 0; Cache : Node_Ref; Cache_Index : Natural := 0; -- 0 means invalid end record; procedure Adjust (U : in out Unb_Node); procedure Finalize (U : in out Unb_Node); procedure Write_Unb_Node (Stream : access Ada.Streams.Root_Stream_Type'Class; Obj : Unb_Node); procedure Read_Unb_Node (Stream : access Ada.Streams.Root_Stream_Type'Class; Obj : out Unb_Node); for Unb_Node'Write use Write_Unb_Node; for Unb_Node'Read use Read_Unb_Node; end BC.Support.Unbounded; xia-1.00/booch4xia/booch4xia.README0100644000076600007670000000035510212333762015517 0ustar g315padadevThis directory contains the subset of Booch components necessary to compile and run XPath in Ada (XIA). The complete set of Booch components is maintained by Simon Wright and is available at http://www.pogner.demon.co.uk/components/bc. xia-1.00/booch4xia/bc-containers-collections.adb0100644000076600007670000001115110212333762020467 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-collections.adb,v $ -- $Revision: 1.10.2.1 $ -- $Date: 2002/12/29 12:22:30 $ -- $Author: simon $ with System; package body BC.Containers.Collections is function Are_Equal (Left, Right : Abstract_Collection'Class) return Boolean is begin if System."=" (Left'Address, Right'Address) then return True; end if; if Length (Left) /= Length (Right) then return False; end if; declare Left_Iter : Iterator'Class := New_Iterator (Left); Right_Iter : Iterator'Class := New_Iterator (Right); begin while not Is_Done (Left_Iter) and then not Is_Done (Right_Iter) loop if Current_Item (Left_Iter) /= Current_Item (Right_Iter) then return False; end if; Next (Left_Iter); Next (Right_Iter); end loop; return True; end; end Are_Equal; procedure Copy (From : Abstract_Collection'Class; To : in out Abstract_Collection'Class) is Iter : Iterator'Class := New_Iterator (From); begin if System."/=" (From'Address, To'Address) then Clear (To); Reset (Iter); while not Is_Done (Iter) loop -- doing Append will preserve ordering of equal-key items -- in Ordered Collections. Append (To, Current_Item (Iter)); Next (Iter); end loop; end if; end Copy; function Available (C : Abstract_Collection) return Natural is pragma Warnings (Off, C); begin return Natural'Last; end Available; procedure Lock (C : in out Abstract_Collection) is pragma Warnings (Off, C); begin null; end Lock; procedure Unlock (C : in out Abstract_Collection) is pragma Warnings (Off, C); begin null; end Unlock; procedure Reset (It : in out Collection_Iterator) is C : Abstract_Collection'Class renames Abstract_Collection'Class (It.For_The_Container.all); begin if Length (C) = 0 then It.Index := 0; else It.Index := 1; end if; end Reset; function Is_Done (It : Collection_Iterator) return Boolean is C : Abstract_Collection'Class renames Abstract_Collection'Class (It.For_The_Container.all); begin return It.Index = 0 or else It.Index > Length (C); end Is_Done; procedure Next (It : in out Collection_Iterator) is begin It.Index := It.Index + 1; end Next; function Current_Item (It : Collection_Iterator) return Item is C : Abstract_Collection'Class renames Abstract_Collection'Class (It.For_The_Container.all); begin if Is_Done (It) then raise BC.Not_Found; end if; return Item_At (C, It.Index).all; end Current_Item; function Current_Item_Ptr (It : Collection_Iterator) return Item_Ptr is C : Abstract_Collection'Class renames Abstract_Collection'Class (It.For_The_Container.all); begin if Is_Done (It) then raise BC.Not_Found; end if; return Item_At (C, It.Index); end Current_Item_Ptr; procedure Delete_Item_At (It : in out Collection_Iterator) is C : Abstract_Collection'Class renames Abstract_Collection'Class (It.For_The_Container.all); begin if Is_Done (It) then raise BC.Not_Found; end if; Remove (C, It.Index); end Delete_Item_At; end BC.Containers.Collections; xia-1.00/booch4xia/bc-containers-collections.ads0100644000076600007670000001220610212333762020512 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-collections.ads,v $ -- $Revision: 1.9.2.1 $ -- $Date: 2002/12/29 12:22:31 $ -- $Author: simon $ generic package BC.Containers.Collections is pragma Elaborate_Body; type Abstract_Collection is abstract new Container with private; -- A collection denotes an indexed collection of items, drawn from -- some well-defined universe. A collection may contain duplicate -- items; a collection owns a copy of each item. function Are_Equal (Left, Right : Abstract_Collection'Class) return Boolean; -- Return True if and only if both collections have the same -- extent and the same items in the same order; return False -- otherwise. Can't call this "=" because of the standard one for -- Collection. procedure Copy (From : Abstract_Collection'Class; To : in out Abstract_Collection'Class); -- This operation MUST be called for dissimilar Collections in -- place of assignment. procedure Clear (C : in out Abstract_Collection) is abstract; -- Empty the collection of all items. procedure Insert (C : in out Abstract_Collection; Elem : Item) is abstract; -- Add the item to the front of the collection. procedure Insert (C : in out Abstract_Collection; Elem : Item; Before : Positive) is abstract; -- Add the item before the given index item in the collection; if -- before is 1, the item is added to the front of the collection. procedure Append (C : in out Abstract_Collection; Elem : Item) is abstract; -- Add the item at the end of the collection. procedure Append (C : in out Abstract_Collection; Elem : Item; After : Positive) is abstract; -- Add the item after the given index item in the collection. procedure Remove (C : in out Abstract_Collection; At_Index : Positive) is abstract; -- Remove the item at the given index in the collection. procedure Replace (C : in out Abstract_Collection; At_Index : Positive; Elem : Item) is abstract; -- Replace the item at the given index with the given item. function Available (C : Abstract_Collection) return Natural; -- Indicated number of empty "Item slots" left in the collection. function Length (C : Abstract_Collection) return Natural is abstract; -- Return the number of items in the collection. function Is_Empty (C : Abstract_Collection) return Boolean is abstract; -- Return True if and only if there are no items in the -- collection. function First (C : Abstract_Collection) return Item is abstract; -- Return a copy of the item at the front of the collection. function Last (C : Abstract_Collection) return Item is abstract; -- Return a copy of the item at the end of the collection. function Item_At (C : Abstract_Collection; At_Index : Positive) return Item is abstract; -- Return a copy of the item at the indicated position in the -- collection. function Location (C : Abstract_Collection; Elem : Item) return Natural is abstract; -- Return the first index at which the item is found (0 if the -- item desn't exist in the collecton). private type Abstract_Collection is abstract new Container with null record; procedure Lock (C : in out Abstract_Collection); procedure Unlock (C : in out Abstract_Collection); type Collection_Iterator is new Iterator with record Index : Natural; end record; -- Overriding primitive supbrograms of the concrete actual Iterator. procedure Reset (It : in out Collection_Iterator); procedure Next (It : in out Collection_Iterator); function Is_Done (It : Collection_Iterator) return Boolean; function Current_Item (It : Collection_Iterator) return Item; function Current_Item_Ptr (It : Collection_Iterator) return Item_Ptr; procedure Delete_Item_At (It : in out Collection_Iterator); end BC.Containers.Collections; xia-1.00/booch4xia/bc-containers-collections-ordered.ads0100644000076600007670000000357310212333762022143 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-collections-ordered.ads,v $ -- $Revision: 1.4.2.1 $ -- $Date: 2002/12/29 12:22:36 $ -- $Author: simon $ generic with function "<" (L, R : Item) return Boolean is <>; package BC.Containers.Collections.Ordered is type Abstract_Ordered_Collection is abstract new Abstract_Collection with private; -- An ordered collection denotes a sorted indexed collection of -- items, drawn from some well-defined universe. An ordered -- collection may contain duplicate items; it owns a copy of each -- item. private type Abstract_Ordered_Collection is abstract new Abstract_Collection with null record; end BC.Containers.Collections.Ordered; xia-1.00/booch4xia/bc-containers-collections-unbounded.adb0100644000076600007670000001030510212333762022450 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-collections-unbounded.adb,v $ -- $Revision: 1.8.2.1 $ -- $Date: 2002/12/29 12:22:43 $ -- $Author: simon $ with System.Address_To_Access_Conversions; package body BC.Containers.Collections.Unbounded is function "=" (Left, Right : in Collection) return Boolean is use Collection_Nodes; begin return Left.Rep = Right.Rep; end "="; procedure Clear (C : in out Collection) is begin Collection_Nodes.Clear (C.Rep); end Clear; procedure Insert (C : in out Collection; Elem : Item) is begin Collection_Nodes.Insert (C.Rep, Elem); end Insert; procedure Insert (C : in out Collection; Elem : Item; Before : Positive) is begin Collection_Nodes.Insert (C.Rep, Elem, Before); end Insert; procedure Append (C : in out Collection; Elem : Item) is begin Collection_Nodes.Append (C.Rep, Elem); end Append; procedure Append (C : in out Collection; Elem : Item; After : Positive) is begin Collection_Nodes.Append (C.Rep, Elem, After); end Append; procedure Remove (C : in out Collection; At_Index : Positive) is begin Collection_Nodes.Remove (C.Rep, At_Index); end Remove; procedure Replace (C : in out Collection; At_Index : Positive; Elem : Item) is begin Collection_Nodes.Replace (C.Rep, At_Index, Elem); end Replace; function Length (C : Collection) return Natural is begin return Collection_Nodes.Length (C.Rep); end Length; function Is_Empty (C : Collection) return Boolean is begin return Collection_Nodes.Length (C.Rep) = 0; end Is_Empty; function First (C : Collection) return Item is begin return Collection_Nodes.First (C.Rep); end First; function Last (C : Collection) return Item is begin return Collection_Nodes.Last (C.Rep); end Last; function Item_At (C : Collection; At_Index : Positive) return Item is begin return Item_At (C, At_Index).all; end Item_At; function Location (C : Collection; Elem : Item) return Natural is begin return Collection_Nodes.Location (C.Rep, Elem); end Location; package Address_Conversions is new System.Address_To_Access_Conversions (Collection); function New_Iterator (For_The_Collection : Collection) return Iterator'Class is Result : Collection_Iterator; begin Result.For_The_Container := Address_Conversions.To_Pointer (For_The_Collection'Address).all'Access; Reset (Result); return Result; end New_Iterator; function Item_At (C : Collection; Index : Positive) return Item_Ptr is begin return Collection_Nodes.Item_At (C.Rep, Index); end Item_At; Empty_Container : Collection; pragma Warnings (Off, Empty_Container); function Null_Container return Collection is begin return Empty_Container; end Null_Container; end BC.Containers.Collections.Unbounded; xia-1.00/booch4xia/bc-containers-collections-unbounded.ads0100644000076600007670000001010710212333762022471 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-collections-unbounded.ads,v $ -- $Revision: 1.10.2.1 $ -- $Date: 2002/12/29 12:22:44 $ -- $Author: simon $ with BC.Support.Unbounded; with System.Storage_Pools; generic Storage : in out System.Storage_Pools.Root_Storage_Pool'Class; package BC.Containers.Collections.Unbounded is pragma Elaborate_Body; type Collection is new Abstract_Collection with private; function Null_Container return Collection; function "=" (Left, Right : in Collection) return Boolean; procedure Clear (C : in out Collection); -- Empty the collection of all items. procedure Insert (C : in out Collection; Elem : Item); -- Add the item to the front of the collection. procedure Insert (C : in out Collection; Elem : Item; Before : Positive); -- Add the item before the given index item in the collection; if -- before is 1, the item is added to the front of the collection. procedure Append (C : in out Collection; Elem : Item); -- Add the item at the end of the collection. procedure Append (C : in out Collection; Elem : Item; After : Positive); -- Add the item after the given index item in the collection. procedure Remove (C : in out Collection; At_Index : Positive); -- Remove the item at the given index in the collection. procedure Replace (C : in out Collection; At_Index : Positive; Elem : Item); -- Replace the item at the given index with the given item. function Length (C : Collection) return Natural; -- Return the number of items in the collection. function Is_Empty (C : Collection) return Boolean; -- Return True if and only if there are no items in the collection. function First (C : Collection) return Item; -- Return a copy of the item at the front of the collection. function Last (C : Collection) return Item; -- Return a copy of the item at the end of the collection. function Item_At (C : Collection; At_Index : Positive) return Item; -- Return a copy of the item at the indicated position in the -- collection. function Location (C : Collection; Elem : Item) return Natural; -- Return the first index at which the item is found (0 if the -- item desn't exist in the collecton). function New_Iterator (For_The_Collection : Collection) return Iterator'Class; -- Return a reset Iterator bound to the specific Collection. private function Item_At (C : Collection; Index : Positive) return Item_Ptr; package Collection_Nodes is new BC.Support.Unbounded (Item => Item, Item_Ptr => Item_Ptr, Storage => Storage); type Collection is new Abstract_Collection with record Rep : Collection_Nodes.Unb_Node; end record; end BC.Containers.Collections.Unbounded; xia-1.00/booch4xia/bc-containers-collections-ordered-unbounded.adb0100644000076600007670000001242410212333762024076 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-collections-ordered-unbounded.adb,v $ -- $Revision: 1.8.2.1 $ -- $Date: 2002/12/29 12:22:41 $ -- $Author: simon $ with System.Address_To_Access_Conversions; package body BC.Containers.Collections.Ordered.Unbounded is function "=" (Left, Right : in Collection) return Boolean is use Collection_Nodes; begin return Left.Rep = Right.Rep; end "="; procedure Clear (C : in out Collection) is begin Collection_Nodes.Clear (C.Rep); end Clear; procedure Insert (C : in out Collection; Elem : Item) is begin for Index in 1 .. Collection_Nodes.Length (C.Rep) loop if not (Collection_Nodes.Item_At (C.Rep, Index) < Elem) then Collection_Nodes.Insert (C.Rep, Elem, Index); return; end if; end loop; Collection_Nodes.Append (C.Rep, Elem); end Insert; procedure Insert (C : in out Collection; Elem : Item; Before : Positive) is pragma Warnings (Off, Before); begin for Index in 1 .. Collection_Nodes.Length (C.Rep) loop if not (Collection_Nodes.Item_At (C.Rep, Index) < Elem) then Collection_Nodes.Insert (C.Rep, Elem, Index); return; end if; end loop; Collection_Nodes.Append (C.Rep, Elem); end Insert; procedure Append (C : in out Collection; Elem : Item) is begin for Index in 1 .. Collection_Nodes.Length (C.Rep) loop if Elem < Collection_Nodes.Item_At (C.Rep, Index) then Collection_Nodes.Insert (C.Rep, Elem, Index); return; end if; end loop; Collection_Nodes.Append (C.Rep, Elem); end Append; procedure Append (C : in out Collection; Elem : Item; After : Positive) is pragma Warnings (Off, After); begin for Index in 1 .. Collection_Nodes.Length (C.Rep) loop if Elem < Collection_Nodes.Item_At (C.Rep, Index) then Collection_Nodes.Insert (C.Rep, Elem, Index); return; end if; end loop; Collection_Nodes.Append (C.Rep, Elem); end Append; procedure Remove (C : in out Collection; At_Index : Positive) is begin Collection_Nodes.Remove (C.Rep, At_Index); end Remove; procedure Replace (C : in out Collection; At_Index : Positive; Elem : Item) is begin Collection_Nodes.Remove (C.Rep, At_Index); Insert (C, Elem); end Replace; function Length (C : Collection) return Natural is begin return Collection_Nodes.Length (C.Rep); end Length; function Is_Empty (C : Collection) return Boolean is begin return Collection_Nodes.Length (C.Rep) = 0; end Is_Empty; function First (C : Collection) return Item is begin return Collection_Nodes.First (C.Rep); end First; function Last (C : Collection) return Item is begin return Collection_Nodes.Last (C.Rep); end Last; function Item_At (C : Collection; At_Index : Positive) return Item is begin return Item_At (C, At_Index).all; end Item_At; function Location (C : Collection; Elem : Item) return Natural is begin return Collection_Nodes.Location (C.Rep, Elem); end Location; package Address_Conversions is new System.Address_To_Access_Conversions (Collection); function New_Iterator (For_The_Collection : Collection) return Iterator'Class is Result : Collection_Iterator; begin Result.For_The_Container := Address_Conversions.To_Pointer (For_The_Collection'Address).all'Access; Reset (Result); return Result; end New_Iterator; function Item_At (C : Collection; Index : Positive) return Item_Ptr is begin return Collection_Nodes.Item_At (C.Rep, Index); end Item_At; Empty_Container : Collection; pragma Warnings (Off, Empty_Container); function Null_Container return Collection is begin return Empty_Container; end Null_Container; end BC.Containers.Collections.Ordered.Unbounded; xia-1.00/booch4xia/bc-containers-collections-ordered-unbounded.ads0100644000076600007670000001005610212333762024116 0ustar g315padadev-- Copyright 1994 Grady Booch -- Copyright 1998-2002 Simon Wright -- This package is free software; you can redistribute it and/or -- modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 2, or -- (at your option) any later version. This package is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. See the GNU General Public License for more -- details. You should have received a copy of the GNU General Public -- License distributed with this package; see file COPYING. If not, -- write to the Free Software Foundation, 59 Temple Place - Suite -- 330, Boston, MA 02111-1307, USA. -- As a special exception, if other files instantiate generics from -- this unit, or you link this unit with other files to produce an -- executable, this unit does not by itself cause the resulting -- executable to be covered by the GNU General Public License. This -- exception does not however invalidate any other reasons why the -- executable file might be covered by the GNU Public License. -- $RCSfile: bc-containers-collections-ordered-unbounded.ads,v $ -- $Revision: 1.8.2.1 $ -- $Date: 2002/12/29 12:22:42 $ -- $Author: simon $ with BC.Support.Unbounded; with System.Storage_Pools; generic Storage : in out System.Storage_Pools.Root_Storage_Pool'Class; package BC.Containers.Collections.Ordered.Unbounded is pragma Elaborate_Body; type Collection is new Abstract_Ordered_Collection with private; function Null_Container return Collection; function "=" (Left, Right : in Collection) return Boolean; procedure Clear (C : in out Collection); -- Empty the collection of all items. procedure Insert (C : in out Collection; Elem : Item); -- Add the item to the collection, starting at the front. procedure Insert (C : in out Collection; Elem : Item; Before : Positive); -- Add the item to the collection, starting at the front. procedure Append (C : in out Collection; Elem : Item); -- Add the item to the collection, starting at the end. procedure Append (C : in out Collection; Elem : Item; After : Positive); -- Add the item to the collection, starting at the end. procedure Remove (C : in out Collection; At_Index : Positive); -- Remove the item at the given index in the collection. procedure Replace (C : in out Collection; At_Index : Positive; Elem : Item); -- Replace the item at the given index with the given item. function Length (C : Collection) return Natural; -- Return the number of items in the collection. function Is_Empty (C : Collection) return Boolean; -- Return True if and only if there are no items in the collection. function First (C : Collection) return Item; -- Return a copy of the item at the front of the collection. function Last (C : Collection) return Item; -- Return a copy of the item at the end of the collection. function Item_At (C : Collection; At_Index : Positive) return Item; -- Return a copy of the item at the indicated position in the -- collection. function Location (C : Collection; Elem : Item) return Natural; -- Return the first index at which the item is found (0 if the -- item desn't exist in the collecton). function New_Iterator (For_The_Collection : Collection) return Iterator'Class; -- Return a reset Iterator bound to the specific Collection. private function Item_At (C : Collection; Index : Positive) return Item_Ptr; package Collection_Nodes is new BC.Support.Unbounded (Item => Item, Item_Ptr => Item_Ptr, Storage => Storage); type Collection is new Abstract_Ordered_Collection with record Rep : Collection_Nodes.Unb_Node; end record; end BC.Containers.Collections.Ordered.Unbounded; xia-1.00/test/0040777000076600007670000000000010212452277012066 5ustar g315padadevxia-1.00/test/personal.dtd0100444000076600007670000000071210212333762014372 0ustar g315padadev xia-1.00/test/personal.xml0100444000076600007670000000256710212333762014431 0ustar g315padadev Worker One one@foo.com 21 Worker Two two@foo.com 24 Worker Three three@foo.com 32 Worker Four four@foo.com 37 Worker Five five@foo.com 41 Boss Big chief@foo.com 48 xia-1.00/test/txia0100555000076600007670000000011610212334046012737 0ustar g315padadev#!/bin/csh test_xpath < txia_tests.txt test_xpath < keyword_content_tests.txt xia-1.00/test/txia_tests.txt0100644000076600007670000001403010212452277015005 0ustar g315padadevpersonal.xml //given/.. //email //@id //@aid /personnel/person/link/attribute::subordinates personnel/person/name/family //family/ancestor::name //family/text() /personnel/person/name/family/.. ./pesonnel ./personnel personnel/person/email/preceding::name/given/text() .//* //email/following-sibling::link/@manager //email/following-sibling::link/@subordinates //@id/parent::* //given/.. //email/preceding-sibling::* //email/following-sibling::* //email/followingsibling::* //family/ancestor::person/link //name/ancestor::* //name/ancestor-or-self::* //name/descendant::* //name/descendant-or-self::* //@subordinates //@subordinates/.. //@subordinates/../preceding::* //@subordinates/../following::* .. . ..//email //person[3]/following-sibling::* //person[3]/following-sibling::*/@id[2] //person[3]/preceding-sibling::*/@id //person[3]/preceding-sibling::*[2]/@id //person[3]/preceding-sibling::*/@id[2] /personnel/person[2]/email/preceding-sibling::name/given/ancestor-or-self::*[3] //family //given //family|//given //family|//given[2] //person[last()]/@id //person[position()=2]/@id //person[position(3)=2]/@id //@id[3] //@id[true()] //@id[false()] //@id[not(position()=2)] //@id[position() >= 5] //person[3 - 1]/@id //person[3 * 2]/@id //person[5 mod 2]/@id //person[5 mod -2]/@id //person[(-5 mod 2) + 4]/@id //person[(-5 mod -2) + 2 * true()]/@id //person[round(1.1*3)]/@id //person[1 or 2]/@id //person[4 and -2]/@id //person[4 and (3 > 10)]/@id //person[position() != 3]/@id //person[3 * 1.1]/@id //person[5 - 0.0001]/@id //person[(((position() mod 2)))]/@id //person[position() mod 2 = 0]/@id //person[position() = floor(last() div 2 + 0.5) or position() = ceiling(last() div 2 + 0.5)]/@id //person[position() > 3]/@id //person[position() < 3]/@id //person[position() <= 2]/@id //person[position() div 2 + 2]/@id //person[5 + -true()]/@id //person[number("This is not a number")]/@id //person[4 div 0]/@id //person[string(number("This is not a number")) = "NaN"]/@id //person[string(number("This is not a number")) = "This is not a number"]/@id //person[string(4 div 0) = "Infinity"]/@id //person[concat(string(position()), "23") = "323"]/@id //person[starts-with(concat(string(position()), "23"), "22")]/@id //person[contains(concat(string(position()), "23", string(position()), "47"), "34")]/@id //person[substring-before(concat(string(position()), "23", string(position()), "47"), "35") = "52"]/@id //person[substring-after(concat(string(position()), "23", string(position()), "47"), "35") = "47"]/@id //person[substring(concat(string(position()), "23", string(position()), "47"), 4, 3) = "347"]/@id //person[substring(concat(string(position()), "23", string(position()), "47"), 4) = "347"]/@id //person[substring(concat(string(position()), "23", string(position()), "47"), -42, 1 div 0) = "223247"]/@id //person[substring(concat(string(position()), "23", string(position()), "47"), 0 div 0, 3) = "3"]/@id //person[substring(concat(string(position()), "23", string(position()), "47"), 0 div 0, 3) = ""]/@id //person[substring(concat(string(position()), "23", string(position()), "47"), 1.5, 2.6) = '234']/@id //person[substring(concat(string(position()), "23", string(position()), "47"), 0, 3) = '52']/@id //person[substring(concat(string(position()), "23", string(position()), "47"), -1 div 0, 1 div 0) = ""]/@id //person[(string-length(string(position())) * position()) = "4"]/@id /descendant-or-self::email/text() /descendant-or-self::email[boolean(-3)]/text() /descendant-or-self::email[boolean(35.3)]/text() /descendant-or-self::email[boolean(0)]/text() /descendant-or-self::email[boolean(0 div 0)]/text() /descendant-or-self::email[boolean(-4 div 0)]/text() /descendant-or-self::email[boolean(10 div 0)]/text() /descendant-or-self::email[boolean(string())]/text() /descendant-or-self::email[boolean(string(last()))]/text() /descendant-or-self::email[boolean(substring-before("123", "5"))]/text() /descendant-or-self::email[boolean(number())]/text() //person[email]/@id //name[given = "Big"]/family /personnel/person[string-length(string(name/family)) < 5]/@id //*[attribute::id="five.worker"]/@id //*[../email="chief@foo.com"] //given[.="Four"] /descendant::node()[count(ancestor::node()) = 3] //name[given="Five"]/given //name[normalize-space(given)="Five"]/given //name[translate(normalize-space(string(given)), "Five", "Four")="Four"]/given //name[translate(string(given), "Oneabcd", "Two")="Two"]/given //name[translate(string(given), "FFFF", "Four")="Four"]/given //name[translate(string(given), "Thre", "One")="One"]/given //name/given[normalize-space()="Big"]/text() //name/given[number()="Big"]/text() /personnel/person/age[count(preceding::age)=2]/../@id /personnel/person/age[(sum(preceding::age) - 21)=56]/../@id //personnel[lang("en")] //personnel[lang("pl")] //*[lang("en")] /personnel/person[5]/name/given/ancestor-or-self::*[@xml:lang][2] /personnel/person[5]/name/given/ancestor-or-self::*[@xml:lang][last()] //person[2][@id="three.worker"]/name/given //*[lang("EN-US")] //person[number(age)="37"]/@id //person[string(number(email))="NaN"]/@id //person[string(number(email))="5"]/@id /personnel/person[@id="four.worker" and @xml:lang="en-US"] /personnel/person[@id="five.worker" and @xml:lang="en-US"]/email /personnel/person[number(age) > 40]/@id /personnel/person[(number(age) > 40) | (number(age) < 30)]/@id /personnel/person[@id="four.worker"]|/personnel/person/age //@* //person/@* //node()[name(.)="#text"] //node()[local-name(.)=name(.)] //@*[string(namespace-uri(.))] //@*[namespace-uri(.)] //link[@manager] //link[@subordinates] //link[@manager|@subordinates] //person[number('This is not a number')]/@id //person[4 div 0]/@id //person[string(number('This is not a number')) = 'NaN']/@id //person[string(number('This is not a number')) = 'This is not a number']/@id //person[string(4 div 0) = 'Infinity']/@id //person[concat(string(position()), '23') = '323']/@id //person[starts-with(concat(string(position()), '23'), '22')]/@id //person[contains(concat(string(position()), '23', string(position()), '47'), '34')]/@id //person[substring-before(concat(string(position()), '23', string(position()), '47'), '35') = '52']/@id xia-1.00/test/txia_results.txt0100644000076600007670000007630010212451314015343 0ustar g315padadevEnter XML file name: Enter XPath query: Evaluating: //given/.. Number of nodes: 6 Enter XPath query: Evaluating: //email Number of nodes: 6 one@foo.com two@foo.com three@foo.com four@foo.com five@foo.com chief@foo.com Enter XPath query: Evaluating: //@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //@aid Number of nodes: 0 Enter XPath query: Evaluating: /personnel/person/link/attribute::subordinates Number of nodes: 1 subordinates="one.worker two.worker three.worker four.worker five.worker" Enter XPath query: Evaluating: personnel/person/name/family Number of nodes: 6 Worker Worker Worker Worker Worker Boss Enter XPath query: Evaluating: //family/ancestor::name Number of nodes: 6 Enter XPath query: Evaluating: //family/text() Number of nodes: 6 Worker Worker Worker Worker Worker Boss Enter XPath query: Evaluating: /personnel/person/name/family/.. Number of nodes: 6 Enter XPath query: Evaluating: ./pesonnel Number of nodes: 0 Enter XPath query: Evaluating: ./personnel Number of nodes: 1 Enter XPath query: Evaluating: personnel/person/email/preceding::name/given/text() Number of nodes: 6 One Two Three Four Five Big Enter XPath query: Evaluating: .//* Number of nodes: 43 Worker One one@foo.com 21 Worker Two two@foo.com 24 Worker Three three@foo.com 32 Worker Four four@foo.com 37 Worker Five five@foo.com 41 Boss Big chief@foo.com 48 Enter XPath query: Evaluating: //email/following-sibling::link/@manager Number of nodes: 5 manager="Big.Boss" manager="Big.Boss" manager="Big.Boss" manager="Big.Boss" manager="Big.Boss" Enter XPath query: Evaluating: //email/following-sibling::link/@subordinates Number of nodes: 1 subordinates="one.worker two.worker three.worker four.worker five.worker" Enter XPath query: Evaluating: //@id/parent::* Number of nodes: 6 Enter XPath query: Evaluating: //given/.. Number of nodes: 6 Enter XPath query: Evaluating: //email/preceding-sibling::* Number of nodes: 6 Enter XPath query: Evaluating: //email/following-sibling::* Number of nodes: 12 21 24 32 37 41 48 Enter XPath query: Evaluating: //email/followingsibling::* Malformed query Enter XPath query: Evaluating: //family/ancestor::person/link Number of nodes: 6 Enter XPath query: Evaluating: //name/ancestor::* Number of nodes: 7 Enter XPath query: Evaluating: //name/ancestor-or-self::* Number of nodes: 13 Enter XPath query: Evaluating: //name/descendant::* Number of nodes: 12 Worker One Worker Two Worker Three Worker Four Worker Five Boss Big Enter XPath query: Evaluating: //name/descendant-or-self::* Number of nodes: 18 Worker One Worker Two Worker Three Worker Four Worker Five Boss Big Enter XPath query: Evaluating: //@subordinates Number of nodes: 1 subordinates="one.worker two.worker three.worker four.worker five.worker" Enter XPath query: Evaluating: //@subordinates/.. Number of nodes: 1 Enter XPath query: Evaluating: //@subordinates/../preceding::* Number of nodes: 40 Worker One one@foo.com 21 Worker Two two@foo.com 24 Worker Three three@foo.com 32 Worker Four four@foo.com 37 Worker Five five@foo.com 41 Boss Big chief@foo.com 48 Enter XPath query: Evaluating: //@subordinates/../following::* Number of nodes: 0 Enter XPath query: Evaluating: .. Number of nodes: 0 Enter XPath query: Evaluating: . Number of nodes: 1 Enter XPath query: Evaluating: ..//email Number of nodes: 0 Enter XPath query: Evaluating: //person[3]/following-sibling::* Number of nodes: 3 Enter XPath query: Evaluating: //person[3]/following-sibling::*/@id[2] Number of nodes: 1 id="five.worker" Enter XPath query: Evaluating: //person[3]/preceding-sibling::*/@id Number of nodes: 2 id="one.worker" id="two.worker" Enter XPath query: Evaluating: //person[3]/preceding-sibling::*[2]/@id Number of nodes: 1 id="one.worker" Enter XPath query: Evaluating: //person[3]/preceding-sibling::*/@id[2] Number of nodes: 1 id="two.worker" Enter XPath query: Evaluating: /personnel/person[2]/email/preceding-sibling::name/given/ancestor-or-self::*[3] Number of nodes: 1 Enter XPath query: Evaluating: //family Number of nodes: 6 Worker Worker Worker Worker Worker Boss Enter XPath query: Evaluating: //given Number of nodes: 6 One Two Three Four Five Big Enter XPath query: Evaluating: //family|//given Number of nodes: 12 Worker One Worker Two Worker Three Worker Four Worker Five Boss Big Enter XPath query: Evaluating: //family|//given[2] Number of nodes: 7 Worker Worker Two Worker Worker Worker Boss Enter XPath query: Evaluating: //person[last()]/@id Number of nodes: 1 id="Big.Boss" Enter XPath query: Evaluating: //person[position()=2]/@id Number of nodes: 1 id="two.worker" Enter XPath query: Evaluating: //person[position(3)=2]/@id Malformed query Enter XPath query: Evaluating: //@id[3] Number of nodes: 1 id="three.worker" Enter XPath query: Evaluating: //@id[true()] Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //@id[false()] Number of nodes: 0 Enter XPath query: Evaluating: //@id[not(position()=2)] Number of nodes: 5 id="one.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //@id[position() >= 5] Number of nodes: 2 id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[3 - 1]/@id Number of nodes: 1 id="two.worker" Enter XPath query: Evaluating: //person[3 * 2]/@id Number of nodes: 1 id="Big.Boss" Enter XPath query: Evaluating: //person[5 mod 2]/@id Number of nodes: 1 id="one.worker" Enter XPath query: Evaluating: //person[5 mod -2]/@id Number of nodes: 1 id="one.worker" Enter XPath query: Evaluating: //person[(-5 mod 2) + 4]/@id Number of nodes: 1 id="three.worker" Enter XPath query: Evaluating: //person[(-5 mod -2) + 2 * true()]/@id Number of nodes: 1 id="one.worker" Enter XPath query: Evaluating: //person[round(1.1*3)]/@id Number of nodes: 1 id="three.worker" Enter XPath query: Evaluating: //person[1 or 2]/@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[4 and -2]/@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[4 and (3 > 10)]/@id Number of nodes: 0 Enter XPath query: Evaluating: //person[position() != 3]/@id Number of nodes: 5 id="one.worker" id="two.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[3 * 1.1]/@id Number of nodes: 1 id="three.worker" Enter XPath query: Evaluating: //person[5 - 0.0001]/@id Number of nodes: 1 id="four.worker" Enter XPath query: Evaluating: //person[(((position() mod 2)))]/@id Number of nodes: 1 id="one.worker" Enter XPath query: Evaluating: //person[position() mod 2 = 0]/@id Number of nodes: 3 id="two.worker" id="four.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[position() = floor(last() div 2 + 0.5) or position() = ceiling(last() div 2 + 0.5)]/@id Number of nodes: 2 id="three.worker" id="four.worker" Enter XPath query: Evaluating: //person[position() > 3]/@id Number of nodes: 3 id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[position() < 3]/@id Number of nodes: 2 id="one.worker" id="two.worker" Enter XPath query: Evaluating: //person[position() <= 2]/@id Number of nodes: 2 id="one.worker" id="two.worker" Enter XPath query: Evaluating: //person[position() div 2 + 2]/@id Number of nodes: 2 id="three.worker" id="four.worker" Enter XPath query: Evaluating: //person[5 + -true()]/@id Number of nodes: 1 id="four.worker" Enter XPath query: Evaluating: //person[number("This is not a number")]/@id Number of nodes: 0 Enter XPath query: Evaluating: //person[4 div 0]/@id Number of nodes: 0 Enter XPath query: Evaluating: //person[string(number("This is not a number")) = "NaN"]/@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[string(number("This is not a number")) = "This is not a number"]/@id Number of nodes: 0 Enter XPath query: Evaluating: //person[string(4 div 0) = "Infinity"]/@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[concat(string(position()), "23") = "323"]/@id Number of nodes: 1 id="three.worker" Enter XPath query: Evaluating: //person[starts-with(concat(string(position()), "23"), "22")]/@id Number of nodes: 1 id="two.worker" Enter XPath query: Evaluating: //person[contains(concat(string(position()), "23", string(position()), "47"), "34")]/@id Number of nodes: 2 id="three.worker" id="four.worker" Enter XPath query: Evaluating: //person[substring-before(concat(string(position()), "23", string(position()), "47"), "35") = "52"]/@id Number of nodes: 1 id="five.worker" Enter XPath query: Evaluating: //person[substring-after(concat(string(position()), "23", string(position()), "47"), "35") = "47"]/@id Number of nodes: 1 id="five.worker" Enter XPath query: Evaluating: //person[substring(concat(string(position()), "23", string(position()), "47"), 4, 3) = "347"]/@id Number of nodes: 1 id="three.worker" Enter XPath query: Evaluating: //person[substring(concat(string(position()), "23", string(position()), "47"), 4) = "347"]/@id Number of nodes: 1 id="three.worker" Enter XPath query: Evaluating: //person[substring(concat(string(position()), "23", string(position()), "47"), -42, 1 div 0) = "223247"]/@id Number of nodes: 1 id="two.worker" Enter XPath query: Evaluating: //person[substring(concat(string(position()), "23", string(position()), "47"), 0 div 0, 3) = "3"]/@id Number of nodes: 0 Enter XPath query: Evaluating: //person[substring(concat(string(position()), "23", string(position()), "47"), 0 div 0, 3) = ""]/@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[substring(concat(string(position()), "23", string(position()), "47"), 1.5, 2.6) = '234']/@id Number of nodes: 1 id="four.worker" Enter XPath query: Evaluating: //person[substring(concat(string(position()), "23", string(position()), "47"), 0, 3) = '52']/@id Number of nodes: 1 id="five.worker" Enter XPath query: Evaluating: //person[substring(concat(string(position()), "23", string(position()), "47"), -1 div 0, 1 div 0) = ""]/@id Number of nodes: 0 Enter XPath query: Evaluating: //person[(string-length(string(position())) * position()) = "4"]/@id Number of nodes: 1 id="four.worker" Enter XPath query: Evaluating: /descendant-or-self::email/text() Number of nodes: 6 one@foo.com two@foo.com three@foo.com four@foo.com five@foo.com chief@foo.com Enter XPath query: Evaluating: /descendant-or-self::email[boolean(-3)]/text() Number of nodes: 6 one@foo.com two@foo.com three@foo.com four@foo.com five@foo.com chief@foo.com Enter XPath query: Evaluating: /descendant-or-self::email[boolean(35.3)]/text() Number of nodes: 6 one@foo.com two@foo.com three@foo.com four@foo.com five@foo.com chief@foo.com Enter XPath query: Evaluating: /descendant-or-self::email[boolean(0)]/text() Number of nodes: 0 Enter XPath query: Evaluating: /descendant-or-self::email[boolean(0 div 0)]/text() Number of nodes: 0 Enter XPath query: Evaluating: /descendant-or-self::email[boolean(-4 div 0)]/text() Number of nodes: 0 Enter XPath query: Evaluating: /descendant-or-self::email[boolean(10 div 0)]/text() Number of nodes: 0 Enter XPath query: Evaluating: /descendant-or-self::email[boolean(string())]/text() Number of nodes: 6 one@foo.com two@foo.com three@foo.com four@foo.com five@foo.com chief@foo.com Enter XPath query: Evaluating: /descendant-or-self::email[boolean(string(last()))]/text() Number of nodes: 6 one@foo.com two@foo.com three@foo.com four@foo.com five@foo.com chief@foo.com Enter XPath query: Evaluating: /descendant-or-self::email[boolean(substring-before("123", "5"))]/text() Number of nodes: 0 Enter XPath query: Evaluating: /descendant-or-self::email[boolean(number())]/text() Number of nodes: 6 one@foo.com two@foo.com three@foo.com four@foo.com five@foo.com chief@foo.com Enter XPath query: Evaluating: //person[email]/@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //name[given = "Big"]/family Number of nodes: 1 Boss Enter XPath query: Evaluating: /personnel/person[string-length(string(name/family)) < 5]/@id Number of nodes: 1 id="Big.Boss" Enter XPath query: Evaluating: //*[attribute::id="five.worker"]/@id Number of nodes: 1 id="five.worker" Enter XPath query: Evaluating: //*[../email="chief@foo.com"] Number of nodes: 4 chief@foo.com 48 Enter XPath query: Evaluating: //given[.="Four"] Number of nodes: 1 Four Enter XPath query: Evaluating: /descendant::node()[count(ancestor::node()) = 3] Number of nodes: 54 one@foo.com 21 two@foo.com 24 three@foo.com 32 four@foo.com 37 five@foo.com 41 chief@foo.com 48 Enter XPath query: Evaluating: //name[given="Five"]/given Number of nodes: 0 Enter XPath query: Evaluating: //name[normalize-space(given)="Five"]/given Number of nodes: 1 Five Enter XPath query: Evaluating: //name[translate(normalize-space(string(given)), "Five", "Four")="Four"]/given Number of nodes: 2 Four Five Enter XPath query: Evaluating: //name[translate(string(given), "Oneabcd", "Two")="Two"]/given Number of nodes: 2 One Two Enter XPath query: Evaluating: //name[translate(string(given), "FFFF", "Four")="Four"]/given Number of nodes: 1 Four Enter XPath query: Evaluating: //name[translate(string(given), "Thre", "One")="One"]/given Number of nodes: 1 Three Enter XPath query: Evaluating: //name/given[normalize-space()="Big"]/text() Number of nodes: 1 Big Enter XPath query: Evaluating: //name/given[number()="Big"]/text() Number of nodes: 1 Big Enter XPath query: Evaluating: /personnel/person/age[count(preceding::age)=2]/../@id Number of nodes: 1 id="three.worker" Enter XPath query: Evaluating: /personnel/person/age[(sum(preceding::age) - 21)=56]/../@id Number of nodes: 1 id="four.worker" Enter XPath query: Evaluating: //personnel[lang("en")] Number of nodes: 1 Enter XPath query: Evaluating: //personnel[lang("pl")] Number of nodes: 0 Enter XPath query: Evaluating: //*[lang("en")] Number of nodes: 43 Worker One one@foo.com 21 Worker Two two@foo.com 24 Worker Three three@foo.com 32 Worker Four four@foo.com 37 Worker Five five@foo.com 41 Boss Big chief@foo.com 48 Enter XPath query: Evaluating: /personnel/person[5]/name/given/ancestor-or-self::*[@xml:lang][2] Number of nodes: 1 Enter XPath query: Evaluating: /personnel/person[5]/name/given/ancestor-or-self::*[@xml:lang][last()] Number of nodes: 1 Enter XPath query: Evaluating: //person[2][@id="three.worker"]/name/given Number of nodes: 0 Enter XPath query: Evaluating: //*[lang("EN-US")] Number of nodes: 7 Worker Five five@foo.com 41 Enter XPath query: Evaluating: //person[number(age)="37"]/@id Number of nodes: 1 id="four.worker" Enter XPath query: Evaluating: //person[string(number(email))="NaN"]/@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[string(number(email))="5"]/@id Number of nodes: 0 Enter XPath query: Evaluating: /personnel/person[@id="four.worker" and @xml:lang="en-US"] Number of nodes: 0 Enter XPath query: Evaluating: /personnel/person[@id="five.worker" and @xml:lang="en-US"]/email Number of nodes: 1 five@foo.com Enter XPath query: Evaluating: /personnel/person[number(age) > 40]/@id Number of nodes: 2 id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: /personnel/person[(number(age) > 40) | (number(age) < 30)]/@id Malformed query Enter XPath query: Evaluating: /personnel/person[@id="four.worker"]|/personnel/person/age Number of nodes: 7 21 24 32 37 41 48 Enter XPath query: Evaluating: //@* Number of nodes: 15 xml:lang="en" id="one.worker" manager="Big.Boss" id="two.worker" manager="Big.Boss" id="three.worker" manager="Big.Boss" id="four.worker" xml:lang="EN" manager="Big.Boss" id="five.worker" xml:lang="en-US" manager="Big.Boss" id="Big.Boss" subordinates="one.worker two.worker three.worker four.worker five.worker" Enter XPath query: Evaluating: //person/@* Number of nodes: 8 id="one.worker" id="two.worker" id="three.worker" id="four.worker" xml:lang="EN" id="five.worker" xml:lang="en-US" id="Big.Boss" Enter XPath query: Evaluating: //node()[name(.)="#text"] Number of nodes: 67 Worker One one@foo.com 21 Worker Two two@foo.com 24 Worker Three three@foo.com 32 Worker Four four@foo.com 37 Worker Five five@foo.com 41 Boss Big chief@foo.com 48 Enter XPath query: Evaluating: //node()[local-name(.)=name(.)] Number of nodes: 43 Worker One one@foo.com 21 Worker Two two@foo.com 24 Worker Three three@foo.com 32 Worker Four four@foo.com 37 Worker Five five@foo.com 41 Boss Big chief@foo.com 48 Enter XPath query: Evaluating: //@*[string(namespace-uri(.))] Number of nodes: 3 xml:lang="en" xml:lang="EN" xml:lang="en-US" Enter XPath query: Evaluating: //@*[namespace-uri(.)] Number of nodes: 3 xml:lang="en" xml:lang="EN" xml:lang="en-US" Enter XPath query: Evaluating: //link[@manager] Number of nodes: 5 Enter XPath query: Evaluating: //link[@subordinates] Number of nodes: 1 Enter XPath query: Evaluating: //link[@manager|@subordinates] Number of nodes: 6 Enter XPath query: Evaluating: //person[number('This is not a number')]/@id Number of nodes: 0 Enter XPath query: Evaluating: //person[4 div 0]/@id Number of nodes: 0 Enter XPath query: Evaluating: //person[string(number('This is not a number')) = 'NaN']/@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[string(number('This is not a number')) = 'This is not a number']/@id Number of nodes: 0 Enter XPath query: Evaluating: //person[string(4 div 0) = 'Infinity']/@id Number of nodes: 6 id="one.worker" id="two.worker" id="three.worker" id="four.worker" id="five.worker" id="Big.Boss" Enter XPath query: Evaluating: //person[concat(string(position()), '23') = '323']/@id Number of nodes: 1 id="three.worker" Enter XPath query: Evaluating: //person[starts-with(concat(string(position()), '23'), '22')]/@id Number of nodes: 1 id="two.worker" Enter XPath query: Evaluating: //person[contains(concat(string(position()), '23', string(position()), '47'), '34')]/@id Number of nodes: 2 id="three.worker" id="four.worker" Enter XPath query: Evaluating: //person[substring-before(concat(string(position()), '23', string(position()), '47'), '35') = '52']/@id Number of nodes: 1 id="five.worker" Enter XPath query: Enter XML file name: Enter XPath query: Evaluating: //node Number of nodes: 2 Enter XPath query: Evaluating: //and Number of nodes: 2
Enter XPath query: Evaluating: //child[and] Number of nodes: 2 Enter XPath query: Evaluating: //child/parent::parent Number of nodes: 2 Enter XPath query: Evaluating: //child::child/parent::parent[text] Number of nodes: 1 Enter XPath query: Evaluating: //*[node or following] Number of nodes: 3 Enter XPath query: Evaluating: //self/comment/text Number of nodes: 1 Enter XPath query: Evaluating: //*[div and or] Number of nodes: 1
Enter XPath query: Evaluating: //processing-instruction Number of nodes: 1 Enter XPath query: Evaluating: //child[and or mod] Number of nodes: 3
Enter XPath query: Evaluating: //child[and and mod] Number of nodes: 1 Enter XPath query: Evaluating: //preceding-sibling/parent::*[preceding] Number of nodes: 1 Enter XPath query: Evaluating: //ancestor | //ancestor-or-self | //descendant[descendant-or-self] Number of nodes: 3 Enter XPath query: xia-1.00/test/test_xpath.adb0100444000076600007670000001353710212333762014716 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Ada.Strings.Fixed; with Ada.Strings.Maps; with Dom.Core.Nodes; with Mckae.XML.XPath.XIA; with Dom.Readers; with Unicode.CES; -- with Dtraq.Client_Transport; -- use Dtraq.Client_Transport; with Mckae.Xml.Xpath.Locations; with Input_Sources.File; with Text_IO; use Text_IO; procedure Test_Xpath is use Dom; use Dom.Core; use Input_Sources; use Mckae.Xml.XPath.Locations; use Mckae.Xml.XPath.XIA; use Ada.Strings.Fixed; use Ada.Strings.Maps; XML_Source_Reader : Dom.Readers.Tree_Reader; Queried_Nodes : Node_List; N : Node; Child : Node; Children : Node_List; Children_Printed : Boolean := False; File_Source : File.File_Input; S : String(1..255); L : Natural; procedure Print_Text_Node (T : Text; Indent : Boolean := False) is White_Space : constant Xpath_String := ' ' & Ascii.LF & Ascii.CR & ASCII.HT; White_Space_Set : constant Character_Set := To_Set(White_Space); S : Unicode.CES.Byte_Sequence := Trim(Nodes.Node_Value(T), White_Space_Set, White_Space_Set); begin if S'Length > 0 then if Indent then Put(" "); end if; Put_Line(S); end if; end Print_Text_Node; begin Put("Enter XML file name: "); Get_Line(S, L); File.Open(S(1..L), File_Source); Readers.Parse(XML_Source_Reader, File_Source); File.Close(File_Source); -- Connect_To_Server; loop Put("Enter XPath query: "); Get_Line(S, L); if S(1) /= '#' then -- Skip comment exit when L = 0; New_Line(2); Put_Line("Evaluating: " & S(1..L)); New_Line; begin Queried_Nodes := Xpath_Query(Readers.Get_Tree(XML_Source_Reader), S(1..L)); Put_Line("Number of nodes:" & Natural'Image(Dom.Core.Nodes.Length(Queried_Nodes))); for I in 0 .. Nodes.Length(Queried_Nodes) - 1 loop N := Dom.Core.Nodes.Item(Queried_Nodes, I); if N.Node_Type = Element_Node then Put("<"); Put(Nodes.Node_Name(N)); Put(">"); Children := Nodes.Child_Nodes(N); Children_Printed := False; for J in 0 .. Nodes.Length(Children) - 1 loop Child := Nodes.Item(Children, J); if Child.Node_Type = Element_Node then if not Children_Printed then New_Line; Children_Printed := True; end if; Put(" <"); Put(Nodes.Node_Name(Child)); Put_Line(">"); elsif Child.Node_Type = Text_Node then if not Children_Printed then New_Line; Children_Printed := True; end if; Print_Text_Node(Child, Indent => True); end if; end loop; Put(""); elsif N.Node_Type = Attribute_Node then Put(Nodes.Node_Name(N) & "="""); Put(Nodes.Node_Value (N)); Put_Line(""""); elsif N.Node_Type = Text_Node then Print_Text_Node(N); else Put(Nodes.Node_Value(N)); end if; end loop; exception when Malformed_XPath => Put_Line("Malformed query"); end; end if; end loop; -- Disconnect_From_Server; end Test_Xpath; xia-1.00/test/keyword_content_tests.txt0100444000076600007670000000052310212334043017244 0ustar g315padadevkeyword_content.xml //node //and //child[and] //child/parent::parent //child::child/parent::parent[text] //*[node or following] //self/comment/text //*[div and or] //processing-instruction //child[and or mod] //child[and and mod] //preceding-sibling/parent::*[preceding] //ancestor | //ancestor-or-self | //descendant[descendant-or-self] xia-1.00/test/keyword_content.xml0100444000076600007670000000174410212334043016011 0ustar g315padadev
30
8 bling xia-1.00/README0100666000076600007670000002201110212335236011753 0ustar g315padadevXIA (XPath In Ada) is a native Ada implementation of the XPath 1.0 specification. XIA is built atop the DOM component of AdaCore's XML/Ada implementation. Submitting XPath queries is done via the XPath_Query function in package McKae.XML.XPath.XIA. The function returns a Node_List, as defined in DOM.Core, and whose contents can be accessed with the Item function in DOM.Core.Nodes; A script, txia, and an input file of XPath queries, txia_tests.txt, are provided to jam a bunch of queries through the test program (if more test queries are added, be sure to leave the empty line at the bottom of the file). txia_tests.txt also exhibits a wide variety of XPath queries, although the majority of these are nonsense queries as far as realistic usage is concerned, they're tailored to exercise and test various aspects of XIA's implementation. To generate the test program, cd to the test directory and invoke gnatmake as follows: gnatmake -O2 -I.. -I../booch4xia test_xpath `xmlada-config` AdaBrowse generated source code documentation resides in the doc subdirectory. Please let me know if you have any questions or find bugs with the current functionality. Marc A. Criley mc@mckae.com ------------------------------------------------------------------ Version history: XIA v1.00 ========= Eliminated the problem with XPath "keywords" being treated as reserved words, thanks to some assistance from Dr. Martin Carlisle. This fix removes any limitations on the names of the elements that can be selected from XML documents. To test the above fix, another simple XML test file was added, whose contents consists entirely of XPath keywords. A number of XPath queries against this file are provided for testing. (See the keyword_content.xml and keyword_content_tests.txt files.) XIA v0.61 ========= This version corrects one of the known bugs in XIA 0.60--where a predicate containing an expression that is a union (|) of node sets generated a syntax error. Additional test cases added txia_tests.txt as well. XIA v0.60 ========= This release completes the required functionality for the XML Path Language (XPath) Version 1.0. This itself is not a 1.0 version because it has not been fully shaken out for bugs, and it is in fact being released with two known bugs and a limitation: - Predicates containing an expression that is a union (|) of node sets generates in a syntax error. - The axis and node test names are being treated as reserved words, hence if the XML document being processed contains elements that have those names (e.g., child, ancestor), any XPath queries that refer to those elements will be rejected as having a syntax error. - The id() core library function is implemented, but inoperable. It relies on the XMLAda implementation of Get_Element_By_ID, which is not implemented. Changes since the last release include fixing some minor bugs and completing the implementation of the core library functions. - In some situations the descendant-or-self axis was ignoring the "self". - When using consecutive predicates, the result of evaluating subsequent ones was being union'ed to the node set, rather than doing additional filtering. New and completed functions: id lang name local-name namespace-uri The txia_test.txt file, containg a list of XPath queries that seriously exercise the predicate filtering capabilities of XIA, has been updated to 140 queries. In addition, a test results file, txia_results.txt, is now included that shows the expected output from running the txia test series. XIA v0.50 ========= This release implements the handling of path expressions within predicates, and adds/completes functions that work with node-sets acquired by the evaluation of such paths. Therefore this release has sufficient capabilities implemented that one may now consider it for actual XML applications, rather than just something to play around with. Remaining core library functions and capabilites will continue to be implemented in subsequent releases. There is only one known significant bug: The parser treats "and", "or", "not", "div", the axis names ("child", "ancestor", etc.), and node type names ("text", etc.) as reserved words. Meaning that if an XML document uses such a term as an element tag, referencing it as part of the path in an XPath expression will generate a syntax error. New and completed functions: count normalize-string sum translate The txia_test.txt file, containg a list of XPath queries that seriously exercise the predicate filtering capabilities of XIA, has been updated (119 queries and growing!), as has the personal.xml and personal.dtd test files. XIA v0.30 ========= First release with partial implementation of predicate filtering. The arithmetic and relational operators have been implemented for numeric, boolean, and string operands. (This means that they're not yet handling node-set operands.) A majority of the core library functions have been implemented, though again those dealing with node-set arguments may not be implemented, or may only support the numeric, boolean, and string arguments. Predicate expressions utilizing paths are not yet implemented. List of core library functions in this release: boolean count concat contains ceiling false floor last not number position round string starts-with substring-before substring-after substring string-length sum true See the txia_test.txt file for a list of XPath queries that seriously exercise the predicate filtering capabilities of XIa. XIA v0.20 ========= Same thing only better. This version fixes bugs pertaining to extracting the queried nodes, but really the only functional difference between this and the previous version is that XPath expressions containing predicates are now completely syntactically checked. Previously you could have pretty much any gibberish between the brackets and so long as the rest of the query was correct, the query would be accepted. Not so any more. However, internally the entire parsing implementation has been replaced with one generated with the aid of AdaGOOP/scaflex/scayacc. Those generated parsing files (modified), along with the xpath.g grammar used as AdaGOOP input, are included. Although what you get out of AdaGOOP won't exactly match what is included in this archive. Modifications were done to raise an exception in the case of a syntax error instead of printing a message, and the IO package was modified to get its input from a string rather than a file. A script, txia, and an input file of XPath queries, txia_tests.txt, are provided to jam a bunch of queries through the test program (if you add more test queries, be sure to leave the empty line at the bottom of the file). The archive now contains the specific Booch components needed to build XIA. You don't need to use the provided subset if you already have the components installed (as they're unchanged from the primary distribution), but they're provided here as a convenience. A command line to compile the test program in the xia-0.20/test directory is: gnatmake -I.. -I../booch4xia test_xpath `xmlada-config` Please let me know if you have any questions or find bugs with the current functionality. mc@mckae.com XIA v0.10 ========= XIA utilizes Ada Core's XML/Ada distribution, and is known to work on Linux (RedHat 9) under GNAT 3.15p and GNAT 3.4.2. There should be no Linux-specific dependencies. There's nothing special about building or incorporating XIA into your application. Simply unpack the archive into a directory and either explicitly include (-I) that directory on the command line or add it as part of the ADA_INCLUDE_PATH environment variable setting. AdaBrowse generated documentation is available in the doc subdirectory. A rudimentary query test program is provided as test_xpath.adb. Compile it on Linux as: gnatmake test_xpath `xmlada-config` You'll be asked for the name of an XML file, and then an XPath query string. Enter your query, and when done use an empty carriage return to end the program. Within Test_XPath, McKae.XML.XPath.XPath_Query is invoked with the document's root (document) node and the query and a list of nodes (which may be empty) is returned. The contents of each node is displayed--if it's an element node, its first level of children are displayed, otherwise the value of the node (such as its non-blank text) appears. A simple XML file is provided, "personal.xml". Here are some queries to try on it: //@id Extract all the attribute nodes named "id". //email Extracts all email nodes. /personnel/person/link/@subordinates Finds all the "subordinate" attribute nodes associated with the link node that corresponds to the given path //given/parent::* Find any parent node of all "given" nodes //family/text() Get the text node children that are associated with the family element (Note that test_xpath removes any white space from the text before displaying it, which if it's all whitespace, leaves nothing to display) //name/following::email Find all email nodes that follow a name node xia-1.00/mckae.ads0100666000076600007670000000416310212334323012650 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2003 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ package McKae is pragma Pure; end McKae; xia-1.00/mckae-space.ads0100666000076600007670000000417710212334323013746 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2003 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ package McKae.Space is pragma Pure; end McKae.Space; xia-1.00/bench_xpath.adb0100666000076600007670000003661010212334121014030 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Ada.Strings.Fixed; with Ada.Strings.Maps; with Ada.Calendar; use Ada.Calendar; with Dom.Core.Nodes; with Mckae.XML.XPath.XIA; with Dom.Readers; with Unicode.CES; -- with Dtraq.Client_Transport; -- use Dtraq.Client_Transport; with Mckae.Xml.Xpath.Locations; with Input_Sources.File; with Text_IO; use Text_IO; procedure Bench_Xpath is use Dom; use Dom.Core; use Input_Sources; use Mckae.Xml.XPath.Locations; use Mckae.Xml.XPath.XIA; use Ada.Strings.Fixed; use Ada.Strings.Maps; XML_Source_Reader : Dom.Readers.Tree_Reader; Queried_Nodes : Node_List; N : Node; File_Source : File.File_Input; Start, Stop : Ada.Calendar.Time; begin File.Open("personal.xml", File_Source); Readers.Parse(XML_Source_Reader, File_Source); File.Close(File_Source); N := Readers.Get_Tree(XML_Source_Reader); for I in 1 .. 10 loop Start := Clock; Queried_Nodes := Xpath_Query(N, "//given/.."); Queried_Nodes := Xpath_Query(N, "//email"); Queried_Nodes := Xpath_Query(N, "//@id"); Queried_Nodes := Xpath_Query(N, "//@aid"); Queried_Nodes := Xpath_Query(N, "/personnel/person/link/attribute::subordinates"); Queried_Nodes := Xpath_Query(N, "personnel/person/name/family"); Queried_Nodes := Xpath_Query(N, "//family/ancestor::name"); Queried_Nodes := Xpath_Query(N, "//family/text()"); Queried_Nodes := Xpath_Query(N, "/personnel/person/name/family/.."); Queried_Nodes := Xpath_Query(N, "./pesonnel"); Queried_Nodes := Xpath_Query(N, "./personnel"); Queried_Nodes := Xpath_Query(N, "personnel/person/email/preceding::name/given/text()"); Queried_Nodes := Xpath_Query(N, ".//*"); Queried_Nodes := Xpath_Query(N, "//email/following-sibling::link/@manager"); Queried_Nodes := Xpath_Query(N, "//email/following-sibling::link/@subordinates"); Queried_Nodes := Xpath_Query(N, "//@id/parent::*"); Queried_Nodes := Xpath_Query(N, "//given/.."); Queried_Nodes := Xpath_Query(N, "//email/preceding-sibling::*"); Queried_Nodes := Xpath_Query(N, "//email/following-sibling::*"); Queried_Nodes := Xpath_Query(N, "//family/ancestor::person/link"); Queried_Nodes := Xpath_Query(N, "//name/ancestor::*"); Queried_Nodes := Xpath_Query(N, "//name/ancestor-or-self::*"); Queried_Nodes := Xpath_Query(N, "//name/descendant::*"); Queried_Nodes := Xpath_Query(N, "//name/descendant-or-self::*"); Queried_Nodes := Xpath_Query(N, "//@subordinates"); Queried_Nodes := Xpath_Query(N, "//@subordinates/.."); Queried_Nodes := Xpath_Query(N, "//@subordinates/../preceding::*"); Queried_Nodes := Xpath_Query(N, "//@subordinates/../following::*"); Queried_Nodes := Xpath_Query(N, ".."); Queried_Nodes := Xpath_Query(N, "."); Queried_Nodes := Xpath_Query(N, "..//email"); Queried_Nodes := Xpath_Query(N, "//person[3]/following-sibling::*"); Queried_Nodes := Xpath_Query(N, "//person[3]/following-sibling::*/@id[2]"); Queried_Nodes := Xpath_Query(N, "//person[3]/preceding-sibling::*/@id"); Queried_Nodes := Xpath_Query(N, "//person[3]/preceding-sibling::*[2]/@id"); Queried_Nodes := Xpath_Query(N, "//person[3]/preceding-sibling::*/@id[2]"); Queried_Nodes := Xpath_Query(N, "/personnel/person[2]/email/preceding-sibling::name/given/ancestor-or-self::*[3]"); Queried_Nodes := Xpath_Query(N, "//family"); Queried_Nodes := Xpath_Query(N, "//given"); Queried_Nodes := Xpath_Query(N, "//family|//given"); Queried_Nodes := Xpath_Query(N, "//family|//given[2]"); Queried_Nodes := Xpath_Query(N, "//person[last()]/@id"); Queried_Nodes := Xpath_Query(N, "//person[position()=2]/@id"); -- Queried_Nodes := Xpath_Query(N, "//person[position(3)=2]/@id"); Queried_Nodes := Xpath_Query(N, "//@id[3]"); Queried_Nodes := Xpath_Query(N, "//@id[true()]"); Queried_Nodes := Xpath_Query(N, "//@id[false()]"); Queried_Nodes := Xpath_Query(N, "//@id[not(position()=2)]"); Queried_Nodes := Xpath_Query(N, "//@id[position() >= 5]"); Queried_Nodes := Xpath_Query(N, "//person[3 - 1]/@id"); Queried_Nodes := Xpath_Query(N, "//person[3 * 2]/@id"); Queried_Nodes := Xpath_Query(N, "//person[5 mod 2]/@id"); Queried_Nodes := Xpath_Query(N, "//person[5 mod -2]/@id"); Queried_Nodes := Xpath_Query(N, "//person[(-5 mod 2) + 4]/@id"); Queried_Nodes := Xpath_Query(N, "//person[(-5 mod -2) + 2 * true()]/@id"); Queried_Nodes := Xpath_Query(N, "//person[round(1.1*3)]/@id"); Queried_Nodes := Xpath_Query(N, "//person[1 or 2]/@id"); Queried_Nodes := Xpath_Query(N, "//person[4 and -2]/@id"); Queried_Nodes := Xpath_Query(N, "//person[4 and (3 > 10)]/@id"); Queried_Nodes := Xpath_Query(N, "//person[position() != 3]/@id"); Queried_Nodes := Xpath_Query(N, "//person[3 * 1.1]/@id"); Queried_Nodes := Xpath_Query(N, "//person[5 - 0.0001]/@id"); Queried_Nodes := Xpath_Query(N, "//person[(((position() mod 2)))]/@id"); Queried_Nodes := Xpath_Query(N, "//person[position() mod 2 = 0]/@id"); Queried_Nodes := Xpath_Query(N, "//person[position() = floor(last() div 2 + 0.5) or position() = ceiling(last() div 2 + 0.5)]/@id"); Queried_Nodes := Xpath_Query(N, "//person[position() > 3]/@id"); Queried_Nodes := Xpath_Query(N, "//person[position() < 3]/@id"); Queried_Nodes := Xpath_Query(N, "//person[position() <= 2]/@id"); Queried_Nodes := Xpath_Query(N, "//person[position() div 2 + 2]/@id"); Queried_Nodes := Xpath_Query(N, "//person[5 + -true()]/@id"); Queried_Nodes := Xpath_Query(N, "//person[number(""This is not a number"")]/@id"); Queried_Nodes := Xpath_Query(N, "//person[4 div 0]/@id"); Queried_Nodes := Xpath_Query(N, "//person[string(number(""This is not a number"")) = ""NaN""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[string(number(""This is not a number"")) = ""This is not a number""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[string(4 div 0) = ""Infinity""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[concat(string(position()), ""23"") = ""323""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[starts-with(concat(string(position()), ""23""), ""22"")]/@id"); Queried_Nodes := Xpath_Query(N, "//person[contains(concat(string(position()), ""23"", string(position()), ""47""), ""34"")]/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring-before(concat(string(position()), ""23"", string(position()), ""47""), ""35"") = ""52""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring-after(concat(string(position()), ""23"", string(position()), ""47""), ""35"") = ""47""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring(concat(string(position()), ""23"", string(position()), ""47""), 4, 3) = ""347""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring(concat(string(position()), ""23"", string(position()), ""47""), 4) = ""347""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring(concat(string(position()), ""23"", string(position()), ""47""), -42, 1 div 0) = ""223247""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring(concat(string(position()), ""23"", string(position()), ""47""), 0 div 0, 3) = ""3""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring(concat(string(position()), ""23"", string(position()), ""47""), 0 div 0, 3) = """"]/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring(concat(string(position()), ""23"", string(position()), ""47""), 1.5, 2.6) = '234']/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring(concat(string(position()), ""23"", string(position()), ""47""), 0, 3) = '52']/@id"); -- Queried_Nodes := Xpath_Query(N, "//person[substring(concat(string(position()), ""23"", string(position()), ""47""), -1 div 0, 1 div 0) = ""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[(string-length(string(position())) * position()) = ""4""]/@id"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(-3)]/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(35.3)]/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(0)]/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(0 div 0)]/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(-4 div 0)]/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(10 div 0)]/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(string())]/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(string(last()))]/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(substring-before(""123"", ""5""))]/text()"); Queried_Nodes := Xpath_Query(N, "/descendant-or-self::email[boolean(number())]/text()"); Queried_Nodes := Xpath_Query(N, "//person[email]/@id"); Queried_Nodes := Xpath_Query(N, "//name[given = ""Big""]/family"); Queried_Nodes := Xpath_Query(N, "/personnel/person[string-length(string(name/family)) < 5]/@id"); Queried_Nodes := Xpath_Query(N, "//*[attribute::id=""five.worker""]/@id"); Queried_Nodes := Xpath_Query(N, "//*[../email=""chief@foo.com""]"); Queried_Nodes := Xpath_Query(N, "//given[.=""Four""]"); Queried_Nodes := Xpath_Query(N, "/descendant::node()[count(ancestor::node()) = 3]"); Queried_Nodes := Xpath_Query(N, "//name[given=""Five""]/given"); Queried_Nodes := Xpath_Query(N, "//name[normalize-space(given)=""Five""]/given"); Queried_Nodes := Xpath_Query(N, "//name[translate(normalize-space(string(given)), ""Five"", ""Four"")=""Four""]/given"); Queried_Nodes := Xpath_Query(N, "//name[translate(string(given), ""Oneabcd"", ""Two"")=""Two""]/given"); Queried_Nodes := Xpath_Query(N, "//name[translate(string(given), ""FFFF"", ""Four"")=""Four""]/given"); Queried_Nodes := Xpath_Query(N, "//name[translate(string(given), ""Thre"", ""One"")=""One""]/given"); Queried_Nodes := Xpath_Query(N, "//name/given[normalize-space()=""Big""]/text()"); Queried_Nodes := Xpath_Query(N, "//name/given[number()=""Big""]/text()"); Queried_Nodes := Xpath_Query(N, "/personnel/person/age[count(preceding::age)=2]/../@id"); Queried_Nodes := Xpath_Query(N, "/personnel/person/age[(sum(preceding::age) - 21)=56]/../@id"); Queried_Nodes := Xpath_Query(N, "//personnel[lang(""en"")]"); Queried_Nodes := Xpath_Query(N, "//personnel[lang(""pl"")]"); Queried_Nodes := Xpath_Query(N, "//*[lang(""en"")]"); Queried_Nodes := Xpath_Query(N, "/personnel/person[5]/name/given/ancestor-or-self::*[@xml:lang][2]"); Queried_Nodes := Xpath_Query(N, "/personnel/person[5]/name/given/ancestor-or-self::*[@xml:lang][last()]"); Queried_Nodes := Xpath_Query(N, "//person[2][@id=""three.worker""]/name/given"); Queried_Nodes := Xpath_Query(N, "//*[lang(""EN-US"")]"); Queried_Nodes := Xpath_Query(N, "//person[number(age)=""37""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[string(number(email))=""NaN""]/@id"); Queried_Nodes := Xpath_Query(N, "//person[string(number(email))=""5""]/@id"); Queried_Nodes := Xpath_Query(N, "/personnel/person[@id=""four.worker"" and @xml:lang=""en-US""]"); Queried_Nodes := Xpath_Query(N, "/personnel/person[@id=""five.worker"" and @xml:lang=""en-US""]/email"); Queried_Nodes := Xpath_Query(N, "/personnel/person[number(age) > 40]/@id"); -- Queried_Nodes := Xpath_Query(N, "/personnel/person[(number(age) > 40) | (number(age) < 30)]/@id"); Queried_Nodes := Xpath_Query(N, "/personnel/person[@id=""four.worker""]|/personnel/person/age"); Queried_Nodes := Xpath_Query(N, "//@*"); Queried_Nodes := Xpath_Query(N, "//person/@*"); Queried_Nodes := Xpath_Query(N, "//node()[name(.)=""#text""]"); Queried_Nodes := Xpath_Query(N, "//node()[local-name(.)=name(.)]"); Queried_Nodes := Xpath_Query(N, "//@*[string(namespace-uri(.))]"); Queried_Nodes := Xpath_Query(N, "//@*[namespace-uri(.)]"); Queried_Nodes := Xpath_Query(N, "//link[@manager]"); Queried_Nodes := Xpath_Query(N, "//link[@subordinates]"); Queried_Nodes := Xpath_Query(N, "//link[@manager|@subordinates]"); Queried_Nodes := Xpath_Query(N, "//person[number('This is not a number')]/@id"); Queried_Nodes := Xpath_Query(N, "//person[4 div 0]/@id"); Queried_Nodes := Xpath_Query(N, "//person[string(number('This is not a number')) = 'NaN']/@id"); Queried_Nodes := Xpath_Query(N, "//person[string(number('This is not a number')) = 'This is not a number']/@id"); Queried_Nodes := Xpath_Query(N, "//person[string(4 div 0) = 'Infinity']/@id"); Queried_Nodes := Xpath_Query(N, "//person[concat(string(position()), '23') = '323']/@id"); Queried_Nodes := Xpath_Query(N, "//person[starts-with(concat(string(position()), '23'), '22')]/@id"); Queried_Nodes := Xpath_Query(N, "//person[contains(concat(string(position()), '23', string(position()), '47'), '34')]/@id"); Queried_Nodes := Xpath_Query(N, "//person[substring-before(concat(string(position()), '23', string(position()), '47'), '35') = '52']/@id"); Stop := Clock; Put_Line(Duration'Image(Stop - Start)); end loop; -- Disconnect_From_Server; end Bench_Xpath; xia-1.00/mckae-xml.ads0100666000076600007670000000417410212334323013450 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ package McKae.XML is pragma Pure; end McKae.XML; xia-1.00/dom-core-append_node.adb0100666000076600007670000000517310212334121015524 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ -- Append a node to an XMLAda DOM node list procedure Dom.Core.Append_Node (List : in out Node_List; -- list to which to append the node N : Node -- Node to append ) is Old : Node_Array_Access := List.Items; begin if Old = null or else Old'Last = List.Last then List.Items := new Node_Array (0 .. (List.Last + 10) * 3); if Old /= null then List.Items (0 .. List.Last) := Old.all; Free (Old); end if; end if; List.Last := List.Last + 1; List.Items (List.Last) := N; null; end Dom.Core.Append_Node; xia-1.00/dom-core-append_node.ads0100666000076600007670000000437310212334121015546 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ -- Append a node to an XMLAda DOM node list procedure Dom.Core.Append_Node (List : in out Node_List; -- list to which to append the node N : Node -- Node to append ); xia-1.00/mckae-xml-xpath.ads0100666000076600007670000000421010212334346014566 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ package McKae.XML.XPath is pragma Pure; end McKae.XML.XPath; xia-1.00/mckae-xml-xpath-expressions.adb0100666000076600007670000012076010212334346017136 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Ada.Characters.Handling; With Ada.Io_Exceptions; with Ada.Long_Float_Text_Io; use Ada.Long_Float_Text_Io; with Ada.Strings.Maps; with Dom.Core.Attrs; with Dom.Core.Documents; with Dom.Core.Nodes; use Dom.Core.Nodes; with Dom.Core.Append_Node; with Mckae.XML.XPath.XIA; package body Mckae.XML.XPath.Expressions is use Ada; use Ada.Strings; ---------------------------------------------------------------------- -- Result of comparing two expressions type Expression_Comparison_Results is (Lesser, Equal, Greater); subtype Lesser_Equal is Expression_Comparison_Results range Lesser .. Equal; subtype Greater_Equal is Expression_Comparison_Results range Equal .. Greater; ---------------------------------------------------------------------- function "+"(S : String) return Unbounded_String renames To_Unbounded_String; -- Create the string-value of the expression in accorance with its -- type. function String_Value(N : Dom.Core.Node -- Node for which to create the string-value ) return Dom.Core.DOM_String; ---------------------------------------------------------------------- function Trim(S : String) return Unbounded_String is begin return Trim(+S, Ada.Strings.Left); end Trim; ---------------------------------------------------------------------- procedure Coerce (Value : in out Expression_Values; To_Type : in Value_Types := As_String) is Replacement : Expression_Values(To_Type); Temp_String : String(1 .. Long_Float'Width); Last : Positive; Interim : Expression_Values; begin case To_Type is when As_String => case Value.Value_Type is when As_String => Replacement := Value; when As_Number => case Value.Special is when NaN => Replacement.S := +"NaN"; when Positive_Infinity => Replacement.S := +"Infinity"; when Negative_Infinity => Replacement.S := +"-Infinity"; when Normal => if Long_Float'Truncation(Value.F) = Value.F then -- Integer Put(Temp_String, Value.F, Aft => 0, Exp => 0); -- Cut off the ".0" at the end Replacement.S := Trim(Temp_String(1 .. Temp_String'Last - 2)); else -- Float Put(Temp_String, Value.F, Exp => 0); Replacement.S := Trim(Temp_String); end if; end case; when As_Boolean => Replacement.B := Value.B; when As_Node_List => if Length(Value.Ns) > 0 then Replacement.S := +String_Value(Item(Value.Ns, 0)); else Replacement.S := Null_Unbounded_String; end if; when As_Expr_Text => pragma Assert(False); null; end case; when As_Number => case Value.Value_Type is when As_String => Value.S := Trim(Value.S, Ada.Strings.Both); begin Get(To_String(Value.S), Replacement.F, Last); if Last /= Length(Value.S) then raise Io_Exceptions.Data_Error; end if; exception when Io_Exceptions.Data_Error | IO_Exceptions.End_Error => Replacement.F := 0.0; Replacement.Special := NaN; end; when As_Number => Replacement := Value; when As_Boolean => if Value.B then Replacement.F := 1.0; else Replacement.F := 0.0; end if; when As_Node_List => Interim := Value; Coerce(Interim, As_String); Coerce(Interim, As_Number); Replacement := Interim; when As_Expr_Text => pragma Assert(False); null; end case; when As_Boolean => case Value.Value_Type is when As_String => Replacement.B := Length(Value.S) > 0; when As_Number => Replacement.B := (Value.Special = Normal) and (Value.F /= 0.0); when As_Boolean => Replacement := Value; when As_Node_List => Replacement.B := Length(Value.Ns) > 0; when As_Expr_Text => pragma Assert(False); null; end case; when As_Node_List => if Value.Value_Type /= As_Node_List then raise Invalid_Coercion; else Replacement := Value; end if; end case; Value := Replacement; end Coerce; ---------------------------------------------------------------------- procedure Harmonize (Expr1 : in out Expression_Values; -- Operand Expr2 : in out Expression_Values -- Operand ) is begin if Expr1.Value_Type /= Expr2.Value_Type then if (Expr1.Value_Type = As_Node_List) or (Expr2.Value_Type = As_Node_List) then null; elsif (Expr1.Value_Type = As_Boolean) or (Expr2.Value_Type = As_Boolean) then Coerce(Expr1, As_Boolean); Coerce(Expr2, As_Boolean); elsif (Expr1.Value_Type = As_Number) or (Expr2.Value_Type = As_Number) then Coerce(Expr1, As_Number); Coerce(Expr2, As_Number); else Coerce(Expr1, As_String); Coerce(Expr2, As_String); end if; end if; end Harmonize; ---------------------------------------------------------------------- function Compare (Expr1 : Expression_Values; -- Comparison operand 1 Expr2 : Expression_Values -- Comparison operand 2 ) return Expression_Comparison_Results is Result : Expression_Comparison_Results := Equal; E1 : Expression_Values := Expr1; E2 : Expression_Values := Expr2; begin Harmonize(E1, E2); case E1.Value_Type is when As_Boolean => if E1.B < E2.B then Result := Lesser; elsif E1.B > E2.B then Result := Greater; else Result := Equal; end if; when As_Number => if (E1.Special = Normal) and (E2.Special = Normal) then if E1.F < E2.F then Result := Lesser; elsif E1.F > E2.F then Result := Greater; else Result := Equal; end if; else null; end if; when As_String => if E1.S < E2.S then Result := Lesser; elsif E1.S > E2.S then Result := Greater; else Result := Equal; end if; when As_Node_List => if Length(E1.NS) < Length(E2.NS) then Result := Lesser; elsif Length(E1.NS) > Length(E2.NS) then Result := Greater; else Result := Equal; end if; when As_Expr_Text => pragma Assert(False); null; end case; return Result; end Compare; ---------------------------------------------------------------------- function Check_Relation (Operator : Relational_Operators; Relation : Expression_Comparison_Results) return Boolean is begin case Operator is when Less_Than => return Relation = Lesser; when Less_Or_Equal => return Relation in Lesser_Equal; when Equal => return Relation = Equal; when Not_Equal => return Relation /= Equal; when Greater_Or_Equal => return Relation in Greater_Equal; when Greater_Than => return Relation = Greater; end case; end Check_Relation; ---------------------------------------------------------------------- function Compare (Expr1 : Expression_Values; -- Comparison operand 1 Expr2 : Expression_Values; -- Comparison operand 2 Operator : Relational_Operators -- The relationship to evaluate between the two expressions ) return Boolean is Result : Expression_Comparison_Results := Equal; E1 : Expression_Values; E2 : Expression_Values; begin if (Expr1.Value_Type = As_Node_List) and (Expr2.Value_Type = As_Node_List) then -- Check whether any pair in the expressions' node lists have -- the specified relationship for N1 in 0 .. Length(Expr1.Ns) - 1 loop declare S1 : constant Unbounded_String := +String_Value(Item(Expr1.Ns, N1)); begin for N2 in 0 .. Length(Expr2.Ns) - 1 loop Result := Compare((As_String, S1), (As_String, +String_Value(Item(Expr2.Ns, N2)))); if Check_Relation(Operator, Result) then return True; end if; end loop; end; end loop; return False; elsif (Expr1.Value_Type = As_Node_List) then case Expr2.Value_Type is when As_Number => for N1 in 0 .. Length(Expr1.Ns) - 1 loop declare S1 : constant Unbounded_String := +String_Value(Item(Expr1.Ns, N1)); begin E1 := (As_String, S1); Coerce(E1, As_Number); return Check_Relation(Operator, Compare(E1, Expr2)); end; end loop; when As_String => for N1 in 0 .. Length(Expr1.Ns) - 1 loop declare S1 : constant Unbounded_String := +String_Value(Item(Expr1.Ns, N1)); begin E1 := (As_String, S1); return Check_Relation(Operator, Compare(E1, Expr2)); end; end loop; when As_Boolean => E1 := Expr1; Coerce(E1, As_Boolean); return Check_Relation(Operator, Compare(E1, Expr2)); when others => pragma Assert(False); null; end case; return False; elsif (Expr2.Value_Type = As_Node_List) then case Expr1.Value_Type is when As_Number => for N2 in 0 .. Length(Expr2.Ns) - 1 loop declare S2 : constant Unbounded_String := +String_Value(Item(Expr2.Ns, N2)); begin E2 := (As_String, S2); Coerce(E2, As_Number); return Check_Relation(Operator, Compare(Expr1, E2)); end; end loop; when As_String => for N2 in 0 .. Length(Expr2.Ns) - 1 loop declare S2 : constant Unbounded_String := +String_Value(Item(Expr2.Ns, N2)); begin E2 := (As_String, S2); return Check_Relation(Operator, Compare(Expr1, E2)); end; end loop; when As_Boolean => E2 := Expr2; Coerce(E2, As_Boolean); return Check_Relation(Operator, Compare(E1, Expr2)); when others => pragma Assert(False); null; end case; return False; else Result := Compare(Expr1, Expr2); return Check_Relation(Operator, Result); end if; end Compare; ---------------------------------------------------------------------- function Compute (Expr1 : Expression_Values; -- Comparison operand 1 Expr2 : Expression_Values; -- Comparison operand 2 Computation : Computations -- The mathematical operation to perform ) return Expression_Values is Result : Expression_Values(As_Number) := (As_Number, 0.0, Normal); begin pragma Assert(Expr1.Value_Type = As_Number); pragma Assert(Expr2.Value_Type = As_Number); if (Expr1.Special = NaN) or (Expr2.Special = NaN) then Result.Special := NaN; else case Computation is when Add => if (Expr1.Special = Normal) and (Expr2.Special = Normal) then Result.F := Expr1.F + Expr2.F; elsif (Expr1.Special = Positive_Infinity) and (Expr2.Special = Positive_Infinity) then Result.Special := Positive_Infinity; elsif (Expr1.Special = Negative_Infinity) and (Expr2.Special = Negative_Infinity) then Result.Special := Negative_Infinity; elsif ((Expr1.Special = Negative_Infinity) and (Expr2.Special = Positive_Infinity)) or ((Expr1.Special = Positive_Infinity) and (Expr2.Special = Negative_Infinity)) then Result.Special := NaN; else pragma Assert(False); null; end if; when Subtract => if (Expr1.Special = Normal) and (Expr2.Special = Normal) then Result.F := Expr1.F - Expr2.F; elsif (Expr1.Special = Positive_Infinity) and (Expr2.Special = Negative_Infinity) then Result.Special := Positive_Infinity; elsif (Expr1.Special = Negative_Infinity) and (Expr2.Special = Positive_Infinity) then Result.Special := Negative_Infinity; elsif ((Expr1.Special = Positive_Infinity) and (Expr2.Special = Positive_Infinity)) or ((Expr1.Special = Negative_Infinity) and (Expr2.Special = Negative_Infinity)) then Result.Special := NaN; else pragma Assert(False); null; end if; when Multiply => if (Expr1.Special = Normal) and (Expr2.Special = Normal) then Result.F := Expr1.F * Expr2.F; elsif ((Expr1.Special = Positive_Infinity) and (Expr2.Special = Negative_Infinity)) or ((Expr1.Special = Negative_Infinity) and (Expr2.Special = Positive_Infinity)) then Result.Special := Negative_Infinity; elsif ((Expr1.Special = Positive_Infinity) and (Expr2.Special = Positive_Infinity)) or ((Expr1.Special = Negative_Infinity) and (Expr2.Special = Negative_Infinity)) then Result.Special := Positive_Infinity; elsif Expr2.F = 0.0 then Result.Special := NaN; else pragma Assert(False); null; end if; when Divide => if (Expr1.Special = Normal) and ((Expr2.Special = Positive_Infinity) or (Expr2.Special = Negative_Infinity)) then Result.F := 0.0; elsif (Expr2.Special = Normal) and (Expr2.F = 0.0) then if Expr1.F = 0.0 then Result.Special := NaN; elsif (Expr1.Special = Normal) then if (Expr1.F > 0.0) then Result.Special := Positive_Infinity; else Result.Special := Negative_Infinity; end if; else Result.Special := Expr1.Special; end if; elsif (Expr1.Special = Normal) and (Expr2.Special = Normal) then Result.F := Expr1.F / Expr2.F; else Result.Special := NaN; end if; when Modulo => if Expr2.F = 0.0 then Result.Special := Positive_Infinity; else -- Yes, _rem_, not "mod"! Result.F := Long_Float(Integer(Long_Float'Truncation(Expr1.F)) rem Integer(Long_Float'Truncation(Expr2.F))); end if; when Negate => Result.F := -Expr1.F; when others => null; end case; end if; return Result; end Compute; ---------------------------------------------------------------------- procedure Check_Arg_Count (Args : in Argument_List; Minimum : in Natural; Evaluated : out Boolean; Maximum : in Natural := 0) is Max_Args : constant Natural := Natural'Max(Minimum, Maximum); begin if Args'Length not in Minimum .. Max_Args then raise Invalid_Expression; end if; Evaluated := True; end Check_Arg_Count; ---------------------------------------------------------- function Round_Value(Expr : Expression_Values) return Expression_Values is Result : Expression_Values := (As_Number, 0.0, Normal); begin pragma Assert(Expr.Value_Type = As_Number); if (Expr.Special = Normal) then Result.F := Long_Float'Rounding(Expr.F); else Result.Special := Expr.Special; end if; return Result; end Round_Value; ---------------------------------------------------------- function Sum_Values (Expr : in Expression_Values) return Expression_Values is Sum : Expression_Values := (As_Number, 0.0, Normal); Temp : Expression_Values; begin pragma Assert(Expr.Value_Type = As_Node_List); for N in 0 .. Length(Expr.Ns) - 1 loop -- Get each node's string value Temp := (As_String, +String_Value(Item(Expr.Ns, N))); -- Convert that string value to an equivalent number Coerce(Temp, As_Number); -- Add it to the working sum, following all the XPath IEEE -- 754 addition rules Sum := Compute(Sum, Temp, Add); end loop; return Sum; end Sum_Values; ---------------------------------------------------------- function Scrub_String(Expr : Expression_Values) return Dom.Core.DOM_String is White_Space : constant String := ' ' & Ascii.LF & Ascii.CR & ASCII.HT; White_Space_Set : constant Maps.Character_Set := Maps.To_Set(White_Space); -- Start by removing all the leading and trailing white space characters S : constant String := To_String(Trim(Expr.S, White_Space_Set, White_Space_Set)); Result : Unbounded_String; Copying : Boolean := True; begin for I in S'Range loop if not Maps.Is_In(S(I), White_Space_Set) then Append(Result, S(I)); Copying := True; else if Copying then Append(Result, S(I)); end if; Copying := False; end if; end loop; return To_String(Result); end Scrub_String; ---------------------------------------------------------- function Translation(Args : Argument_List) return Unbounded_String is use Maps; From_Set : Maps.Character_Set; Omit_Set : Maps.Character_Set; Mapping : Maps.Character_Mapping; Result : Unbounded_String; C : Character; Translated : Boolean := True; begin pragma Assert(Args(1).Value_Type = As_String); pragma Assert(Args(2).Value_Type = As_String); pragma Assert(Args(3).Value_Type = As_String); -- If the length of the "from" string set is equal (or shorter) -- than the "to" string set, use the standard Strings.Translate -- function. Strings.Translate requires that the sizes of the -- from/to mappings be the same, which is not required by -- XPath's translate. begin if Length(Args(2).S) <= Length(Args(3).S) then Mapping := To_Mapping(To_String(Args(2).S), Slice(Args(3).S, 1, Length(Args(2).S))); Result := Translate(Args(1).S, Mapping); else -- Set up for just the characters for which a mapping has -- been defined From_Set := To_Set(Slice(Args(2).S, 1, Length(Args(3).S))); Omit_Set := To_Set(Slice(Args(2).S, Length(Args(3).S) + 1, Length(Args(2).S))); Mapping := To_Mapping(Slice(Args(2).S, 1, Length(Args(3).S)), To_String(Args(3).S)); for I in 1 .. Length(Args(1).S) loop C := Element(Args(1).S, I); if Is_In(C, From_Set) then Append(Result, Value(Mapping, C)); elsif not Is_In(C, Omit_Set) then Append(Result, C); end if; end loop; end if; exception when Translation_Error => Translated := False; end; if not Translated then -- There was an error in the translation mapping, -- specifically, there were duplicates in the "From" string, -- which Ada's Translate() function doesn't allow. So, to -- work around this we're going to dork with a copy of the -- From string, replacing the duplicate characters with the -- corresponding character in the "To" set, the effect being -- that those characters will just continue to map to -- themselves. declare Translation_Count : constant Positive := Positive'Min(Length(Args(2).S), Length(Args(3).S)); From_String : String := Slice(Args(2).S, 1, Translation_Count); To_String : constant String := Slice(Args(3).S, 1, Translation_Count); New_From_String : String := From_String; begin -- The lengths of the From and To strings have been -- equalized, now start replacing duplicate characters. -- By going in reverse, we just replace the character -- that has been identified as a duplicate and then move -- on to the next one. The last one encountered will be -- its first appearance in the string. for I in reverse 2 .. From_String'Last loop for J in reverse 1 .. I - 1 loop if From_String(I) = From_String(J) then New_From_String(I) := To_String(I); exit; end if; end loop; end loop; -- Now that the From string has been reconstructed with -- its duplicates replaced, go do the mapping. Mapping := To_Mapping(New_From_String, To_String); Result := Translate(Args(1).S, Mapping); end; end if; return Result; end Translation; ---------------------------------------------------------- function Extract_Slice(Args : Argument_List) return Unbounded_String is -- Handles the weirdnesses surrounding rounding and infinity and -- stuff. Low_Bound : Integer; High_Bound : Integer; Start_Index : Natural; Slice_High : Natural; No_Substring : Boolean := False; -- No valid substring Source_Length : Natural := Length(Args(1).S); begin -- Figure out the starting index of the slice if Args(2).Special = Normal then Low_Bound := Integer(Round_Value(Args(2)).F); Start_Index := Integer'Max(1, Low_Bound); elsif Args(2).Special = Negative_Infinity then Low_Bound := Integer'First; Start_Index := 1; else -- Positive_Infinity No_Substring := True; end if; No_Substring := No_Substring Or (Low_Bound > Source_Length); if not No_Substring then -- If there's a third argument, figure out the end of the slice if Args'Length = 3 then if Args(3).Special = Normal then High_Bound := Low_Bound + Integer(Round_Value(Args(3)).F) - 1; if High_Bound < Low_Bound then No_Substring := True; else Slice_High := Integer'Min(High_Bound, Source_Length); end if; elsif Args(3).Special = Positive_Infinity then Slice_High := Source_Length; else -- Negative_Infinity No_Substring := True; end if; else Slice_High := Source_Length; end if; end if; if No_Substring then return Null_Unbounded_String; else return +Slice(Args(1).S, Start_Index, Slice_High); end if; end Extract_Slice; ---------------------------------------------------------- function Match_Lang (Lang : Expression_Values; Context_Node : Node_Items) return Boolean is use Ada.Characters.Handling; use DOM.Core; Search_Lang : constant Dom.Core.DOM_String := To_Upper(To_String(Lang.S)); Lang_Query : constant Dom.Core.DOM_String := "ancestor-or-self::*[@xml:lang][1]/@xml:lang"; Node_Set : Dom.Core.Node_List; Result : Boolean := False; begin Node_Set := XIA.Xpath_Query(Context_Node.N, Lang_Query); if Length(Node_Set) > 0 then declare Lang_Value : constant DOM_String := To_Upper(Attrs.Value(Item(Node_Set, 0))); Search_Length : constant Positive := Search_Lang'Length; begin -- First check to see if there's a simple match Result := Search_Lang = Lang_Value; if (not Result) and (Search_Lang'Length < Lang_Value'Length) then -- Check if it's the prefix of a language Result := (Lang_Value(Search_Lang'Range) = Search_Lang) and (Lang_Value(Search_Length + 1) = '-'); end if; end; end if; return Result; end Match_Lang; ---------------------------------------------------------- function Extract_By_ID (N : Dom.Core.Node; Arg : Expression_Values) return Expression_Values is Result : Expression_Values(As_Node_List); Owner_Doc : Dom.Core.Document; Node_With_Id : Dom.Core.Node; use type Dom.Core.Node; -- By the way, this doesn't work. At least as of XMLAda 1.0, -- because Get_Element_By_ID is not yet implemented. Therefore -- this always returns an empty node-set. begin Owner_Doc := Owner_Document(N); Node_With_Id := Dom.Core.Documents.Get_Element_By_ID(Owner_Doc, To_String(Arg.S)); if Node_With_Id /= null then Dom.Core.Append_Node(Result.Ns, Node_With_ID); end if; return Result; end Extract_By_ID; ---------------------------------------------------------- function Get_Local_Name(Arg : Expression_Values) return Expression_Values is begin pragma Assert(Arg.Value_Type = As_Node_List); if Length(Arg.Ns) > 0 then return (As_String, +Dom.Core.Nodes.Local_Name(Item(Arg.Ns, 0))); else return (As_String, Null_Unbounded_String); end if; end Get_Local_Name; ---------------------------------------------------------- function Get_Namespace_URI(Arg : Expression_Values) return Expression_Values is begin pragma Assert(Arg.Value_Type = As_Node_List); if Length(Arg.Ns) > 0 then return (As_String, +Dom.Core.Nodes.Namespace_URI(Item(Arg.Ns, 0))); else return (As_String, Null_Unbounded_String); end if; end Get_Namespace_URI; ---------------------------------------------------------- function Get_Expanded_Name(Arg : Expression_Values) return Expression_Values is begin pragma Assert(Arg.Value_Type = As_Node_List); if Length(Arg.Ns) > 0 then return (As_String, +(Dom.Core.Nodes.Node_Name(Item(Arg.Ns, 0)))); else return (As_String, Null_Unbounded_String); end if; end Get_Expanded_Name; ---------------------------------------------------------- procedure Evaluate_Function (Function_Name : in String_Ptr; Context_Node : in Node_Items; Args : in out Argument_List; Result : out Expression_Values) is Func_Name : constant String := Function_Name.all; Evaluated : Boolean := False; Working_Node_List : Dom.Core.Node_List; Slice_Index : Natural; begin -- Reduce (at least a bit) the number of string comparisons that -- have to be done to locate the function name case Func_Name(1) is when 'b' => if Func_Name = "boolean" then Check_Arg_Count(Args, 1, Evaluated); Coerce(Args(1), As_Boolean); Result := Args(1); end if; when 'c' => if Func_Name = "count" then Check_Arg_Count(Args, 1, Evaluated); Coerce(Args(1), As_Node_List); Result := (As_Number, Long_Float(Length(Args(1).Ns)), Normal); elsif Func_Name = "concat" then Check_Arg_Count(Args, 2, Evaluated, Natural'Last); Coerce(Args(1), As_String); Coerce(Args(2), As_String); Result := (As_String, Args(1).S & Args(2).S); for A in 3 .. Args'Last loop Coerce(Args(A), As_String); Append(Result.S, Args(A).S); end loop; elsif Func_Name = "contains" then Check_Arg_Count(Args, 2, Evaluated); Result := (As_Boolean, Index(Args(1).S, To_String(Args(2).S)) /= 0); elsif Func_Name = "ceiling" then Check_Arg_Count(Args, 1, Evaluated); Coerce(Args(1), As_Number); Result := (As_Number, Long_Float'Ceiling(Args(1).F), Normal); end if; when 'f' => if Func_Name = "false" then Check_Arg_Count(Args, 0, Evaluated); Result := (As_Boolean, False); elsif Func_Name = "floor" then Check_Arg_Count(Args, 1, Evaluated); Coerce(Args(1), As_Number); Result := (As_Number, Long_Float'Floor(Args(1).F), Normal); end if; when 'i' => if Func_Name = "id" then Check_Arg_Count(Args, 1, Evaluated); Result := Extract_By_Id(Context_Node.N, Args(1)); end if; when 'l' => if Func_Name = "last" then Check_Arg_Count(Args, 0, Evaluated); Result := (As_Number, Long_Float(Context_Node.Node_Set_Size), Normal); elsif Func_Name = "lang" then Check_Arg_Count(Args, 1, Evaluated); Coerce(Args(1), As_String); Result := (As_Boolean, Match_Lang(Args(1), Context_Node)); elsif Func_Name = "local-name" then Check_Arg_Count(Args, 0, Evaluated, 1); if Args'Length = 0 then Dom.Core.Append_Node(Working_Node_List, Context_Node.N); Result := (As_Node_List, Working_Node_List); else Coerce(Args(1), As_Node_List); Result := Get_Local_Name(Args(1)); end if; end if; when 'n' => if Func_Name = "not" then Check_Arg_Count(Args, 1, Evaluated); Coerce(Args(1), As_Boolean); Result := (As_Boolean, not Args(1).B); elsif Func_Name = "number" then Check_Arg_Count(Args, 0, Evaluated, 1); if Args'Length = 0 then Dom.Core.Append_Node(Working_Node_List, Context_Node.N); Result := (As_Node_List, Working_Node_List); else Coerce(Args(1), As_Number); Result := Args(1); end if; elsif Func_Name = "normalize-space" then Check_Arg_Count(Args, 0, Evaluated, 1); if Args'Length = 0 then Result := (As_String, +String_Value(Context_Node.N)); else Coerce(Args(1), As_String); Result := (As_String, +Scrub_String(Args(1))); end if; elsif Func_Name = "namespace-uri" then Check_Arg_Count(Args, 0, Evaluated, 1); if Args'Length = 0 then Dom.Core.Append_Node(Working_Node_List, Context_Node.N); Result := (As_Node_List, Working_Node_List); else Coerce(Args(1), As_Node_List); Result := Get_Namespace_URI(Args(1)); end if; elsif Func_Name = "name" then Check_Arg_Count(Args, 0, Evaluated, 1); if Args'Length = 0 then Dom.Core.Append_Node(Working_Node_List, Context_Node.N); Result := (As_Node_List, Working_Node_List); else Coerce(Args(1), As_Node_List); Result := Get_Expanded_Name(Args(1)); end if; end if; when 'p' => if Func_Name = "position" then Check_Arg_Count(Args, 0, Evaluated); Result := (As_Number, Long_Float(Context_Node.Node_Position), Normal); end if; when 'r' => if Func_Name = "round" then Check_Arg_Count(Args, 1, Evaluated); Coerce(Args(1), As_Number); Result := Round_Value(Args(1)); end if; when 's' => if Func_Name = "string" then Check_Arg_Count(Args, 0, Evaluated, 1); if Args'Length = 0 then Dom.Core.Append_Node(Working_Node_List, Context_Node.N); Result := (As_Node_List, Working_Node_List); else Coerce(Args(1), As_String); Result := Args(1); end if; elsif Func_Name = "starts-with" then Check_Arg_Count(Args, 2, Evaluated); Coerce(Args(1), As_String); Coerce(Args(2), As_String); Result := (As_Boolean, Index(Args(1).S, To_String(Args(2).S)) = 1); elsif Func_Name = "substring-before" then Check_Arg_Count(Args, 2, Evaluated); Coerce(Args(1), As_String); Coerce(Args(2), As_String); Result := (As_String, Null_Unbounded_String); Slice_Index := Index(Args(1).S, To_String(Args(2).S)); if Slice_Index /= 0 then Result.S := Head(Args(1).S, Slice_Index - 1); end if; elsif Func_Name = "substring-after" then Check_Arg_Count(Args, 2, Evaluated); Result := (As_String, Null_Unbounded_String); Coerce(Args(1), As_String); Coerce(Args(2), As_String); Slice_Index := Index(Args(1).S, To_String(Args(2).S)); if Slice_Index /= 0 then Result.S := Tail(Args(1).S, Length(Args(1).S) - (Slice_Index + Length(Args(2).S) - 1)); end if; elsif Func_Name = "substring" then Check_Arg_Count(Args, 2, Evaluated, 3); Result := (As_String, Null_Unbounded_String); Coerce(Args(1), As_String); Coerce(Args(2), As_Number); Result.S := Extract_Slice(Args); elsif Func_Name = "string-length" then Check_Arg_Count(Args, 0, Evaluated, 1); if Args'Length = 0 then Dom.Core.Append_Node(Working_Node_List, Context_Node.N); Result := (As_Node_List, Working_Node_List); Coerce(Result, As_String); else Coerce(Args(1), As_String); Result := (As_Number, Long_Float(Length(Args(1).S)), Normal); end if; elsif Func_Name = "sum" then Check_Arg_Count(Args, 1, Evaluated); Coerce(Args(1), As_Node_List); Result := Sum_Values(Args(1)); end if; when 't' => if Func_Name = "true" then Check_Arg_Count(Args, 0, Evaluated); Result := (As_Boolean, True); elsif Func_Name = "translate" then Check_Arg_Count(Args, 3, Evaluated); Coerce(Args(1), As_String); Coerce(Args(2), As_String); Coerce(Args(3), As_String); Result := (As_String, Translation(Args)); end if; when others => Evaluated := False; end case; if not Evaluated then raise Invalid_Expression; end if; end Evaluate_Function; ---------------------------------------------------------- function Concat_Text_Nodes(Node_Set : Dom.Core.Node_List) return Dom.Core.DOM_String is Value : Unbounded_String; begin for N in 0 .. Length(Node_Set) - 1 loop Append(Value, Node_Value(Item(Node_Set, N))); end loop; return To_String(Value); end Concat_Text_Nodes; ---------------------------------------------------------- function String_Value(N : Dom.Core.Node -- Node for which to create the string-value ) return Dom.Core.DOM_String is use Dom.Core; Node_Set : Node_List; begin case N.Node_Type is when Attribute_Node | Text_Node | Comment_Node | Processing_Instruction_Node => return Node_Value(N); when Element_Node => Node_Set := XIA.Xpath_Query(N, "./text()"); when Document_Node => Node_Set := XIA.Xpath_Query(N, "//text()"); when others => null; end case; return Concat_Text_Nodes(Node_Set); end String_Value; end Mckae.XML.XPath.Expressions; xia-1.00/mckae-xml-xpath-expressions.ads0100666000076600007670000001376510212334346017165 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Dom.Core; package Mckae.XML.XPath.Expressions is type String_Ptr is access all String; type Node_Items is record N : Dom.Core.Node; Node_Position : Natural := 0; Node_Set_Size : Natural := 0; end record; -- Types of expression values type Expression_Value_Types is (As_String, As_Number, As_Boolean, As_Node_List, As_Expr_Text ); subtype Value_Types is Expression_Value_Types range As_String .. As_Node_List; -- Special otherwise non-representable numeric values type Special_Number_Values is (NaN, Positive_Infinity, Negative_Infinity, Normal); subtype Special_Numbers is Special_Number_Values range NaN .. Negative_Infinity; -- Container for the value of an expression type Expression_Values (Value_Type : Expression_Value_Types := As_String) is record case Value_Type is when As_String | As_Expr_Text => S : Unbounded_String; when As_Number => F : Long_Float := 0.0; Special : Special_Number_Values := Normal; when As_Boolean => B : Boolean := False; when As_Node_List => Ns: Dom.Core.Node_List; end case; end record; -- List in which function call arguments values are stored type Argument_List is array (Natural range <>) of Expression_Values; -- Empty argument list No_Arguments : Argument_List(1..0); -- Force the value to take on a value consistent with the specified -- target type. If there is no reasonable value for that type, -- raise the Invalid_Coercion exception. procedure Coerce (Value : in out Expression_Values; -- The value to coerce into a value consistent with the target type To_Type : in Value_Types := As_String -- Target type for the value ); Invalid_Coercion : exception; -- Raised when an expression cannot be coerced to the requested type -- Relational operators between two expressions type Relational_Operators is (Less_Than, Less_Or_Equal, Equal, Not_Equal, Greater_Or_Equal, Greater_Than); -- Relationally compare the two expressions, returning whether or -- not the two expressions have the specified relationship. function Compare (Expr1 : Expression_Values; -- Comparison operand 1 Expr2 : Expression_Values; -- Comparison operand 2 Operator : Relational_Operators -- The relationship to evaluate between the two expressions ) return Boolean; -- Basic math computations that can be performed on expressions type Computations is (Add, Subtract, Multiply, Divide, Modulo, Negate); -- Perform the designated computations on the two expression -- operands. The operands will have their types harmonized, so if -- that cannot be accomplished, Invalid_Coercion will be raised. -- For unary minus (negation), Expr2 will be ignored. function Compute (Expr1 : Expression_Values; -- Comparison operand 1 Expr2 : Expression_Values; -- Comparison operand 2 Computation : Computations -- The mathematical operation to perform ) return Expression_Values; Invalid_Expression : exception; -- Raised when there are problems evaluating an expression, such as -- wrong number of arguments, incorrect argument types, or simply -- an unrecognized function name. -- Evaluate the core library function in the context of the given -- node. procedure Evaluate_Function (Function_Name : in String_Ptr; Context_Node : in Node_Items; Args : in out Argument_List; Result : out Expression_Values); end Mckae.XML.XPath.Expressions; xia-1.00/mckae-xml-xpath-locations.adb0100666000076600007670000001040610212334346016542 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Unchecked_Deallocation; with Text_Io; use Text_IO; package body Mckae.XML.XPath.Locations is use McKae.XML.XPath; ------------------------------------------------------------------- Parsing_Path : Location_Paths; ------------------------------------------------------------------- procedure Free is new Unchecked_Deallocation(Location_Path_Steps, Location_Path_Steps_Handle); ------------------------------------------------------------------- procedure Add (Location_Step : in Location_Steps; Location_Path : in out Location_Paths) is Curr_Path : Location_Path_Steps_Handle := Location_Path.Path; Steps : Natural renames Location_Path.Steps; begin pragma Debug(Put_Line("Adding: " & To_String(Location_Step.Node_Test.Name))); if Location_Path.Steps = Location_Path.Path'Length then -- Reallocate a larger path Location_Path.Path := new Location_Path_Steps(1 .. Steps * 2); Location_Path.Path(Curr_Path'Range) := Curr_Path.all; Free(Curr_Path); end if; Steps := Steps + 1; Location_Path.Path(Steps) := Location_Step; end Add; ------------------------------------------------------------------- procedure Add (Location_Step : in Location_Steps) is begin Add(Location_Step, Parsing_Path); end Add; ------------------------------------------------------------------- procedure Free(Location_Path : in out Location_Paths) is begin for P in Location_Path.Path'Range loop Predicates.Release(Location_Path.Path(P).Location_Predicates); end loop; Free(Location_Path.Path); Location_Path.Path := null; end Free; ------------------------------------------------------------------- function Get_Path return Location_Paths is begin return Parsing_Path; end Get_Path; ------------------------------------------------------------------- procedure Reset_For_Parsing is begin Parsing_Path := (Steps => 0, Absolute => False, Path => new Location_Path_Steps(1 .. 10)); end Reset_For_Parsing; end Mckae.XML.XPath.Locations; xia-1.00/mckae-xml-xpath-locations.ads0100666000076600007670000001323410212334346016565 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Ada.Strings.Unbounded; with Mckae.XML.XPath.Predicates; with Unicode.CES; package Mckae.XML.XPath.Locations is use Ada.Strings.Unbounded; use McKae.XML.XPath; -- XPath axes type Axes is (Child_Axis, Parent_Axis, Self_Axis, Preceding_Sibling_Axis, Following_Sibling_Axis, Ancestor_Axis, Ancestor_Or_Self_Axis, Namespace_Axis, Attribute_Axis, Descendant_Or_Self_Axis, Descendant_Axis, Following_Axis, Preceding_Axis); -- No explicit axis implies the child axis No_Axis : constant Axes := Child_Axis; -- Axes whose traversal consists of immediate, direct traversals subtype Immediate_Axes is Axes range Child_Axis .. Attribute_Axis; -- Axes whose traversal requires the traversal of branchings subtype Branched_Axes is Axes range Descendant_Or_Self_Axis .. Preceding_Axis; type Axes_Directionality is array (Axes) of Boolean; Reverse_Axis : constant Axes_Directionality := (Ancestor_Axis | Ancestor_Or_Self_Axis | Preceding_Axis | Preceding_Sibling_Axis => True, others => False); Forward_Axis : constant Axes_Directionality := not Reverse_Axis; -- Kinds of node tests type Node_Tests is (No_Node_Test, QName_Node_Test, NCName_Node_Test, Text_Node_Test, Comment_Node_Test, Processing_Instruction_Node_Test, Node_Node_Test); ---------------------------------------------------------------- -- Specification of the node test portion of a location step type Node_Test_Specification (Node_Test : Node_Tests := No_Node_Test) is record Name : Unbounded_String; case Node_Test is when QName_Node_Test => Prefix : Unbounded_String; when No_Node_Test | NCName_Node_Test | Text_Node_Test | Comment_Node_Test | Processing_Instruction_Node_Test | Node_Node_Test => null; end case; end record; -- Location step, the part in between '/'s type Location_Steps is record Axis : Axes := No_Axis; Node_Test : Node_Test_Specification; Location_Predicates : Predicates.Predicate_Handles; Output_Step : Boolean := False; end record; -- A sequence of location steps type Location_Path_Steps is array (Natural range <>) of Location_Steps; type Location_Path_Steps_Handle is access Location_Path_Steps; type Location_Paths is record Absolute : Boolean; Steps : Natural := 0; Path : Location_Path_Steps_Handle := new Location_Path_Steps(1 .. 10); end record; -- Redefinition of strings to be compatible with the DOM interface subtype Xpath_String is Unicode.CES.Byte_Sequence; -- Add a newly defined location step to the path procedure Add ( Location_Step : in Location_Steps -- Newly defined location step ); -- Return the location path structure generated by parsing the -- Xpath query. IMPORTANT! The Location_Path returned by this -- function must be subsequently freed using the corresponding -- Free procedure. function Get_Path return Location_Paths; -- Release the resources used by the construction of a location path procedure Free(Location_Path : in out Location_Paths); -- Reset the location path processing for a new query. This must -- be called before invoking the Xia_Parser_Model.Pathify -- procedure. procedure Reset_For_Parsing; end Mckae.XML.XPath.Locations; xia-1.00/mckae-xml-xpath-node_sets.adb0100666000076600007670000001220710212334346016533 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Bc.Support.Standard_Storage; with System.Address_To_Access_Conversions; with System.Storage_Elements; package body Mckae.XML.XPath.Node_Sets is --------------------------------------------------------------------- function Null_Container return Set is Empty: Set; begin return Empty; end Null_Container; --------------------------------------------------------------------- procedure Insert (C : in out Set; Elem : Current_Matchings) is -- Add the item to the front of the collection. Not_Present : Boolean := False; Item : Current_Matchings := Elem; begin Match_Nodes.Add(C.Presence, Elem.Matching_Node, Not_Present); if Not_Present then Matchings_Sets.Insert(Matchings_Sets.Collection(C), Item); end if; end Insert; --------------------------------------------------------------------- procedure Append (C : in out Set; Elem : Current_Matchings) is -- Add the item to the collection, starting at the end, if it -- is not already in the set Not_Present : Boolean := False; Item : Current_Matchings := Elem; begin Match_Nodes.Add(C.Presence, Elem.Matching_Node, Not_Present); if Not_Present then Matchings_Sets.Append(Matchings_Sets.Collection(C), Item); end if; end Append; --------------------------------------------------------------------- procedure Clear (C : in out Set) is -- Clear the node set _and_ the associated node presence list begin Matchings_Sets.Clear(Matchings_Sets.Collection(C)); Match_Nodes.Clear(C.Presence); end Clear; ------------------------------------------------------------------- procedure Union (S : in out Set; O : Set) is Iter : Matchings_Containers.Iterator'Class := New_Iterator(O); begin while not Matchings_Containers.Is_Done(Iter) loop Append(S, Matchings_Containers.Current_Item(Iter)); Matchings_Containers.Next(Iter); end loop; end Union; --------------------------------------------------------------------- function "<"(L, R : Sortable_Matches) return Boolean is begin return L.Key < R.Key; end "<"; --------------------------------------------------------------------- package Node_Hashing_Package is new System.Address_To_Access_Conversions(Dom.Core.Node_Record); -- Since Node is a pointer, and addresses are nearly always even, -- and also usually divisible by 4, drop the lower two bits of the -- address. function Generate_Hash(N : Node) return Natural is use System.Storage_Elements; use Node_Hashing_Package; -- Convert the node access value to an address Node_Addr : constant System.Address := To_Address(Node_Hashing_Package.Object_Pointer(N)); Natural_Bit_Factor : constant System.Storage_Elements.Storage_Offset := (2 ** (Natural'Size - 1)); begin return Natural(Node_Addr mod Natural_Bit_Factor) / 4; end Generate_Hash; ------------------------------------------------------------------- end Mckae.XML.XPath.Node_Sets; xia-1.00/mckae-xml-xpath-node_sets.ads0100666000076600007670000001276610212334346016566 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Bc.Containers.Collections.Unbounded; with Bc.Containers.Sets.Unbounded; with Bc.Containers.Trees.Avl; with Bc.Support.Standard_Storage; with Dom.Core; use Dom.Core; with Mckae.XML.XPath.Locations; use Mckae.XML.XPath.Locations; with Mckae.Space.Unbounded_String_Expandable; use Mckae.Space.Unbounded_String_Expandable; package Mckae.XML.XPath.Node_Sets is -- Record information about node-set member nodes type Current_Matchings (Axis : Axes := No_Axis) is record Matching_Node : Node; case Axis is when Attribute_Axis => Owner_Node : Node; -- Work around bug in XMLAda wherein the -- parent node of an attribute is always -- set to Null, making it impossible to -- get the owner element Attr_Index : Natural; when Branched_Axes => Branch_Step : Location_Steps; when others => null; end case; end record; ------------------------------------------------------------------- package Matchings_Containers is new BC.Containers (Item => Current_Matchings); package Matchings_Collections is new Matchings_Containers.Collections; package Matchings_Sets is new Matchings_Collections.Unbounded (Storage => BC.Support.Standard_Storage.Pool); type Set is new Matchings_Sets.Collection with private; function Null_Container return Set; procedure Insert (C : in out Set; Elem : Current_Matchings); -- Add the item to the front of the collection, if it is not -- already in the set procedure Append (C : in out Set; Elem : Current_Matchings); -- Add the item to the collection, starting at the end, if it is -- not already in the set procedure Clear (C : in out Set); -- Empty the collection of all items. procedure Union (S : in out Set; O : Set); -- Perform a logical set union; at the completion of this -- operation, the set S contains the items found in its original -- state combined with the set O (but without duplication). For -- each item in the set O, if the item is not already a distinct -- member of the set S, copy the item and add it to the set S. If -- the item already is a member, do nothing. ------------------------------------------------------------------- type Sortable_Matches is record Key : Expandable_String; Matched_Node : Node; end record; function "<"(L, R : Sortable_Matches) return Boolean; package Sorting_Containers is new BC.Containers (Item => Sortable_Matches); package Match_Trees is new Sorting_Containers.Trees; package Sortable_Matching_Tree is new Match_Trees.Avl (Storage => BC.Support.Standard_Storage.Pool); private -- Use some of the lower bits of the address of the "Node" pointer -- to be the hash value. function Generate_Hash(N : Node) return Natural; --------------------------------------------------------------------- package Match_Nodes_Containers is new BC.Containers (Item => Dom.Core.Node); package Match_Nodes_Sets is new Match_Nodes_Containers.Sets; package Match_Nodes is new Match_Nodes_Sets.Unbounded (Hash => Generate_Hash, Buckets => 991, Storage => BC.Support.Standard_Storage.Pool); type Set is new Matchings_Sets.Collection with record Presence : Match_Nodes.Set; end record; end Mckae.XML.XPath.Node_Sets; xia-1.00/mckae-xml-xpath-predicates.adb0100666000076600007670000000612510212334346016675 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ package body McKae.XML.XPath.Predicates is ------------------------------------------------------------------------ procedure Release(Handle : in out Predicate_Handles) is begin Predicate_Handle_Pkg.Clear(Handle.Predicate_List); Handle := Null_Predicate; end Release; ------------------------------------------------------------------------ function "<"(L, R : Xia_Parser_Model.Parseable_Ptr) return Boolean is -- There is no imposed ordering of token ptrs, return False to -- ensure that each one gets appended begin return False; end "<"; ------------------------------------------------------------------------ procedure Add_Predicate_Parse (Handle : in out Predicate_Handles; T : in Xia_Parser_Model.Parseable_Ptr) is begin Predicate_Handle_Pkg.Append(Handle.Predicate_List, T); end Add_Predicate_Parse; ------------------------------------------------------------------------ end McKae.XML.XPath.Predicates; xia-1.00/mckae-xml-xpath-predicates.ads0100666000076600007670000001017410212334346016715 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with BC.Containers.Collections.Ordered.Unbounded; with Bc.Support.Standard_Storage; with XIA_Parser_Model; package McKae.XML.XPath.Predicates is -- Handle to the predicate content type Predicate_Handles is private; -- Add the pointer to the root node of a parse subtree that was -- created for a predicate procedure Add_Predicate_Parse (Handle : in out Predicate_Handles; T : in Xia_Parser_Model.Parseable_Ptr); -- Null instances of a predicate definition Null_Predicate : constant Predicate_Handles; -- Release the contents of a predicate handle (which may consists -- of one or more individual predicate definitions). Not that -- this does _not_ release the associated parse subtree associated -- with each predicate instance. procedure Release(Handle : in out Predicate_Handles); Malformed_Predicate : exception; -- Raised when a supplied query predicate does not conform to -- predicate syntax private function "="(L, R : Xia_Parser_Model.Parseable_Ptr) return Boolean renames Xia_Parser_Model."="; -- This is a "filler" less-than function. There is no intrinsic -- ordering of token pointer instances. The Ordered variation of -- the collection is being used to simply ensure that the contents -- of the list are maintained in the order in which they're -- inserted. function "<"(L, R : Xia_Parser_Model.Parseable_Ptr) return Boolean; package Predicate_Containers is new Bc.Containers(Item => Xia_Parser_Model.Parseable_Ptr); package Predicate_Collections is new Predicate_Containers.Collections; package Ordered_Predicate_Collections is new Predicate_Collections.Ordered; package Predicate_Handle_Pkg is new Ordered_Predicate_Collections.Unbounded (Storage => BC.Support.Standard_Storage.Pool); type Predicate_Handles is record Predicate_List : Predicate_Handle_Pkg.Collection; end record; Null_Predicate : constant Predicate_Handles := (Predicate_List => Predicate_Handle_Pkg.Null_Container); end McKae.XML.XPath.Predicates; xia-1.00/mckae-xml-xpath-predicates-evaluation.adb0100666000076600007670000001161410212334346021041 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Mckae.XML.XPath.Expressions; with Xia_Parser_Model; package body McKae.XML.XPath.Predicates.Evaluation is use Xia_Parser_Model; ---------------------------------------------------------------------- procedure Evaluate_Predicate (Nodes : in out Node_Sets.Set; Handle : in Predicate_Handles; Originating_Axis : in Locations.Axes) is use Mckae.XML.XPath; Iter : Node_Sets.Matchings_Containers.Iterator'Class := Node_Sets.New_Iterator(Nodes); Node_Set_Size : Natural := Node_Sets.Length(Nodes); Node_Item_Index : Natural := 0; Node_Item_Position : Natural := 0; Node_Item : Expressions.Node_Items; Expression : Expressions.Expression_Values; Predicate_Count : constant Natural := Predicate_Handle_Pkg.Length(Handle.Predicate_List); Filtered_Nodes : Node_Sets.Set; begin if Predicate_Count >= 1 then for P in 1 .. Predicate_Count loop Node_Item_Index := 1; Node_Set_Size := Node_Sets.Length(Nodes); Node_Sets.Matchings_Containers.Reset(Iter); while not Node_Sets.Matchings_Containers.Is_Done(Iter) loop if Locations.Forward_Axis(Originating_Axis) then Node_Item_Position := Node_Item_Index; else pragma Assert(Locations.Reverse_Axis(Originating_Axis)); Node_Item_Position := (Node_Set_Size - Node_Item_Index) + 1; end if; Node_Item := (N => Node_Sets.Matchings_Containers.Current_Item(Iter). Matching_Node, Node_Position => Node_Item_Position, Node_Set_Size => Node_Set_Size); Xia_Parser_Model.Evaluate(Predicate_Handle_Pkg.Item_At(Handle.Predicate_List, P).all, Node_Item, Expression); Expressions.Coerce(Expression, Expressions.As_Boolean); if Expression.B then Node_Sets.Append(Filtered_Nodes, Node_Sets.Matchings_Containers.Current_Item(Iter)); end if; Node_Sets.Matchings_Containers.Next(Iter); Node_Item_Index := Node_Item_Index + 1; end loop; Node_Sets.Clear(Nodes); Nodes := Filtered_Nodes; Node_Sets.Clear(Filtered_Nodes); end loop; end if; exception when Expressions.Invalid_Coercion | Expressions.Invalid_Expression => raise Malformed_Predicate; end Evaluate_Predicate; ---------------------------------------------------------------------- end McKae.XML.XPath.Predicates.Evaluation; xia-1.00/mckae-xml-xpath-predicates-evaluation.ads0100666000076600007670000000622510212334346021064 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Mckae.XML.XPath.Node_Sets; with Mckae.XML.XPath.Locations; package McKae.XML.XPath.Predicates.Evaluation is ---------------------------------------------------------------------- procedure Evaluate_Predicate (Nodes : in out Node_Sets.Set; -- Node set to filter (these were attracted via the -- axis and node test Handle : in Predicate_Handles; -- The list of predicate filters to run the node -- set through Originating_Axis : in Locations.Axes -- The axis via which the node set was selected ); -- Filter the node set through the given predicate(s), with the -- result being only those nodes that pass the filter. The -- Originating_Axis parameter governs whether forward or reverse -- document will be followed when indexing nodes. end McKae.XML.XPath.Predicates.Evaluation; xia-1.00/mckae-xml-xpath-query_handling.adb0100666000076600007670000000634410212334346017566 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Mckae.XML.XPath.Locations; with Xia_Parser_Model; with Xia_Parser_Parser; package body Mckae.XML.XPath.Query_Handling is -- Decode the string representation of the location path into its -- components parts function Pathify( Xpath_Query : Locations.Xpath_String -- The XPath query to decode ) return Locations.Location_Paths is Parse_Tree : Xia_Parser_model.Parseable_ptr; Path : Locations.Location_Paths; begin xia_parser_parser.run(Xpath_Query); parse_tree := xia_parser_parser.get_parse_tree; Locations.Reset_For_Parsing; Xia_Parser_Model.Pathify(parse_tree.all); Path := Locations.Get_Path; Path.Absolute := Xpath_Query(1) = '/'; Path.Path(Path.Steps).Output_Step := True; return Path; exception when Xia_Parser_Parser.Syntax_Error => raise Malformed_Query; end Pathify; -- Release the resources used by the construction of a location path procedure Free(Location_Path : in out Locations.Location_Paths) is begin Locations.Free(Location_Path); end Free; end Mckae.XML.XPath.Query_Handling; xia-1.00/mckae-xml-xpath-query_handling.ads0100666000076600007670000000533010212334346017601 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Mckae.XML.XPath.Locations; package Mckae.XML.XPath.Query_Handling is use McKae.XML.XPath; -- Decode the string representation of the location path into its -- components parts function Pathify( Xpath_Query : Locations.Xpath_String -- The XPath query to decode ) return Locations.Location_Paths; -- Release the resources used by the construction of a location path procedure Free(Location_Path : in out Locations.Location_Paths); -- Exception raised when the query does not conform to XPath syntax Malformed_Query : exception; end Mckae.XML.XPath.Query_Handling; xia-1.00/mckae-xml-xpath-xia.adb0100666000076600007670000006465310212334346015345 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Ada.Strings.Fixed; use Ada.Strings.Fixed; with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Dom.Core.Append_Node; --with Dom.Core.Attrs; with Dom.Core.Nodes; with Mckae.Space.Unbounded_String_Expandable; with Mckae.Xml.Xpath.Locations; use Mckae.Xml.Xpath.Locations; with Mckae.Xml.Xpath.Node_Sets; with Mckae.XML.XPath.Predicates; with Mckae.XML.XPath.Predicates.Evaluation; with McKae.XML.XPath.Query_Handling; with XIA_Parser_Parser; package body Mckae.XML.XPath.XIA is use Ada.Strings; use Dom.Core; use Dom.Core.Nodes; use Mckae.Space.Unbounded_String_Expandable; ------------------------------------------------------------------- procedure Do_Final_Traversal (N : in Node; Location_Step : in Location_Steps; Matchings : in out Node_Sets.Set; Include_Self : in Boolean := True); ------------------------------------------------------------------- procedure Get_Index_And_List (Of_Node : in Node; Index : out Natural; List : out Node_List) is P : Node := Parent_Node(Of_Node); begin Index := 0; if P /= null then List := Child_Nodes(P); for I in 1 .. Length(List) loop Index := I - 1; exit when Of_Node = Item(List, Index); end loop; end if; end Get_Index_And_List; ------------------------------------------------------------------- function Query_Separator_Index(S : String) return Natural is -- Search for a '|' in the string, which signifies the separator -- between queries being unioned together. However, beware -- such vertical bars embedded in strings and predicates. End_Quote : Character := '"'; End_Predicate : constant Character := ']'; Quoting : Boolean := False; Predicating : Boolean := False; begin for I in S'Range loop if Quoting then -- Ignore everything other than the match close quote character Quoting := S(I) /= End_Quote; elsif Predicating then -- Ignore everything until the predicate's end bracket Predicating := S(I) /= End_Predicate; if S(I) = ''' then End_Quote := '''; Quoting := True; elsif S(I) = '"' then End_Quote := '"'; Quoting := True; end if; else -- Could be anything, check to see if it's special. If -- not signaling the start of a quote or predicate, just -- keep on going. if S(I) = ''' then End_Quote := '''; Quoting := True; elsif S(I) = '"' then End_Quote := '"'; Quoting := True; elsif S(I) = '[' then Predicating := True; elsif S(I) = '|' then return I; end if; end if; end loop; return 0; end Query_Separator_Index; ------------------------------------------------------------------- procedure Predicate_Filtration (Matchings : in out Node_Sets.Set; Location_Step : in Location_Steps) is begin Predicates.Evaluation.Evaluate_Predicate (Matchings, Location_Step.Location_Predicates, Location_Step.Axis); exception when Predicates.Malformed_Predicate => raise Malformed_Xpath; end Predicate_Filtration; ------------------------------------------------------------------- function Is_Node_Match (N : Node; Ls : Location_Steps) return Boolean is use type Predicates.Predicate_Handles; NT : Node_Test_Specification := Ls.Node_Test; Match : Boolean := False; begin case NT.Node_Test is when Node_Node_Test => -- Matches anything Match := True; when NCName_Node_Test => Match := (((N.Node_Type = Element_Node) or (N.Node_Type = Attribute_Node)) and (NT.Name = "*")) or (NT.Name = Node_Name(N)); when QName_Node_Test => Match := ((NT.Prefix = "*") and ((NT.Name = "*") or (NT.Name = Prefix(N)))) or ((NT.Name = "*") and ((NT.Prefix = "*") or (NT.Prefix = Local_Name(N)))) or ((NT.Prefix = Prefix(N)) and (NT.Name = Local_Name(N))); when Text_Node_Test => Match := N.Node_Type = Text_Node; when Comment_Node_Test => Match := N.Node_Type = Comment_Node; when Processing_Instruction_Node_Test => Match := (N.Node_Type = Processing_Instruction_Node) and NT.Name = Node_Value(N); when No_Node_Test => pragma Assert (False); null; end case; return Match; end Is_Node_Match; ------------------------------------------------------------------- procedure Do_Matching (N : in Node; Location_Step : in Location_Steps; Matchings : in out Node_Sets.Set; Attr_Parent : in Node := null) is Ancestor : Node; Child : Node; Children : Node_List; N_Index : Natural; Attr : Node; Attrs : Named_Node_Map; use Node_Sets; -- This function masks the DOM.Core.Parent_Node function so as -- to work around its bug when it comes to returning the parent -- of attribute nodes function Parent_Node(N : in Node) return Node is begin if Attr_Parent = null then -- No attribute parent node was provided, so the node was -- not an attribute return DOM.Core.Nodes.Parent_Node(N); else return Attr_Parent; end if; end Parent_Node; begin -- The first set of axes is for those for which an immediate -- determination of node matching is made. case Location_Step.Axis is when Child_Axis => -- Check to see if any of the children match Children := Child_Nodes(N); for I in 1 .. Length(Children) loop Child := Item(Children, I - 1); if Is_Node_Match(Child, Location_Step) then Append(Matchings, (Self_Axis, Child)); end if; end loop; when Following_Sibling_Axis => Get_Index_And_List(N, N_Index, Children); for I in N_Index + 1 .. Length(Children) - 1 loop Child := Item(Children, I); if Is_Node_Match(Child, Location_Step) then Append(Matchings, (Self_Axis, Child)); end if; end loop; when Preceding_Sibling_Axis => Get_Index_And_List(N, N_Index, Children); for I in 0 .. N_Index - 1 loop Child := Item(Children, I); if Is_Node_Match(Child, Location_Step) then Append(Matchings, (Self_Axis, Child)); end if; end loop; when Self_Axis | Parent_Axis => -- Get the starting node for the upwards traversal if Location_Step.Axis = Parent_Axis then Ancestor := Parent_Node(N); else Ancestor := N; end if; -- Check the node for a match if (Ancestor /= null) and then Is_Node_Match(Ancestor, Location_Step) then Append(Matchings, (Self_Axis, Ancestor)); end if; when Ancestor_Axis | Ancestor_Or_Self_Axis => -- Get the starting node for the upwards traversal if Location_Step.Axis = Ancestor_Axis then Ancestor := Parent_Node(N); else Ancestor := N; -- I am my mother :-) end if; -- Any matches in the ancestor chain? loop exit when Ancestor = null; if Is_Node_Match(Ancestor, Location_Step) then Insert(Matchings, (Self_Axis, Ancestor)); end if; Ancestor := Parent_Node(Ancestor); end loop; when Attribute_Axis => Attrs := Attributes(N); for I in 1 .. Length(Attrs) loop Attr := Item(Attrs, I - 1); if Is_Node_Match(Attr, Location_Step) then Append(Matchings, (Attribute_Axis, Attr, Owner_Node => N, Attr_Index => I)); end if; end loop; -- The tests for the remaining axes is deferred -- until they can be done in conjunction with the -- next path step when Branched_Axes => if not Location_Step.Output_Step then declare Deferred_Match : Node_Sets.Current_Matchings(Location_Step.Axis); begin Deferred_Match.Matching_Node := N; Deferred_Match.Branch_Step := Location_Step; Append(Matchings, Deferred_Match); end; else Do_Final_Traversal(N, Location_Step, Matchings, Location_Step.Axis = Descendant_Or_Self_Axis); end if; when Namespace_Axis => pragma Assert(False); null; -- TBD end case; end Do_Matching; ------------------------------------------------------------------- procedure Descendant_Traversal (N : in Node; Deferred_Step : in Location_Steps; Location_Step : in Location_Steps; Matchings : in out Node_Sets.Set; Include_Self : in Boolean := True) is Children : Node_List; Child : Node; begin -- This node matches the original traversal-requiring match, now -- check the next location step if Include_Self and Is_Node_Match(N, Deferred_Step) then Do_Matching(N, Location_Step, Matchings); end if; -- Process the child nodes Children := Child_Nodes(N); for I in 1 .. Length(Children) loop Child := Item(Children, I - 1); Descendant_Traversal(Child, Deferred_Step, Location_Step, Matchings); end loop; end Descendant_Traversal; ------------------------------------------------------------------- procedure Following_Traversal (N : in Node; Deferred_Step : in Location_Steps; Location_Step : in Location_Steps; Matchings : in out Node_Sets.Set) is -- Process the rest of the nodes in this list and their -- descendants, then go to the parent and process all its -- subsequent nodes This_List : Node_List; N_Index : Natural; begin if N /= null then Get_Index_And_List(N, N_Index, This_List); -- Process the following siblings and all descendants for I in N_Index + 1 .. Length(This_List) - 1 loop Descendant_Traversal(Item(This_List, I), Deferred_Step, Location_Step, Matchings); end loop; -- Now go to the parent Following_Traversal(Parent_Node(N), Deferred_Step, Location_Step, Matchings); end if; end Following_Traversal; ------------------------------------------------------------------- procedure Preceding_Traversal (N : in Node; Deferred_Step : in Location_Steps; Location_Step : in Location_Steps; Matchings : in out Node_Sets.Set) is -- Process the previous of the nodes in this list and their -- descendants, then go to the parent and process all its -- preceding nodes This_List : Node_List; N_Index : Natural; begin if N /= null then Get_Index_And_List(N, N_Index, This_List); -- Process the following siblings and all descendants for I in 0 .. N_Index - 1 loop Descendant_Traversal(Item(This_List, I), Deferred_Step, Location_Step, Matchings); end loop; -- Now go to the parent Preceding_Traversal(Parent_Node(N), Deferred_Step, Location_Step, Matchings); end if; end Preceding_Traversal; ------------------------------------------------------------------- procedure Deferred_Traversal (Location_Step : in Location_Steps; Match : in Node_Sets.Current_Matchings; Matchings : in out Node_Sets.Set) is begin case Match.Branch_Step.Axis is when Descendant_Or_Self_Axis | Descendant_Axis => Descendant_Traversal(Match.Matching_Node, Match.Branch_Step, Location_Step, Matchings, Match.Branch_Step.Axis = Descendant_Or_Self_Axis); when Following_Axis => Following_Traversal(Match.Matching_Node, Match.Branch_Step, Location_Step, Matchings); when Preceding_Axis => Preceding_Traversal(Match.Matching_Node, Match.Branch_Step, Location_Step, Matchings); when others => pragma Assert(False); null; end case; end Deferred_Traversal; ------------------------------------------------------------------- procedure Do_Final_Traversal (N : in Node; Location_Step : in Location_Steps; Matchings : in out Node_Sets.Set; Include_Self : in Boolean := True) is Children : Node_List; Child : Node; Siblings : Node_List; N_Index : Natural; Mod_Step : Location_Steps := Location_Step; begin case Location_Step.Axis is when Descendant_Or_Self_Axis | Descendant_Axis => -- This node matches the original traversal-requiring match, now -- check the next location step if Include_Self and Is_Node_Match(N, Location_Step) then Node_Sets.Append (Matchings, (Self_Axis, N)); end if; -- Process the child nodes Children := Child_Nodes(N); for I in 1 .. Length(Children) loop Child := Item(Children, I - 1); Do_Final_Traversal(Child, Location_Step, Matchings); end loop; when Following_Axis => if N /= null then Get_Index_And_List(N, N_Index, Siblings); Mod_Step.Axis := Descendant_Axis; -- Process the following siblings and all descendants for I in N_Index + 1 .. Length(Siblings) - 1 loop Child := Item(Siblings, I); Do_Final_Traversal(Child, Mod_Step, Matchings); end loop; Do_Final_Traversal(Parent_Node(N), Location_Step, Matchings, Include_Self => False); end if; when Preceding_Axis => if N /= null then Get_Index_And_List(N, N_Index, Siblings); Mod_Step.Axis := Descendant_Axis; -- Process the preceding siblings and all descendants for I in 0 .. N_Index - 1 loop Child := Item(Siblings, I); Do_Final_Traversal(Child, Mod_Step, Matchings); end loop; Do_Final_Traversal(Parent_Node(N), Location_Step, Matchings, Include_Self => False); end if; when others => pragma Assert(False); null; end case; end Do_Final_Traversal; ------------------------------------------------------------------- procedure Extract_Nodes (Location_Step : in Location_Steps; Matchings : in out Node_Sets.Set) is Match : Node_Sets.Current_Matchings; New_Matchings : Node_Sets.Set; Iter : Node_Sets.Matchings_Containers.Iterator'Class := Node_Sets.New_Iterator(Matchings); use type Predicates.Predicate_Handles; begin -- Iterate through the current set of matchings, evaluating each -- against the path step while not Node_Sets.Matchings_Containers.Is_Done(Iter) loop Match := Node_Sets.Matchings_Containers.Current_Item(Iter); -- Check whether this is a direct node check, or a deferred traversal if Match.Axis = Self_Axis then Do_Matching(Match.Matching_Node, Location_Step, New_Matchings); elsif Match.Axis = Attribute_Axis then -- This is a workaround for an XML/Ada bug wherein -- invoking Parent_Node() on an attribute node returns -- null instead of its parent. Do_Matching(Match.Matching_Node, Location_Step, New_Matchings, Match.Owner_Node); else -- A deferred traversal Deferred_Traversal(Location_Step, Match, New_Matchings); end if; Node_Sets.Matchings_Containers.Next(Iter); end loop; -- Now check the predicate criteria if Location_Step.Location_Predicates /= Predicates.Null_Predicate then Predicate_Filtration(New_Matchings, Location_Step); end if; Node_Sets.Clear(Matchings); Matchings := New_Matchings; exception when Xia_Parser_Parser.Syntax_Error => raise Malformed_XPath; end Extract_Nodes; ------------------------------------------------------------------- procedure Evaluate_Location_Path (XPath : in String; Matchings : in out Node_Sets.Set) is Query : String := Trim(XPath, Both); Location_Steps : Location_Paths; begin -- Split up the location path into discrete steps Location_Steps := Query_Handling.Pathify(Query); for S in 1 .. Location_Steps.Steps loop Extract_Nodes(Location_Steps.Path(S), Matchings); exit when Node_Sets.Is_Empty(Matchings); end loop; Free(Location_Steps); exception when Query_Handling.Malformed_Query => raise Malformed_XPath; end Evaluate_Location_Path; ------------------------------------------------------------------- procedure Create_Node_Key(Node_Sorter : in out Node_Sets.Sortable_Matches) is This_List : Node_List; Index : Natural; Parent : Node; begin Get_Index_And_List(Node_Sorter.Matched_Node, Index, This_List); Parent := Parent_Node(Node_Sorter.Matched_Node); if Parent /= null then Node_Sorter.Matched_Node := Parent; Create_Node_Key(Node_Sorter); end if; declare Zeroed_Index : constant Natural := Index + 1000000; Index_Img : constant String := Natural'Image(Zeroed_Index); begin Append(Node_Sorter.Key, Index_Img(3 .. Index_Img'Last)); end; end Create_Node_Key; ------------------------------------------------------------------- Sorted_Results : Node_List; procedure Output_Node (Elem : in Node_Sets.Sortable_Matches; Ok : out Boolean) is begin Dom.Core.Append_Node(Sorted_Results, Elem.Matched_Node); Ok := True; end Output_Node; procedure Output_Nodes is new Node_Sets.Sortable_Matching_Tree.Visit(Output_Node); ------------------------------------------------------------------- procedure Finalize_Matchings (Matchings : in Node_Sets.Set; Xpath_Nodes : out Node_List) is use Node_Sets.Sortable_Matching_Tree; Sorting_Tree : Avl_Tree; Matching_Node : Node; Iter : Node_Sets.Matchings_Containers.Iterator'Class := Node_Sets.New_Iterator(Matchings); Current : Node_Sets.Current_Matchings; Node_Sorter : Node_Sets.Sortable_Matches; Node_Key : Expandable_String; Not_Found : Boolean; Empty_Node_List : Node_List; begin Sorted_Results := Empty_Node_List; -- Perform a tree insertion sort of all the nodes while not Node_Sets.Matchings_Containers.Is_Done(Iter) loop -- Get the matching info for the node Current := Node_Sets.Matchings_Containers.Current_Item(Iter); pragma Assert((Current.Axis = Self_Axis) or (Current.Axis = Attribute_Axis)); -- Most nodes are simply a node on the DOM tree; attribute -- nodes are "special" for some reason, so we have to go get -- their owner element specifically Matching_Node := Current.Matching_Node; if Current.Axis = Attribute_Axis then -- Matching_Node := Attrs.Owner_Element(Current.Matching_Node); ----- Workaround bug in XMLAda 1.0 ----- Matching_Node := Current.Owner_Node; end if; Node_Sorter.Matched_Node := Matching_Node; Clear(Node_Sorter.Key); Create_Node_Key(Node_Sorter); -- ... and because of this attribute node ownership -- silliness, an extra effort has to be made to get them -- back into document order if Current.Axis = Attribute_Axis then declare Zeroed_Index : constant Natural := Current.Attr_Index + 1000000; Index_Img : constant String := Natural'Image(Zeroed_Index); begin Append(Node_Sorter.Key, Index_Img(3 .. Index_Img'Last)); end; Matching_Node := Current.Matching_Node; end if; Copy(Node_Key, Node_Sorter.Key); Insert(Sorting_Tree, (Node_Key, Matching_Node), Not_Found); pragma Assert(Not_Found); Node_Sets.Matchings_Containers.Next(Iter); end loop; -- All the nodes are now inserted, do an in-order traversal to -- get the nodes back in document order Output_Nodes(Sorting_Tree); Xpath_Nodes := Sorted_Results; end Finalize_Matchings; ------------------------------------------------------------------- function XPath_Query (N : Node; XPath : String) return Node_List is Starting_Node : Node := N; Xpath_Nodes : Node_List; Start : Natural := 1; Split : Natural := 1; Query : String := Trim(XPath, Both); Matchings : Node_Sets.Set; Total_Matchings : Node_Sets.Set; begin loop Node_Sets.Clear(Matchings); -- The given node is either a document node or an element node -- within a document. Starting_Node := N; if Query(Start) = '/' then Starting_Node := Owner_Document(N); end if; if Starting_Node = null then raise Inappropriate_Node; end if; Node_Sets.Append (Matchings, (Self_Axis, Starting_Node)); -- Process this as a concatenation of queries, i.e., -- different queries separated by '|'. Watch out for '|'s -- embedded in predicates! Split := Query_Separator_Index(Query(Start .. Query'Last)); if Split = 0 then Evaluate_Location_Path(Query(Start .. Query'Last), Matchings); else Evaluate_Location_Path(Query(Start .. Split - 1), Matchings); end if; -- Merge the distinct sets Node_Sets.Union(Total_Matchings, Matchings); exit when Split = 0; Start := Split + 1; end loop; -- Iterate through the set of matchings, sorting them into -- document order and returning them as a Node_List; Finalize_Matchings(Total_Matchings, Xpath_Nodes); Node_Sets.Clear(Matchings); Node_Sets.Clear(Total_Matchings); return Xpath_Nodes; end XPath_Query; ------------------------------------------------------------------- end Mckae.XML.XPath.XIA; xia-1.00/mckae-xml-xpath-xia.ads0100666000076600007670000000617610212334346015362 0ustar g315padadev---------------------------------------------------------------------- -- -- -- XIA - XPath In Ada - An XPath Implementation for Ada 95 -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- This library is free software; you can redistribute it and/or -- -- modify it under terms of the GNU General Public License as -- -- published by the Free Software Foundation; either version 2, or -- -- (at your option) any later ver- sion. DTraq is distributed in -- -- the hope that it will be useful, but WITHOUT ANY WARRANTY; -- -- without even the implied warranty of MERCHANTABILITY or FITNESS -- -- FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU -- -- General Public License distributed with DTraq; see file -- -- COPYING. If not, write to the Free Software Foundation, 59 -- -- Temple Place - Suite 330, Boston, MA 02111-1307, USA. As a -- -- special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. -- -- This exception does not however invalidate any other reasons -- -- why the executable file might be covered by the GNU Public -- -- License. DTraq is maintained by McKae Technologies -- -- (http://www.dtraq.com). -- ---------------------------------------------------------------------- -- XIA (XPathInAda) is a native Ada implementation for querying XML -- documents using the XPath 1.0 query language. ---------------------------------------------------------------------- -- -- Known limitations: -- -- The core library function "id" is not yet implemented, as the -- XMLAda function Get_Element_By_ID is not yet implemented. -- Therfore invoking "id" will always result in an empty node-set. -- ---------------------------------------------------------------------- with Dom.Core; package Mckae.XML.XPath.XIA is function XPath_Query (N : Dom.Core.Node; -- A node in the XML tree against which the XPath query is -- submitted. XPath : String -- The XPath query. ) return Dom.Core.Node_List; -- Apply an XPath query, starting with the given node, in the case -- of a relative XPath query, or the document that contains the -- given node, otherwise. Returns a list of nodes, which may be -- empty, that meet the XPath specification. If the query does -- not follow XPath syntax, the Malformed_XPath exception is -- raised. Malformed_XPath : exception; -- Raised when the XPath query does not conform to XPath syntax. Inappropriate_Node : exception; -- Raised when the starting node does not correspond to the type of query end Mckae.XML.XPath.XIA; xia-1.00/test_xpath.adb0100666000076600007670000001353710212334121013733 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Ada.Strings.Fixed; with Ada.Strings.Maps; with Dom.Core.Nodes; with Mckae.XML.XPath.XIA; with Dom.Readers; with Unicode.CES; -- with Dtraq.Client_Transport; -- use Dtraq.Client_Transport; with Mckae.Xml.Xpath.Locations; with Input_Sources.File; with Text_IO; use Text_IO; procedure Test_Xpath is use Dom; use Dom.Core; use Input_Sources; use Mckae.Xml.XPath.Locations; use Mckae.Xml.XPath.XIA; use Ada.Strings.Fixed; use Ada.Strings.Maps; XML_Source_Reader : Dom.Readers.Tree_Reader; Queried_Nodes : Node_List; N : Node; Child : Node; Children : Node_List; Children_Printed : Boolean := False; File_Source : File.File_Input; S : String(1..255); L : Natural; procedure Print_Text_Node (T : Text; Indent : Boolean := False) is White_Space : constant Xpath_String := ' ' & Ascii.LF & Ascii.CR & ASCII.HT; White_Space_Set : constant Character_Set := To_Set(White_Space); S : Unicode.CES.Byte_Sequence := Trim(Nodes.Node_Value(T), White_Space_Set, White_Space_Set); begin if S'Length > 0 then if Indent then Put(" "); end if; Put_Line(S); end if; end Print_Text_Node; begin Put("Enter XML file name: "); Get_Line(S, L); File.Open(S(1..L), File_Source); Readers.Parse(XML_Source_Reader, File_Source); File.Close(File_Source); -- Connect_To_Server; loop Put("Enter XPath query: "); Get_Line(S, L); if S(1) /= '#' then -- Skip comment exit when L = 0; New_Line(2); Put_Line("Evaluating: " & S(1..L)); New_Line; begin Queried_Nodes := Xpath_Query(Readers.Get_Tree(XML_Source_Reader), S(1..L)); Put_Line("Number of nodes:" & Natural'Image(Dom.Core.Nodes.Length(Queried_Nodes))); for I in 0 .. Nodes.Length(Queried_Nodes) - 1 loop N := Dom.Core.Nodes.Item(Queried_Nodes, I); if N.Node_Type = Element_Node then Put("<"); Put(Nodes.Node_Name(N)); Put(">"); Children := Nodes.Child_Nodes(N); Children_Printed := False; for J in 0 .. Nodes.Length(Children) - 1 loop Child := Nodes.Item(Children, J); if Child.Node_Type = Element_Node then if not Children_Printed then New_Line; Children_Printed := True; end if; Put(" <"); Put(Nodes.Node_Name(Child)); Put_Line(">"); elsif Child.Node_Type = Text_Node then if not Children_Printed then New_Line; Children_Printed := True; end if; Print_Text_Node(Child, Indent => True); end if; end loop; Put(""); elsif N.Node_Type = Attribute_Node then Put(Nodes.Node_Name(N) & "="""); Put(Nodes.Node_Value (N)); Put_Line(""""); elsif N.Node_Type = Text_Node then Print_Text_Node(N); else Put(Nodes.Node_Value(N)); end if; end loop; exception when Malformed_XPath => Put_Line("Malformed query"); end; end if; end loop; -- Disconnect_From_Server; end Test_Xpath; xia-1.00/xia_parser.adb0100666000076600007670000006050210212334121013677 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with xia_parser_IO; package body xia_parser is Current_Line : Natural := 1; Current_Column : Natural := 1; procedure Reset(Set_String : in String) is begin Current_Line := 1; Current_Column := 1; xia_parser_IO.Open_Input (Set_String); -- xia_parser_IO.Create_Output; end Reset; procedure Close_Files is begin xia_parser_IO.Close_Input; -- xia_parser_IO.Close_Output; end Close_Files; function YYLex return Token is subtype short is integer range -32768..32767; yy_act : integer; yy_c : short; -- returned upon end-of-file YY_END_TOK : constant integer := 0; YY_END_OF_BUFFER : constant := 53; subtype yy_state_type is integer; yy_current_state : yy_state_type; INITIAL : constant := 0; yy_accept : constant array(0..183) of short := ( 0, 0, 0, 53, 52, 50, 51, 52, 52, 37, 52, 22, 23, 26, 27, 36, 28, 29, 31, 47, 33, 43, 39, 41, 35, 49, 24, 25, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 38, 40, 0, 46, 0, 45, 30, 48, 32, 47, 47, 34, 44, 42, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 21, 49, 49, 49, 49, 49, 18, 49, 49, 49, 49, 19, 49, 20, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 17, 49, 49, 49, 13, 15, 49, 49, 4, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 10, 49, 49, 49, 49, 14, 49, 49, 49, 49, 49, 1, 49, 49, 49, 49, 49, 49, 49, 3, 49, 7, 9, 11, 49, 49, 5, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 2, 49, 49, 49, 49, 49, 8, 12, 49, 6, 49, 49, 49, 49, 16, 0 ) ; yy_ec : constant array(CHARACTER'FIRST..ASCII.DEL) of short := ( 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 5, 1, 6, 1, 1, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 1, 18, 19, 20, 1, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 1, 24, 1, 25, 1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 22, 22, 35, 36, 37, 38, 39, 22, 40, 41, 42, 43, 44, 45, 46, 22, 22, 1, 47, 1, 1, 1 ) ; yy_meta : constant array(0..47) of short := ( 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1 ) ; yy_base : constant array(0..186) of short := ( 0, 0, 0, 200, 201, 201, 201, 180, 193, 201, 190, 201, 201, 201, 201, 201, 201, 34, 181, 35, 178, 175, 201, 174, 201, 0, 201, 201, 15, 20, 25, 154, 153, 28, 150, 30, 159, 158, 201, 201, 182, 201, 179, 201, 201, 169, 201, 168, 46, 201, 201, 201, 0, 35, 141, 148, 145, 139, 135, 143, 148, 140, 146, 0, 134, 31, 138, 126, 141, 0, 130, 134, 132, 139, 0, 131, 0, 135, 134, 133, 134, 133, 129, 117, 117, 123, 127, 125, 124, 115, 111, 0, 114, 120, 119, 0, 0, 106, 120, 0, 109, 108, 99, 104, 100, 112, 99, 101, 95, 95, 107, 101, 108, 0, 99, 91, 91, 88, 0, 103, 91, 99, 89, 91, 111, 93, 85, 89, 90, 87, 81, 79, 0, 74, 102, 0, 101, 81, 72, 98, 69, 68, 95, 94, 68, 71, 70, 69, 61, 61, 73, 72, 61, 67, 83, 60, 59, 52, 57, 50, 56, 55, 46, 56, 56, 48, 47, 43, 0, 47, 49, 48, 36, 47, 0, 0, 49, 0, 34, 41, 30, 30, 0, 201, 70, 72, 63 ) ; yy_def : constant array(0..186) of short := ( 0, 183, 1, 183, 183, 183, 183, 183, 184, 183, 185, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 186, 183, 183, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 183, 183, 184, 183, 185, 183, 183, 183, 183, 183, 183, 183, 183, 183, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 0, 183, 183, 183 ) ; yy_nxt : constant array(0..248) of short := ( 0, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 25, 28, 25, 29, 30, 25, 31, 25, 25, 25, 25, 32, 33, 34, 35, 25, 36, 37, 25, 25, 25, 25, 38, 44, 47, 45, 48, 53, 55, 61, 57, 64, 54, 56, 58, 47, 80, 48, 68, 69, 52, 62, 182, 181, 81, 65, 40, 40, 42, 42, 180, 179, 178, 177, 176, 175, 174, 173, 172, 171, 170, 169, 168, 167, 166, 165, 164, 163, 162, 161, 160, 159, 158, 157, 156, 155, 154, 153, 152, 151, 150, 149, 148, 147, 146, 145, 144, 143, 142, 141, 140, 139, 138, 137, 136, 135, 134, 133, 132, 131, 130, 129, 128, 127, 126, 125, 124, 123, 122, 121, 120, 119, 118, 117, 116, 115, 114, 113, 112, 111, 110, 109, 108, 107, 106, 105, 104, 103, 102, 101, 100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83, 82, 79, 78, 77, 76, 75, 74, 73, 72, 71, 70, 45, 45, 43, 41, 67, 66, 63, 60, 59, 51, 50, 49, 46, 43, 41, 39, 183, 3, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183 ) ; yy_chk : constant array(0..248) of short := ( 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 17, 19, 17, 19, 28, 29, 33, 30, 35, 28, 29, 30, 48, 65, 48, 53, 53, 186, 33, 181, 180, 65, 35, 184, 184, 185, 185, 179, 178, 176, 173, 172, 171, 170, 169, 167, 166, 165, 164, 163, 162, 161, 160, 159, 158, 157, 156, 155, 154, 153, 152, 151, 150, 149, 148, 147, 146, 145, 144, 143, 142, 141, 140, 139, 138, 137, 136, 134, 133, 131, 130, 129, 128, 127, 126, 125, 124, 123, 122, 121, 120, 119, 117, 116, 115, 114, 112, 111, 110, 109, 108, 107, 106, 105, 104, 103, 102, 101, 100, 98, 97, 94, 93, 92, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78, 77, 75, 73, 72, 71, 70, 68, 67, 66, 64, 62, 61, 60, 59, 58, 57, 56, 55, 54, 47, 45, 42, 40, 37, 36, 34, 32, 31, 23, 21, 20, 18, 10, 8, 7, 3, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183, 183 ) ; -- copy whatever the last rule matched to the standard output -- procedure ECHO is -- begin -- if (text_io.is_open(user_output_file)) then -- text_io.put( user_output_file, yytext ); -- else -- text_io.put( yytext ); -- end if; -- end ECHO; -- enter a start condition. -- Using procedure requires a () after the ENTER, but makes everything -- much neater. procedure ENTER( state : integer ) is begin yy_start := 1 + 2 * state; end ENTER; -- action number for EOF rule of a given start state function YY_STATE_EOF(state : integer) return integer is begin return YY_END_OF_BUFFER + state + 1; end YY_STATE_EOF; -- return all but the first 'n' matched characters back to the input stream procedure yyless(n : integer) is begin yy_ch_buf(yy_cp) := yy_hold_char; -- undo effects of setting up yytext yy_cp := yy_bp + n; yy_c_buf_p := yy_cp; YY_DO_BEFORE_ACTION; -- set up yytext again end yyless; -- redefine this if you have something you want each time. procedure YY_USER_ACTION is begin null; end; -- yy_get_previous_state - get the state just before the EOB char was reached function yy_get_previous_state return yy_state_type is yy_current_state : yy_state_type; yy_c : short; begin yy_current_state := yy_start; for yy_cp in yytext_ptr..yy_c_buf_p - 1 loop yy_c := yy_ec(yy_ch_buf(yy_cp)); if ( yy_accept(yy_current_state) /= 0 ) then yy_last_accepting_state := yy_current_state; yy_last_accepting_cpos := yy_cp; end if; while ( yy_chk(yy_base(yy_current_state) + yy_c) /= yy_current_state ) loop yy_current_state := yy_def(yy_current_state); if ( yy_current_state >= 184 ) then yy_c := yy_meta(yy_c); end if; end loop; yy_current_state := yy_nxt(yy_base(yy_current_state) + yy_c); end loop; return yy_current_state; end yy_get_previous_state; procedure yyrestart( input_file : file_type ) is begin open_input(text_io.name(input_file)); end yyrestart; begin -- of YYLex <> -- this is where we enter upon encountering an end-of-file and -- yywrap() indicating that we should continue processing if ( yy_init ) then if ( yy_start = 0 ) then yy_start := 1; -- first start state end if; -- we put in the '\n' and start reading from [1] so that an -- initial match-at-newline will be true. yy_ch_buf(0) := ASCII.LF; yy_n_chars := 1; -- we always need two end-of-buffer characters. The first causes -- a transition to the end-of-buffer state. The second causes -- a jam in that state. yy_ch_buf(yy_n_chars) := YY_END_OF_BUFFER_CHAR; yy_ch_buf(yy_n_chars + 1) := YY_END_OF_BUFFER_CHAR; yy_eof_has_been_seen := false; yytext_ptr := 1; yy_c_buf_p := yytext_ptr; yy_hold_char := yy_ch_buf(yy_c_buf_p); yy_init := false; end if; -- yy_init loop -- loops until end-of-file is reached yy_cp := yy_c_buf_p; -- support of yytext yy_ch_buf(yy_cp) := yy_hold_char; -- yy_bp points to the position in yy_ch_buf of the start of the -- current run. yy_bp := yy_cp; yy_current_state := yy_start; loop yy_c := yy_ec(yy_ch_buf(yy_cp)); if ( yy_accept(yy_current_state) /= 0 ) then yy_last_accepting_state := yy_current_state; yy_last_accepting_cpos := yy_cp; end if; while ( yy_chk(yy_base(yy_current_state) + yy_c) /= yy_current_state ) loop yy_current_state := yy_def(yy_current_state); if ( yy_current_state >= 184 ) then yy_c := yy_meta(yy_c); end if; end loop; yy_current_state := yy_nxt(yy_base(yy_current_state) + yy_c); yy_cp := yy_cp + 1; if ( yy_current_state = 183 ) then exit; end if; end loop; yy_cp := yy_last_accepting_cpos; yy_current_state := yy_last_accepting_state; <> yy_act := yy_accept(yy_current_state); YY_DO_BEFORE_ACTION; YY_USER_ACTION; if aflex_debug then -- output acceptance info. for (-d) debug mode text_io.put("--accepting rule #" ); text_io.put(INTEGER'IMAGE(yy_act) ); text_io.put_line("(""" & yytext & """)"); end if; <> -- this label is used only to access EOF actions case yy_act is when 0 => -- must backtrack -- undo the effects of YY_DO_BEFORE_ACTION yy_ch_buf(yy_cp) := yy_hold_char; yy_cp := yy_last_accepting_cpos; yy_current_state := yy_last_accepting_state; goto next_action; when 1 => --# line 15 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (ANCESTOR_token); when 2 => --# line 16 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (ANCESTOR_OR_SELF_token); when 3 => --# line 17 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (ATTRIBUTE_token); when 4 => --# line 18 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (CHILD_token); when 5 => --# line 19 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DESCENDANT_token); when 6 => --# line 20 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DESCENDANT_OR_SELF_token); when 7 => --# line 21 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (FOLLOWING_token); when 8 => --# line 22 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (FOLLOWING_SIBLING_token); when 9 => --# line 23 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (NAMESPACE_token); when 10 => --# line 24 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (PARENT_token); when 11 => --# line 25 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (PRECEDING_token); when 12 => --# line 26 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (PRECEDING_SIBLING_token); when 13 => --# line 27 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (SELF_token); when 14 => --# line 28 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (COMMENT_token); when 15 => --# line 29 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (TEXT_token); when 16 => --# line 30 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (PROCESSING_INSTRUCTION_token); when 17 => --# line 31 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (NODE_token); when 18 => --# line 32 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (AND_token); when 19 => --# line 33 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DIV_token); when 20 => --# line 34 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (MOD_token); when 21 => --# line 35 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (OR_token); when 22 => --# line 36 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (L_PAREN_token); when 23 => --# line 37 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (R_PAREN_token); when 24 => --# line 38 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (L_BRACKET_token); when 25 => --# line 39 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (R_BRACKET_token); when 26 => --# line 40 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (STAR_token); when 27 => --# line 41 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (PLUS_token); when 28 => --# line 42 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (MINUS_token); when 29 => --# line 43 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DOT_token); when 30 => --# line 44 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DOUBLE_DOT_token); when 31 => --# line 45 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (SLASH_token); when 32 => --# line 46 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DOUBLE_SLASH_token); when 33 => --# line 47 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (COLON_token); when 34 => --# line 48 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DOUBLE_COLON_token); when 35 => --# line 49 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (AT_SIGN_token); when 36 => --# line 50 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (COMMA_token); when 37 => --# line 51 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DOLLAR_token); when 38 => --# line 52 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (V_BAR_token); when 39 => --# line 53 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (EQ_token); when 40 => --# line 54 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (NE_token); when 41 => --# line 55 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (GT_token); when 42 => --# line 56 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (GE_token); when 43 => --# line 57 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (LT_token); when 44 => --# line 58 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (LE_token); when 45 => --# line 59 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (SQ_LITERAL_token); when 46 => --# line 60 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DQ_LITERAL_token); when 47 => --# line 61 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (INTEGER_token); when 48 => --# line 62 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (DECIMAL_LITERAL_token); when 49 => --# line 63 "xia_parser.l" Current_Column := Current_Column + YYText'Length; return (NCNAME_token); when 50 => --# line 64 "xia_parser.l" Current_Column := Current_Column + 1; when 51 => --# line 65 "xia_parser.l" Current_Line := Current_Line + 1; Current_Column := 1; when 52 => --# line 66 "xia_parser.l" --ECHO; null; when YY_END_OF_BUFFER + INITIAL + 1 => return End_Of_Input; when YY_END_OF_BUFFER => -- undo the effects of YY_DO_BEFORE_ACTION yy_ch_buf(yy_cp) := yy_hold_char; yytext_ptr := yy_bp; case yy_get_next_buffer is when EOB_ACT_END_OF_FILE => begin if ( yywrap ) then -- note: because we've taken care in -- yy_get_next_buffer() to have set up yytext, -- we can now set up yy_c_buf_p so that if some -- total hoser (like aflex itself) wants -- to call the scanner after we return the -- End_Of_Input, it'll still work - another -- End_Of_Input will get returned. yy_c_buf_p := yytext_ptr; yy_act := YY_STATE_EOF((yy_start - 1) / 2); goto do_action; else -- start processing a new file yy_init := true; goto new_file; end if; end; when EOB_ACT_RESTART_SCAN => yy_c_buf_p := yytext_ptr; yy_hold_char := yy_ch_buf(yy_c_buf_p); when EOB_ACT_LAST_MATCH => yy_c_buf_p := yy_n_chars; yy_current_state := yy_get_previous_state; yy_cp := yy_c_buf_p; yy_bp := yytext_ptr; goto next_action; when others => null; end case; -- case yy_get_next_buffer() when others => text_io.put( "action # " ); text_io.put( INTEGER'IMAGE(yy_act) ); text_io.new_line; raise AFLEX_INTERNAL_ERROR; end case; -- case (yy_act) end loop; -- end of loop waiting for end of file end YYLex; --# line 66 "xia_parser.l" function Get_Token return Token is begin return YYLex; end Get_Token; function Get_Token_String return String is begin return YYText; end Get_Token_String; function Get_Current_Line return Natural is begin return Current_Line; end Get_Current_Line; function Get_Current_Column return Natural is begin return Current_Column; end Get_Current_Column; end xia_parser; xia-1.00/xia_parser.ads0100666000076600007670000000745710212334121013732 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ -- A lexical scanner generated by aflex ------------------------------------------------------------------------ with text_io; use text_io; with xia_parser_dfa; use xia_parser_dfa; with xia_parser_io; use xia_parser_io; --# line 1 "xia_parser.l" -- Automatically generated AFLEX input -- from AdaGOOP (by Martin C. Carlisle) -- Do not modify. --# line 14 "xia_parser.l" package xia_parser is type Token is ( End_Of_Input, Error, NCNAME_token, DECIMAL_LITERAL_token, INTEGER_token, DQ_LITERAL_token, SQ_LITERAL_token, LE_token, LT_token, GE_token, GT_token, NE_token, EQ_token, V_BAR_token, DOLLAR_token, COMMA_token, AT_SIGN_token, DOUBLE_COLON_token, COLON_token, DOUBLE_SLASH_token, SLASH_token, DOUBLE_DOT_token, DOT_token, MINUS_token, PLUS_token, STAR_token, R_BRACKET_token, L_BRACKET_token, R_PAREN_token, L_PAREN_token, OR_token, MOD_token, DIV_token, AND_token, NODE_token, PROCESSING_INSTRUCTION_token, TEXT_token, COMMENT_token, SELF_token, PRECEDING_SIBLING_token, PRECEDING_token, PARENT_token, NAMESPACE_token, FOLLOWING_SIBLING_token, FOLLOWING_token, DESCENDANT_OR_SELF_token, DESCENDANT_token, CHILD_token, ATTRIBUTE_token, ANCESTOR_OR_SELF_token, ANCESTOR_token, Dummy_Token); procedure Reset(Set_String : in String); function Get_Token return Token; function Get_Token_String return String; function Get_Current_Line return Natural; function Get_Current_Column return Natural; procedure Close_Files; end xia_parser; xia-1.00/xia_parser_dfa.adb0100666000076600007670000000610610212334121014511 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with xia_parser_dfa; use xia_parser_dfa; package body xia_parser_dfa is function YYText return string is i : integer; str_loc : integer := 1; buffer : string(1..1024); EMPTY_STRING : constant string := ""; begin -- find end of buffer i := yytext_ptr; while ( yy_ch_buf(i) /= ASCII.NUL ) loop buffer(str_loc ) := yy_ch_buf(i); i := i + 1; str_loc := str_loc + 1; end loop; -- return yy_ch_buf(yytext_ptr.. i - 1); if (str_loc < 2) then return EMPTY_STRING; else return buffer(1..str_loc-1); end if; end; -- returns the length of the matched text function YYLength return integer is begin return yy_cp - yy_bp; end YYLength; -- done after the current pattern has been matched and before the -- corresponding action - sets up yytext procedure YY_DO_BEFORE_ACTION is begin yytext_ptr := yy_bp; yy_hold_char := yy_ch_buf(yy_cp); yy_ch_buf(yy_cp) := ASCII.NUL; yy_c_buf_p := yy_cp; end YY_DO_BEFORE_ACTION; end xia_parser_dfa; xia-1.00/xia_parser_dfa.ads0100666000076600007670000000632610212334121014536 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ package xia_parser_dfa is aflex_debug : boolean := false; yytext_ptr : integer; -- points to start of yytext in buffer -- yy_ch_buf has to be 2 characters longer than YY_BUF_SIZE because we need -- to put in 2 end-of-buffer characters (this is explained where it is -- done) at the end of yy_ch_buf YY_READ_BUF_SIZE : constant integer := 8192; YY_BUF_SIZE : constant integer := YY_READ_BUF_SIZE * 2; -- size of input buffer type unbounded_character_array is array(integer range <>) of character; subtype ch_buf_type is unbounded_character_array(0..YY_BUF_SIZE + 1); yy_ch_buf : ch_buf_type; yy_cp, yy_bp : integer; -- yy_hold_char holds the character lost when yytext is formed yy_hold_char : character; yy_c_buf_p : integer; -- points to current character in buffer function YYText return string; function YYLength return integer; procedure YY_DO_BEFORE_ACTION; --These variables are needed between calls to YYLex. yy_init : boolean := true; -- do we need to initialize YYLex? yy_start : integer := 0; -- current start state number subtype yy_state_type is integer; yy_last_accepting_state : yy_state_type; yy_last_accepting_cpos : integer; end xia_parser_dfa; xia-1.00/xia_parser_goto.ads0100666000076600007670000006122610212334121014754 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ package Xia_Parser_Goto is type Small_Integer is range -32_000 .. 32_000; type Goto_Entry is record Nonterm : Small_Integer; Newstate : Small_Integer; end record; --pragma suppress(index_check); subtype Row is Integer range -1 .. Integer'Last; type Goto_Parse_Table is array (Row range <>) of Goto_Entry; Goto_Matrix : constant Goto_Parse_Table := ((-1,-1) -- Dummy Entry. -- State 0 ,(-71, 54),(-70, 53),(-68, 36),(-67, 35) ,(-66, 17),(-64, 13),(-63, 18),(-62, 12) ,(-60, 9),(-58, 8),(-57, 5),(-56, 4) ,(-55, 7),(-54, 3),(-53, 2),(-52, 1) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-26, 52),(-23, 14),(-22, 15) ,(-21, 6),(-20, 11),(-17, 19),(-3, 60) ,(-2, 73) -- State 1 -- State 2 ,(-21, 74),(-20, 75) -- State 3 -- State 4 -- State 5 -- State 6 ,(-71, 54) ,(-70, 53),(-68, 36),(-67, 35),(-66, 17) ,(-64, 13),(-63, 18),(-62, 12),(-60, 9) ,(-58, 8),(-57, 5),(-56, 4),(-53, 76) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-26, 52),(-23, 14),(-22, 15) ,(-17, 19),(-3, 60) -- State 7 -- State 8 ,(-59, 77) -- State 9 -- State 10 -- State 11 ,(-71, 54) ,(-70, 53),(-68, 36),(-67, 35),(-66, 17) ,(-64, 13),(-63, 18),(-62, 12),(-60, 9) ,(-58, 8),(-57, 5),(-56, 4),(-53, 78) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-26, 52),(-23, 14),(-22, 15) ,(-17, 19),(-3, 60) -- State 12 ,(-71, 54),(-70, 53) ,(-68, 36),(-67, 35),(-66, 79),(-63, 80) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-26, 52),(-3, 60) -- State 13 -- State 14 -- State 15 -- State 16 -- State 17 ,(-18, 82) -- State 18 -- State 19 ,(-71, 54),(-70, 53),(-68, 36),(-67, 35) ,(-66, 79),(-63, 83),(-51, 22),(-50, 23) ,(-49, 24),(-48, 25),(-47, 26),(-46, 27) ,(-45, 28),(-44, 29),(-43, 30),(-42, 31) ,(-41, 32),(-40, 33),(-39, 34),(-38, 55) ,(-37, 56),(-36, 37),(-35, 57),(-34, 61) ,(-33, 64),(-32, 63),(-31, 62),(-26, 52) ,(-3, 60) -- State 20 -- State 21 -- State 22 -- State 23 -- State 24 -- State 25 -- State 26 -- State 27 -- State 28 -- State 29 -- State 30 -- State 31 -- State 32 -- State 33 -- State 34 -- State 35 -- State 36 ,(-30, 85) -- State 37 ,(-30, 86) -- State 38 -- State 39 -- State 40 -- State 41 -- State 42 -- State 43 -- State 44 -- State 45 -- State 46 -- State 47 -- State 48 -- State 49 -- State 50 -- State 51 -- State 52 -- State 53 -- State 54 ,(-19, 88) -- State 55 -- State 56 -- State 57 -- State 58 -- State 59 -- State 60 -- State 61 -- State 62 -- State 63 -- State 64 -- State 65 -- State 66 -- State 67 -- State 68 -- State 69 -- State 70 -- State 71 -- State 72 -- State 73 -- State 74 ,(-71, 54),(-70, 53),(-68, 36),(-67, 35) ,(-66, 17),(-64, 13),(-63, 18),(-62, 12) ,(-60, 9),(-58, 8),(-56, 90),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 37),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-26, 52),(-23, 14),(-22, 15),(-17, 19) ,(-3, 60) -- State 75 ,(-71, 54),(-70, 53),(-68, 36) ,(-67, 35),(-66, 17),(-64, 13),(-63, 18) ,(-62, 12),(-60, 9),(-58, 8),(-56, 91) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-26, 52),(-23, 14),(-22, 15) ,(-17, 19),(-3, 60) -- State 76 ,(-21, 74),(-20, 75) -- State 77 ,(-61, 94),(-28, 92) -- State 78 ,(-21, 74),(-20, 75) -- State 79 -- State 80 -- State 81 -- State 82 -- State 83 -- State 84 -- State 85 ,(-29, 96) -- State 86 ,(-69, 101),(-7, 98),(-6, 97) -- State 87 -- State 88 ,(-71, 105),(-68, 102),(-66, 79),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 103),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-26, 104),(-3, 60) -- State 89 -- State 90 -- State 91 -- State 92 ,(-89, 113),(-88, 112) ,(-87, 111),(-86, 110),(-85, 109),(-84, 108) ,(-83, 119),(-82, 116),(-81, 114),(-78, 129) ,(-77, 125),(-76, 124),(-75, 121),(-74, 120) ,(-73, 107),(-72, 106),(-71, 54),(-70, 133) ,(-69, 123),(-68, 36),(-67, 35),(-66, 17) ,(-65, 134),(-64, 13),(-63, 18),(-62, 12) ,(-60, 9),(-58, 8),(-57, 5),(-56, 4) ,(-55, 7),(-54, 3),(-53, 2),(-52, 118) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-30, 122),(-26, 52),(-24, 115) ,(-23, 14),(-22, 15),(-21, 6),(-20, 11) ,(-17, 19),(-15, 126),(-7, 98),(-6, 97) ,(-5, 127),(-4, 128),(-3, 60) -- State 93 -- State 94 -- State 95 -- State 96 -- State 97 -- State 98 -- State 99 -- State 100 -- State 101 ,(-29, 135) -- State 102 -- State 103 -- State 104 -- State 105 -- State 106 -- State 107 ,(-31, 136) -- State 108 ,(-34, 137) -- State 109 ,(-13, 140),(-12, 141) -- State 110 ,(-11, 147),(-10, 149),(-9, 146),(-8, 148) -- State 111 ,(-25, 151),(-24, 152) -- State 112 ,(-33, 154),(-32, 155) ,(-26, 153) -- State 113 -- State 114 ,(-14, 157) -- State 115 ,(-89, 158),(-83, 119) ,(-82, 116),(-81, 114),(-78, 129),(-77, 125) ,(-76, 124),(-75, 121),(-74, 120),(-71, 54) ,(-70, 133),(-69, 123),(-68, 36),(-67, 35) ,(-66, 17),(-64, 13),(-63, 18),(-62, 12) ,(-60, 9),(-58, 8),(-57, 5),(-56, 4) ,(-55, 7),(-54, 3),(-53, 2),(-52, 118) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-30, 122),(-26, 52),(-24, 115) ,(-23, 14),(-22, 15),(-21, 6),(-20, 11) ,(-17, 19),(-15, 126),(-7, 98),(-6, 97) ,(-5, 127),(-4, 128),(-3, 60) -- State 116 -- State 117 -- State 118 -- State 119 ,(-61, 161) ,(-28, 92),(-21, 159),(-20, 160) -- State 120 -- State 121 -- State 122 ,(-89, 113) ,(-88, 112),(-87, 111),(-86, 110),(-85, 109) ,(-84, 108),(-83, 119),(-82, 116),(-81, 114) ,(-78, 129),(-77, 125),(-76, 124),(-75, 121) ,(-74, 120),(-73, 107),(-72, 162),(-71, 54) ,(-70, 133),(-69, 123),(-68, 36),(-67, 35) ,(-66, 17),(-64, 13),(-63, 18),(-62, 12) ,(-60, 9),(-58, 8),(-57, 5),(-56, 4) ,(-55, 7),(-54, 3),(-53, 2),(-52, 118) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-30, 122),(-26, 52),(-24, 115) ,(-23, 14),(-22, 15),(-21, 6),(-20, 11) ,(-17, 19),(-15, 126),(-7, 98),(-6, 97) ,(-5, 127),(-4, 128),(-3, 60) -- State 123 -- State 124 -- State 125 -- State 126 ,(-71, 163) ,(-70, 164),(-68, 102),(-66, 79),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 103),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-3, 60) -- State 127 -- State 128 -- State 129 ,(-30, 165) -- State 130 -- State 131 -- State 132 -- State 133 -- State 134 ,(-27, 167) -- State 135 -- State 136 ,(-89, 113) ,(-88, 112),(-87, 111),(-86, 110),(-85, 109) ,(-84, 168),(-83, 119),(-82, 116),(-81, 114) ,(-78, 129),(-77, 125),(-76, 124),(-75, 121) ,(-74, 120),(-71, 54),(-70, 133),(-69, 123) ,(-68, 36),(-67, 35),(-66, 17),(-64, 13) ,(-63, 18),(-62, 12),(-60, 9),(-58, 8) ,(-57, 5),(-56, 4),(-55, 7),(-54, 3) ,(-53, 2),(-52, 118),(-51, 22),(-50, 23) ,(-49, 24),(-48, 25),(-47, 26),(-46, 27) ,(-45, 28),(-44, 29),(-43, 30),(-42, 31) ,(-41, 32),(-40, 33),(-39, 34),(-38, 55) ,(-37, 56),(-36, 37),(-35, 57),(-34, 61) ,(-33, 64),(-32, 63),(-31, 62),(-30, 122) ,(-26, 52),(-24, 115),(-23, 14),(-22, 15) ,(-21, 6),(-20, 11),(-17, 19),(-15, 126) ,(-7, 98),(-6, 97),(-5, 127),(-4, 128) ,(-3, 60) -- State 137 ,(-89, 113),(-88, 112),(-87, 111) ,(-86, 110),(-85, 169),(-83, 119),(-82, 116) ,(-81, 114),(-78, 129),(-77, 125),(-76, 124) ,(-75, 121),(-74, 120),(-71, 54),(-70, 133) ,(-69, 123),(-68, 36),(-67, 35),(-66, 17) ,(-64, 13),(-63, 18),(-62, 12),(-60, 9) ,(-58, 8),(-57, 5),(-56, 4),(-55, 7) ,(-54, 3),(-53, 2),(-52, 118),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 37),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-30, 122),(-26, 52),(-24, 115),(-23, 14) ,(-22, 15),(-21, 6),(-20, 11),(-17, 19) ,(-15, 126),(-7, 98),(-6, 97),(-5, 127) ,(-4, 128),(-3, 60) -- State 138 -- State 139 -- State 140 ,(-89, 113),(-88, 112) ,(-87, 111),(-86, 170),(-83, 119),(-82, 116) ,(-81, 114),(-78, 129),(-77, 125),(-76, 124) ,(-75, 121),(-74, 120),(-71, 54),(-70, 133) ,(-69, 123),(-68, 36),(-67, 35),(-66, 17) ,(-64, 13),(-63, 18),(-62, 12),(-60, 9) ,(-58, 8),(-57, 5),(-56, 4),(-55, 7) ,(-54, 3),(-53, 2),(-52, 118),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 37),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-30, 122),(-26, 52),(-24, 115),(-23, 14) ,(-22, 15),(-21, 6),(-20, 11),(-17, 19) ,(-15, 126),(-7, 98),(-6, 97),(-5, 127) ,(-4, 128),(-3, 60) -- State 141 ,(-89, 113),(-88, 112) ,(-87, 111),(-86, 171),(-83, 119),(-82, 116) ,(-81, 114),(-78, 129),(-77, 125),(-76, 124) ,(-75, 121),(-74, 120),(-71, 54),(-70, 133) ,(-69, 123),(-68, 36),(-67, 35),(-66, 17) ,(-64, 13),(-63, 18),(-62, 12),(-60, 9) ,(-58, 8),(-57, 5),(-56, 4),(-55, 7) ,(-54, 3),(-53, 2),(-52, 118),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 37),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-30, 122),(-26, 52),(-24, 115),(-23, 14) ,(-22, 15),(-21, 6),(-20, 11),(-17, 19) ,(-15, 126),(-7, 98),(-6, 97),(-5, 127) ,(-4, 128),(-3, 60) -- State 142 -- State 143 -- State 144 -- State 145 -- State 146 ,(-89, 113),(-88, 112) ,(-87, 172),(-83, 119),(-82, 116),(-81, 114) ,(-78, 129),(-77, 125),(-76, 124),(-75, 121) ,(-74, 120),(-71, 54),(-70, 133),(-69, 123) ,(-68, 36),(-67, 35),(-66, 17),(-64, 13) ,(-63, 18),(-62, 12),(-60, 9),(-58, 8) ,(-57, 5),(-56, 4),(-55, 7),(-54, 3) ,(-53, 2),(-52, 118),(-51, 22),(-50, 23) ,(-49, 24),(-48, 25),(-47, 26),(-46, 27) ,(-45, 28),(-44, 29),(-43, 30),(-42, 31) ,(-41, 32),(-40, 33),(-39, 34),(-38, 55) ,(-37, 56),(-36, 37),(-35, 57),(-34, 61) ,(-33, 64),(-32, 63),(-31, 62),(-30, 122) ,(-26, 52),(-24, 115),(-23, 14),(-22, 15) ,(-21, 6),(-20, 11),(-17, 19),(-15, 126) ,(-7, 98),(-6, 97),(-5, 127),(-4, 128) ,(-3, 60) -- State 147 ,(-89, 113),(-88, 112),(-87, 173) ,(-83, 119),(-82, 116),(-81, 114),(-78, 129) ,(-77, 125),(-76, 124),(-75, 121),(-74, 120) ,(-71, 54),(-70, 133),(-69, 123),(-68, 36) ,(-67, 35),(-66, 17),(-64, 13),(-63, 18) ,(-62, 12),(-60, 9),(-58, 8),(-57, 5) ,(-56, 4),(-55, 7),(-54, 3),(-53, 2) ,(-52, 118),(-51, 22),(-50, 23),(-49, 24) ,(-48, 25),(-47, 26),(-46, 27),(-45, 28) ,(-44, 29),(-43, 30),(-42, 31),(-41, 32) ,(-40, 33),(-39, 34),(-38, 55),(-37, 56) ,(-36, 37),(-35, 57),(-34, 61),(-33, 64) ,(-32, 63),(-31, 62),(-30, 122),(-26, 52) ,(-24, 115),(-23, 14),(-22, 15),(-21, 6) ,(-20, 11),(-17, 19),(-15, 126),(-7, 98) ,(-6, 97),(-5, 127),(-4, 128),(-3, 60) -- State 148 ,(-89, 113),(-88, 112),(-87, 174),(-83, 119) ,(-82, 116),(-81, 114),(-78, 129),(-77, 125) ,(-76, 124),(-75, 121),(-74, 120),(-71, 54) ,(-70, 133),(-69, 123),(-68, 36),(-67, 35) ,(-66, 17),(-64, 13),(-63, 18),(-62, 12) ,(-60, 9),(-58, 8),(-57, 5),(-56, 4) ,(-55, 7),(-54, 3),(-53, 2),(-52, 118) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-30, 122),(-26, 52),(-24, 115) ,(-23, 14),(-22, 15),(-21, 6),(-20, 11) ,(-17, 19),(-15, 126),(-7, 98),(-6, 97) ,(-5, 127),(-4, 128),(-3, 60) -- State 149 ,(-89, 113) ,(-88, 112),(-87, 175),(-83, 119),(-82, 116) ,(-81, 114),(-78, 129),(-77, 125),(-76, 124) ,(-75, 121),(-74, 120),(-71, 54),(-70, 133) ,(-69, 123),(-68, 36),(-67, 35),(-66, 17) ,(-64, 13),(-63, 18),(-62, 12),(-60, 9) ,(-58, 8),(-57, 5),(-56, 4),(-55, 7) ,(-54, 3),(-53, 2),(-52, 118),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 37),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-30, 122),(-26, 52),(-24, 115),(-23, 14) ,(-22, 15),(-21, 6),(-20, 11),(-17, 19) ,(-15, 126),(-7, 98),(-6, 97),(-5, 127) ,(-4, 128),(-3, 60) -- State 150 -- State 151 ,(-89, 113),(-88, 176) ,(-83, 119),(-82, 116),(-81, 114),(-78, 129) ,(-77, 125),(-76, 124),(-75, 121),(-74, 120) ,(-71, 54),(-70, 133),(-69, 123),(-68, 36) ,(-67, 35),(-66, 17),(-64, 13),(-63, 18) ,(-62, 12),(-60, 9),(-58, 8),(-57, 5) ,(-56, 4),(-55, 7),(-54, 3),(-53, 2) ,(-52, 118),(-51, 22),(-50, 23),(-49, 24) ,(-48, 25),(-47, 26),(-46, 27),(-45, 28) ,(-44, 29),(-43, 30),(-42, 31),(-41, 32) ,(-40, 33),(-39, 34),(-38, 55),(-37, 56) ,(-36, 37),(-35, 57),(-34, 61),(-33, 64) ,(-32, 63),(-31, 62),(-30, 122),(-26, 52) ,(-24, 115),(-23, 14),(-22, 15),(-21, 6) ,(-20, 11),(-17, 19),(-15, 126),(-7, 98) ,(-6, 97),(-5, 127),(-4, 128),(-3, 60) -- State 152 ,(-89, 113),(-88, 177),(-83, 119),(-82, 116) ,(-81, 114),(-78, 129),(-77, 125),(-76, 124) ,(-75, 121),(-74, 120),(-71, 54),(-70, 133) ,(-69, 123),(-68, 36),(-67, 35),(-66, 17) ,(-64, 13),(-63, 18),(-62, 12),(-60, 9) ,(-58, 8),(-57, 5),(-56, 4),(-55, 7) ,(-54, 3),(-53, 2),(-52, 118),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 37),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-30, 122),(-26, 52),(-24, 115),(-23, 14) ,(-22, 15),(-21, 6),(-20, 11),(-17, 19) ,(-15, 126),(-7, 98),(-6, 97),(-5, 127) ,(-4, 128),(-3, 60) -- State 153 ,(-89, 178),(-83, 119) ,(-82, 116),(-81, 114),(-78, 129),(-77, 125) ,(-76, 124),(-75, 121),(-74, 120),(-71, 54) ,(-70, 133),(-69, 123),(-68, 36),(-67, 35) ,(-66, 17),(-64, 13),(-63, 18),(-62, 12) ,(-60, 9),(-58, 8),(-57, 5),(-56, 4) ,(-55, 7),(-54, 3),(-53, 2),(-52, 118) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-30, 122),(-26, 52),(-24, 115) ,(-23, 14),(-22, 15),(-21, 6),(-20, 11) ,(-17, 19),(-15, 126),(-7, 98),(-6, 97) ,(-5, 127),(-4, 128),(-3, 60) -- State 154 ,(-89, 179) ,(-83, 119),(-82, 116),(-81, 114),(-78, 129) ,(-77, 125),(-76, 124),(-75, 121),(-74, 120) ,(-71, 54),(-70, 133),(-69, 123),(-68, 36) ,(-67, 35),(-66, 17),(-64, 13),(-63, 18) ,(-62, 12),(-60, 9),(-58, 8),(-57, 5) ,(-56, 4),(-55, 7),(-54, 3),(-53, 2) ,(-52, 118),(-51, 22),(-50, 23),(-49, 24) ,(-48, 25),(-47, 26),(-46, 27),(-45, 28) ,(-44, 29),(-43, 30),(-42, 31),(-41, 32) ,(-40, 33),(-39, 34),(-38, 55),(-37, 56) ,(-36, 37),(-35, 57),(-34, 61),(-33, 64) ,(-32, 63),(-31, 62),(-30, 122),(-26, 52) ,(-24, 115),(-23, 14),(-22, 15),(-21, 6) ,(-20, 11),(-17, 19),(-15, 126),(-7, 98) ,(-6, 97),(-5, 127),(-4, 128),(-3, 60) -- State 155 ,(-89, 180),(-83, 119),(-82, 116),(-81, 114) ,(-78, 129),(-77, 125),(-76, 124),(-75, 121) ,(-74, 120),(-71, 54),(-70, 133),(-69, 123) ,(-68, 36),(-67, 35),(-66, 17),(-64, 13) ,(-63, 18),(-62, 12),(-60, 9),(-58, 8) ,(-57, 5),(-56, 4),(-55, 7),(-54, 3) ,(-53, 2),(-52, 118),(-51, 22),(-50, 23) ,(-49, 24),(-48, 25),(-47, 26),(-46, 27) ,(-45, 28),(-44, 29),(-43, 30),(-42, 31) ,(-41, 32),(-40, 33),(-39, 34),(-38, 55) ,(-37, 56),(-36, 37),(-35, 57),(-34, 61) ,(-33, 64),(-32, 63),(-31, 62),(-30, 122) ,(-26, 52),(-24, 115),(-23, 14),(-22, 15) ,(-21, 6),(-20, 11),(-17, 19),(-15, 126) ,(-7, 98),(-6, 97),(-5, 127),(-4, 128) ,(-3, 60) -- State 156 -- State 157 ,(-83, 119),(-82, 181),(-78, 129) ,(-77, 125),(-76, 124),(-75, 121),(-74, 120) ,(-71, 54),(-70, 133),(-69, 123),(-68, 36) ,(-67, 35),(-66, 17),(-64, 13),(-63, 18) ,(-62, 12),(-60, 9),(-58, 8),(-57, 5) ,(-56, 4),(-55, 7),(-54, 3),(-53, 2) ,(-52, 118),(-51, 22),(-50, 23),(-49, 24) ,(-48, 25),(-47, 26),(-46, 27),(-45, 28) ,(-44, 29),(-43, 30),(-42, 31),(-41, 32) ,(-40, 33),(-39, 34),(-38, 55),(-37, 56) ,(-36, 37),(-35, 57),(-34, 61),(-33, 64) ,(-32, 63),(-31, 62),(-30, 122),(-26, 52) ,(-23, 14),(-22, 15),(-21, 6),(-20, 11) ,(-17, 19),(-15, 126),(-7, 98),(-6, 97) ,(-5, 127),(-4, 128),(-3, 60) -- State 158 -- State 159 ,(-71, 54) ,(-70, 53),(-68, 36),(-67, 35),(-66, 17) ,(-64, 13),(-63, 18),(-62, 12),(-60, 9) ,(-58, 8),(-57, 5),(-56, 4),(-53, 182) ,(-51, 22),(-50, 23),(-49, 24),(-48, 25) ,(-47, 26),(-46, 27),(-45, 28),(-44, 29) ,(-43, 30),(-42, 31),(-41, 32),(-40, 33) ,(-39, 34),(-38, 55),(-37, 56),(-36, 37) ,(-35, 57),(-34, 61),(-33, 64),(-32, 63) ,(-31, 62),(-26, 52),(-23, 14),(-22, 15) ,(-17, 19),(-3, 60) -- State 160 ,(-71, 54),(-70, 53) ,(-68, 36),(-67, 35),(-66, 17),(-64, 13) ,(-63, 18),(-62, 12),(-60, 9),(-58, 8) ,(-57, 5),(-56, 4),(-53, 183),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 37),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-26, 52),(-23, 14),(-22, 15),(-17, 19) ,(-3, 60) -- State 161 -- State 162 ,(-29, 184) -- State 163 ,(-19, 185) -- State 164 -- State 165 ,(-89, 113) ,(-88, 112),(-87, 111),(-86, 110),(-85, 109) ,(-84, 108),(-83, 119),(-82, 116),(-81, 114) ,(-80, 186),(-79, 187),(-78, 129),(-77, 125) ,(-76, 124),(-75, 121),(-74, 120),(-73, 107) ,(-72, 188),(-71, 54),(-70, 133),(-69, 123) ,(-68, 36),(-67, 35),(-66, 17),(-64, 13) ,(-63, 18),(-62, 12),(-60, 9),(-58, 8) ,(-57, 5),(-56, 4),(-55, 7),(-54, 3) ,(-53, 2),(-52, 118),(-51, 22),(-50, 23) ,(-49, 24),(-48, 25),(-47, 26),(-46, 27) ,(-45, 28),(-44, 29),(-43, 30),(-42, 31) ,(-41, 32),(-40, 33),(-39, 34),(-38, 55) ,(-37, 56),(-36, 37),(-35, 57),(-34, 61) ,(-33, 64),(-32, 63),(-31, 62),(-30, 122) ,(-26, 52),(-24, 115),(-23, 14),(-22, 15) ,(-21, 6),(-20, 11),(-17, 19),(-15, 126) ,(-7, 98),(-6, 97),(-5, 127),(-4, 128) ,(-3, 60) -- State 166 -- State 167 -- State 168 ,(-34, 137) -- State 169 ,(-13, 140),(-12, 141) -- State 170 ,(-11, 147),(-10, 149),(-9, 146),(-8, 148) -- State 171 ,(-11, 147),(-10, 149),(-9, 146),(-8, 148) -- State 172 ,(-25, 151),(-24, 152) -- State 173 ,(-25, 151),(-24, 152) -- State 174 ,(-25, 151),(-24, 152) -- State 175 ,(-25, 151),(-24, 152) -- State 176 ,(-33, 154),(-32, 155),(-26, 153) -- State 177 ,(-33, 154) ,(-32, 155),(-26, 153) -- State 178 -- State 179 -- State 180 -- State 181 -- State 182 ,(-21, 74),(-20, 75) -- State 183 ,(-21, 74),(-20, 75) -- State 184 -- State 185 ,(-71, 105),(-68, 102) ,(-66, 79),(-51, 22),(-50, 23),(-49, 24) ,(-48, 25),(-47, 26),(-46, 27),(-45, 28) ,(-44, 29),(-43, 30),(-42, 31),(-41, 32) ,(-40, 33),(-39, 34),(-38, 55),(-37, 56) ,(-36, 103),(-35, 57),(-34, 61),(-33, 64) ,(-32, 63),(-31, 62),(-3, 60) -- State 186 -- State 187 ,(-29, 190) ,(-16, 191) -- State 188 -- State 189 -- State 190 -- State 191 ,(-89, 113),(-88, 112),(-87, 111) ,(-86, 110),(-85, 109),(-84, 108),(-83, 119) ,(-82, 116),(-81, 114),(-80, 192),(-78, 129) ,(-77, 125),(-76, 124),(-75, 121),(-74, 120) ,(-73, 107),(-72, 188),(-71, 54),(-70, 133) ,(-69, 123),(-68, 36),(-67, 35),(-66, 17) ,(-64, 13),(-63, 18),(-62, 12),(-60, 9) ,(-58, 8),(-57, 5),(-56, 4),(-55, 7) ,(-54, 3),(-53, 2),(-52, 118),(-51, 22) ,(-50, 23),(-49, 24),(-48, 25),(-47, 26) ,(-46, 27),(-45, 28),(-44, 29),(-43, 30) ,(-42, 31),(-41, 32),(-40, 33),(-39, 34) ,(-38, 55),(-37, 56),(-36, 37),(-35, 57) ,(-34, 61),(-33, 64),(-32, 63),(-31, 62) ,(-30, 122),(-26, 52),(-24, 115),(-23, 14) ,(-22, 15),(-21, 6),(-20, 11),(-17, 19) ,(-15, 126),(-7, 98),(-6, 97),(-5, 127) ,(-4, 128),(-3, 60) -- State 192 ); -- The offset vector GOTO_OFFSET : array (0.. 192) of Integer := ( 0, 45, 45, 47, 47, 47, 47, 86, 86, 87, 87, 87, 126, 155, 155, 155, 155, 155, 156, 156, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 186, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 225, 262, 264, 266, 268, 268, 268, 268, 268, 268, 268, 269, 272, 272, 298, 298, 298, 298, 367, 367, 367, 367, 367, 367, 367, 367, 367, 368, 368, 368, 368, 368, 368, 369, 370, 372, 376, 378, 381, 381, 382, 443, 443, 443, 443, 447, 447, 447, 515, 515, 515, 515, 541, 541, 541, 542, 542, 542, 542, 542, 543, 543, 609, 674, 674, 674, 738, 802, 802, 802, 802, 802, 865, 928, 991, 1054, 1054, 1116, 1178, 1239, 1300, 1361, 1361, 1419, 1419, 1458, 1497, 1497, 1498, 1499, 1499, 1569, 1569, 1569, 1570, 1572, 1576, 1580, 1582, 1584, 1586, 1588, 1591, 1594, 1594, 1594, 1594, 1594, 1596, 1598, 1598, 1623, 1623, 1625, 1625, 1625, 1625, 1694); subtype Rule is Natural; subtype Nonterminal is Integer; Rule_Length : array (Rule range 0 .. 151) of Natural := ( 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 2, 1, 0, 2, 2, 1, 1, 2, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 4, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 3, 1, 1, 1, 2, 4, 0, 1, 3, 1, 1, 1, 3, 1, 1, 3, 3, 1, 2, 1, 3, 1, 3, 1, 3, 3, 1, 3, 3, 3, 3, 1, 3, 3, 1, 3, 3, 3, 1, 2, 1, 1, 1, 1); Get_LHS_Rule: array (Rule range 0 .. 151) of Nonterminal := (-1, -3,-4,-5,-6,-7,-8,-9,-10, -11,-12,-13,-14,-15,-16,-17,-18, -19,-20,-21,-22,-23,-24,-25,-26, -27,-28,-29,-30,-31,-32,-33,-34, -35,-36,-37,-38,-39,-40,-41,-42, -43,-44,-45,-46,-47,-48,-49,-50, -51,-2,-52,-52,-54,-54,-54,-53, -53,-53,-56,-56,-59,-59,-58,-58, -64,-64,-61,-62,-66,-66,-66,-66, -66,-66,-66,-66,-66,-66,-66,-66, -66,-63,-63,-63,-68,-68,-68,-68, -67,-67,-67,-70,-70,-71,-71,-71, -71,-71,-71,-71,-65,-55,-57,-60, -60,-72,-74,-74,-74,-74,-74,-75, -77,-79,-79,-79,-80,-78,-81,-81, -82,-82,-82,-82,-83,-83,-73,-73, -84,-84,-85,-85,-85,-86,-86,-86, -86,-86,-87,-87,-87,-88,-88,-88, -88,-89,-89,-76,-76,-69,-69); end Xia_Parser_Goto; xia-1.00/xia_parser_io.adb0100666000076600007670000002343210212334121014367 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; package body xia_parser_io is -- gets input and stuffs it into 'buf'. number of characters read, or YY_NULL, -- is returned in 'result'. User_Input : Unbounded_String; procedure YY_INPUT(buf: out unbounded_character_array; result: out integer; max_size: in integer) is --c : character; i : integer := 1; loc : integer := buf'first; begin -- if (is_open(user_input_file)) then -- while ( i <= max_size ) loop -- if (end_of_line(user_input_file)) then -- Ada ate our newline, put it back on the end. -- buf(loc) := ASCII.LF; -- skip_line(user_input_file, 1); -- else -- get(user_input_file, buf(loc)); -- end if; -- loc := loc + 1; -- i := i + 1; -- end loop; -- else while ( i <= max_size ) loop -- if (end_of_line) then -- Ada ate our newline, put it back on the end. -- buf(loc) := ASCII.LF; -- skip_line(1); -- else -- get(buf(loc)); Buf(Loc) := Element(User_Input, 1); Delete(User_Input, 1, 1); -- end if; loc := loc + 1; i := i + 1; end loop; -- end if; -- for input file being standard input result := i - 1; exception -- when END_ERROR => when Ada.Strings.INDEX_ERROR => result := i - 1; -- when we hit EOF we need to set yy_eof_has_been_seen yy_eof_has_been_seen := true; end YY_INPUT; -- yy_get_next_buffer - try to read in new buffer -- -- returns a code representing an action -- EOB_ACT_LAST_MATCH - -- EOB_ACT_RESTART_SCAN - restart the scanner -- EOB_ACT_END_OF_FILE - end of file function yy_get_next_buffer return eob_action_type is dest : integer := 0; source : integer := yytext_ptr - 1; -- copy prev. char, too number_to_move : integer; ret_val : eob_action_type; num_to_read : integer; begin if ( yy_c_buf_p > yy_n_chars + 1 ) then raise NULL_IN_INPUT; end if; -- try to read more data -- first move last chars to start of buffer number_to_move := yy_c_buf_p - yytext_ptr; for i in 0..number_to_move - 1 loop yy_ch_buf(dest) := yy_ch_buf(source); dest := dest + 1; source := source + 1; end loop; if ( yy_eof_has_been_seen ) then -- don't do the read, it's not guaranteed to return an EOF, -- just force an EOF yy_n_chars := 0; else num_to_read := YY_BUF_SIZE - number_to_move - 1; if ( num_to_read > YY_READ_BUF_SIZE ) then num_to_read := YY_READ_BUF_SIZE; end if; -- read in more data YY_INPUT( yy_ch_buf(number_to_move..yy_ch_buf'last), yy_n_chars, num_to_read ); end if; if ( yy_n_chars = 0 ) then if ( number_to_move = 1 ) then ret_val := EOB_ACT_END_OF_FILE; else ret_val := EOB_ACT_LAST_MATCH; end if; yy_eof_has_been_seen := true; else ret_val := EOB_ACT_RESTART_SCAN; end if; yy_n_chars := yy_n_chars + number_to_move; yy_ch_buf(yy_n_chars) := YY_END_OF_BUFFER_CHAR; yy_ch_buf(yy_n_chars + 1) := YY_END_OF_BUFFER_CHAR; -- yytext begins at the second character in -- yy_ch_buf; the first character is the one which -- preceded it before reading in the latest buffer; -- it needs to be kept around in case it's a -- newline, so yy_get_previous_state() will have -- with '^' rules active yytext_ptr := 1; return ret_val; end yy_get_next_buffer; procedure yyunput( c : character; yy_bp: in out integer ) is number_to_move : integer; dest : integer; source : integer; tmp_yy_cp : integer; begin tmp_yy_cp := yy_c_buf_p; yy_ch_buf(tmp_yy_cp) := yy_hold_char; -- undo effects of setting up yytext if ( tmp_yy_cp < 2 ) then -- need to shift things up to make room number_to_move := yy_n_chars + 2; -- +2 for EOB chars dest := YY_BUF_SIZE + 2; source := number_to_move; while ( source > 0 ) loop dest := dest - 1; source := source - 1; yy_ch_buf(dest) := yy_ch_buf(source); end loop; tmp_yy_cp := tmp_yy_cp + dest - source; yy_bp := yy_bp + dest - source; yy_n_chars := YY_BUF_SIZE; if ( tmp_yy_cp < 2 ) then raise PUSHBACK_OVERFLOW; end if; end if; if ( tmp_yy_cp > yy_bp and then yy_ch_buf(tmp_yy_cp-1) = ASCII.LF ) then yy_ch_buf(tmp_yy_cp-2) := ASCII.LF; end if; tmp_yy_cp := tmp_yy_cp - 1; yy_ch_buf(tmp_yy_cp) := c; -- Note: this code is the text of YY_DO_BEFORE_ACTION, only -- here we get different yy_cp and yy_bp's yytext_ptr := yy_bp; yy_hold_char := yy_ch_buf(tmp_yy_cp); yy_ch_buf(tmp_yy_cp) := ASCII.NUL; yy_c_buf_p := tmp_yy_cp; end yyunput; procedure unput(c : character) is begin yyunput( c, yy_bp ); end unput; function input return character is c : character; yy_cp : integer := yy_c_buf_p; begin yy_ch_buf(yy_cp) := yy_hold_char; if ( yy_ch_buf(yy_c_buf_p) = YY_END_OF_BUFFER_CHAR ) then -- need more input yytext_ptr := yy_c_buf_p; yy_c_buf_p := yy_c_buf_p + 1; case yy_get_next_buffer is -- this code, unfortunately, is somewhat redundant with -- that above when EOB_ACT_END_OF_FILE => if ( yywrap ) then yy_c_buf_p := yytext_ptr; return ASCII.NUL; end if; yy_ch_buf(0) := ASCII.LF; yy_n_chars := 1; yy_ch_buf(yy_n_chars) := YY_END_OF_BUFFER_CHAR; yy_ch_buf(yy_n_chars + 1) := YY_END_OF_BUFFER_CHAR; yy_eof_has_been_seen := false; yy_c_buf_p := 1; yytext_ptr := yy_c_buf_p; yy_hold_char := yy_ch_buf(yy_c_buf_p); return ( input ); when EOB_ACT_RESTART_SCAN => yy_c_buf_p := yytext_ptr; when EOB_ACT_LAST_MATCH => raise UNEXPECTED_LAST_MATCH; when others => null; end case; end if; c := yy_ch_buf(yy_c_buf_p); yy_c_buf_p := yy_c_buf_p + 1; yy_hold_char := yy_ch_buf(yy_c_buf_p); return c; end input; -- procedure output(c : character) is -- begin -- if (is_open(user_output_file)) then -- text_io.put(user_output_file, c); -- else -- text_io.put(c); -- end if; -- end output; -- default yywrap function - always treat EOF as an EOF function yywrap return boolean is begin return true; end yywrap; procedure Open_Input(Set_String : in String) is begin yy_init := true; User_Input := To_Unbounded_String(Set_String); end Open_Input; -- procedure Create_Output(fname : in String := "") is -- begin -- if (fname /= "") then -- create(user_output_file, out_file, fname); -- end if; -- end Create_Output; procedure Close_Input is begin -- if (is_open(user_input_file)) then -- text_io.close(user_input_file); -- end if; User_Input := Null_Unbounded_String; end Close_Input; -- procedure Close_Output is -- begin -- if (is_open(user_output_file)) then -- text_io.close(user_output_file); -- end if; -- end Close_Output; end xia_parser_io; xia-1.00/xia_parser_io.ads0100666000076600007670000000633610212334121014414 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with xia_parser_dfa; use xia_parser_dfa; package xia_parser_io is NULL_IN_INPUT : exception; AFLEX_INTERNAL_ERROR : exception; UNEXPECTED_LAST_MATCH : exception; PUSHBACK_OVERFLOW : exception; AFLEX_SCANNER_JAMMED : exception; type eob_action_type is ( EOB_ACT_RESTART_SCAN, EOB_ACT_END_OF_FILE, EOB_ACT_LAST_MATCH ); YY_END_OF_BUFFER_CHAR : constant character:= ASCII.NUL; yy_n_chars : integer; -- number of characters read into yy_ch_buf -- true when we've seen an EOF for the current input file yy_eof_has_been_seen : boolean; procedure YY_INPUT(buf: out unbounded_character_array; result: out integer; max_size: in integer); function yy_get_next_buffer return eob_action_type; procedure yyunput( c : character; yy_bp: in out integer ); procedure unput(c : character); function input return character; -- procedure output(c : character); function yywrap return boolean; procedure Open_Input(Set_String : in String); procedure Close_Input; -- procedure Create_Output(fname : in String := ""); -- procedure Close_Output; end xia_parser_io; xia-1.00/xia_parser_model.adb0100666000076600007670000023376410212334121015073 0ustar g315padadev----------------------------------------------------------------------- -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with Ada.Tags; with Dom.Core.Append_Node; with Dom.Core.Nodes; with McKae.XML.XPath.Expressions; with Mckae.XML.XPath.Locations; with Mckae.XML.XPath.Predicates; with Mckae.XML.XPath.Xia; with Text_IO; use Text_IO; package body xia_parser_Model is use Mckae.XML.Xpath; use McKae.XML.XPath.Expressions; use Mckae.XML.Xpath.Locations; ---------------------------------------------------------- Star : constant Unbounded_String := To_Unbounded_String("*"); ---------------------------------------------------------- function "+"(S : String) return Unbounded_String renames To_Unbounded_String; ---------------------------------------------------------- -- Location step under construction Location_Step : Location_Steps; -- Rely on the initialization to set establish this as an empty step Empty_Location_Step : Location_Steps; ---------------------------------------------------------- function Evaluate_Arguments(Arguments_Part : Arguments_Nonterminal_Ptr; Context_Node : Node_Items) return Argument_List; ---------------------------------------------------------- procedure Reset is begin Predicates.Release(Location_Step.Location_Predicates); Location_Step := Empty_Location_Step; end Reset; ---------------------------------------------------------- function Is_In (N : Dom.Core.Node; Nl : Dom.Core.Node_List) return Boolean is use type Dom.Core.Node; begin for I in 0 .. Dom.Core.Nodes.Length(Nl) - 1 loop if N = Dom.Core.Nodes.Item(Nl, I) then return True; end if; end loop; return False; end Is_In; ---------------------------------------------------------- function Get_Literal(Literal_Part : Literal_Nonterminal_Ptr) return Unbounded_String is S : Unbounded_String; use type Ada.Tags.Tag; begin if Literal_Part.all'Tag = Literal_Nonterminal1'Tag then declare Quoted_String : constant String := Literal_Nonterminal1(Literal_Part.all).DQ_Literal_Part.Token_String.all; begin S := To_Unbounded_String(Quoted_String(2 .. Quoted_String'Last - 1)); end; elsif Literal_Part.all'Tag = Literal_Nonterminal2'Tag then declare Quoted_String : constant String := Literal_Nonterminal2(Literal_Part.all).SQ_Literal_Part.Token_String.all; begin S := To_Unbounded_String(Quoted_String(2 .. Quoted_String'Last - 1)); end; else pragma Assert(False); S := Null_Unbounded_String; end if; return S; end Get_Literal; ---------------------------------------------------------- procedure Get_Number (Number_Part : in Number_Nonterminal_Ptr; Value : out Long_Float; Special : out Special_Number_Values) is use type Ada.Tags.Tag; begin if Number_Part.all'Tag = Number_Nonterminal1'Tag then Value := Long_Float(Natural'Value (Number_Nonterminal1(Number_Part.all).Integer_Part.Token_String.all)); Special := Normal; elsif Number_Part.all'Tag = Number_Nonterminal2'Tag then Value := Long_Float'Value (Number_Nonterminal2(Number_Part.all).Decimal_Literal_Part.Token_String.all); Special := Normal; else pragma Assert(False); Value := 0.0; Special := NaN; end if; exception when others => Value := 0.0; Special := NaN; end Get_Number; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal1) return Unbounded_String is begin return +This.Ancestor_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal2) return Unbounded_String is begin return +This.Ancestor_Or_Self_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal3) return Unbounded_String is begin return +This.Attribute_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal4) return Unbounded_String is begin return +This.Child_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal5) return Unbounded_String is begin return +This.Descendant_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal6) return Unbounded_String is begin return +This.Descendant_Or_Self_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal7) return Unbounded_String is begin return +This.Following_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal8) return Unbounded_String is begin return +This.Following_Sibling_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal9) return Unbounded_String is begin return +This.Namespace_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal10) return Unbounded_String is begin return +This.Parent_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal11) return Unbounded_String is begin return +This.Preceding_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal12) return Unbounded_String is begin return +This.Preceding_Sibling_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Axis_Name(This : Axis_Name_Nonterminal13) return Unbounded_String is begin return +This.Self_Part.Token_String.all; end Get_Axis_Name; ---------------------------------------------------------- function Get_Node_Type_Name(This : Node_Type_Nonterminal1) return Unbounded_String is begin return +This.Comment_Part.Token_String.all; end Get_Node_Type_Name; ---------------------------------------------------------- function Get_Node_Type_Name(This : Node_Type_Nonterminal2) return Unbounded_String is begin return +This.Text_Part.Token_String.all; end Get_Node_Type_Name; ---------------------------------------------------------- function Get_Node_Type_Name(This : Node_Type_Nonterminal3) return Unbounded_String is begin return +This.Processing_Instruction_Part.Token_String.all; end Get_Node_Type_Name; ---------------------------------------------------------- function Get_Node_Type_Name(This : Node_Type_Nonterminal4) return Unbounded_String is begin return +This.Node_Part.Token_String.all; end Get_Node_Type_Name; ---------------------------------------------------------- ------------- -- Pathify -- ------------- procedure Pathify (This : in out Parseable_Token) is begin null; end Pathify; ---------------------------------------------------------- -- -- These three Pathify procedures are the only ones through which -- the parse tree traversal will commence; two for different forms -- of relative paths, and one for absolute paths. The working -- step definition is cleared, filled out by invoking the parse -- tree, and then added to the processed location path. procedure Pathify (This : in out Location_Path_nonterminal1) is begin Pathify(This.Relative_Location_Path_Part.all); Add(Location_Step); Reset; end Pathify; procedure Pathify (This : in out Location_Path_nonterminal2) is begin Pathify(This.Absolute_Location_Path_Part.all); Add(Location_Step); Reset; end Pathify; procedure Pathify (This : in out Relative_Location_Path_nonterminal2) is begin -- An initial relative location is included here, process it, -- add the step, then work on the next step part Pathify(This.Relative_Location_Path_Part.all); Add(Location_Step); Reset; Pathify(This.Step_Part.all); end Pathify; -- ---------------------------------------------------------- ------------- -- Pathify -- ------------- procedure Pathify (This : in out Absolute_Location_Path_nonterminal1) is begin Location_Step := (Axis => Self_Axis, Node_Test => (Node_Test => Node_Node_Test, Name => Null_Unbounded_String), Location_Predicates => Predicates.Null_Predicate, Output_Step => False); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Absolute_Location_Path_nonterminal2) is begin Pathify(This.Relative_Location_Path_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Absolute_Location_Path_nonterminal3) is begin Pathify(This.Abbreviated_Absolute_Location_Path_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Relative_Location_Path_nonterminal1) is begin Pathify(This.Step_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Relative_Location_Path_nonterminal3) is begin Pathify(This.Abbreviated_Relative_Location_Path_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Step_nonterminal1) is begin Pathify(This.Step_Base_Part.all); Pathify(This.Predicates_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Step_nonterminal2) is begin Pathify(This.Abbreviated_Step_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Predicates_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Predicates_nonterminal2) is begin Pathify(This.Predicates_Part.all); Pathify(This.Predicate_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Step_Base_nonterminal1) is begin Pathify(This.Axis_Specifier_Part.all); Pathify(This.Node_Test_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Step_Base_nonterminal2) is begin Pathify(This.Abbreviated_Step_Base_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Abbreviated_Step_Base_nonterminal1) is begin Location_Step.Axis := Child_Axis; Pathify(This.Node_Test_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Abbreviated_Step_Base_nonterminal2) is begin Location_Step.Axis := Attribute_Axis; Pathify(This.Node_Test_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Predicate_nonterminal) is begin -- This is the root of the subtree of the predicate expression Predicates.Add_Predicate_Parse (Location_Step.Location_Predicates, This.Predicate_Expr_Part.all'Access); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Specifier_nonterminal) is begin Pathify(This.Axis_Name_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal1) is begin Location_Step.Axis := Ancestor_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal2) is begin Location_Step.Axis := Ancestor_Or_Self_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal3) is begin Location_Step.Axis := Attribute_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal4) is begin Location_Step.Axis := Child_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal5) is begin Location_Step.Axis := Descendant_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal6) is begin Location_Step.Axis := Descendant_Or_Self_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal7) is begin Location_Step.Axis := Following_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal8) is begin Location_Step.Axis := Following_Sibling_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal9) is begin Location_Step.Axis := Namespace_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal10) is begin Location_Step.Axis := Parent_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal11) is begin Location_Step.Axis := Preceding_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal12) is begin Location_Step.Axis := Preceding_Sibling_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Axis_Name_nonterminal13) is begin Location_Step.Axis := Self_Axis; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Node_Test_nonterminal1) is begin Location_Step.Node_Test := (Node_Test => NCName_Node_Test, Name => Null_Unbounded_String); -- Set via Name_Test_Part Pathify(This.Name_Test_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Node_Test_nonterminal2) is begin Pathify(This.Node_Type_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Node_Test_nonterminal3) is S : Unbounded_String := Get_Literal(This.Literal_Part); begin Location_Step.Node_Test := (Node_Test => Processing_Instruction_Node_Test, Name => S); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Node_Type_nonterminal1) is begin Location_Step.Node_Test := (Node_Test => Comment_Node_Test, Name => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Node_Type_nonterminal2) is begin Location_Step.Node_Test := (Node_Test => Text_Node_Test, Name => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Node_Type_nonterminal3) is begin Location_Step.Node_Test := (Node_Test => Processing_Instruction_Node_Test, Name => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Node_Type_nonterminal4) is begin Location_Step.Node_Test := (Node_Test => Node_Node_Test, Name => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Name_Test_nonterminal1) is begin Location_Step.Node_Test.Name := Star; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Name_Test_nonterminal2) is begin Pathify(This.Qname_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Name_Test_nonterminal3) is begin Pathify(This.NCName_Or_ID_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out QName_nonterminal1) is begin Pathify(This.NCName_Or_ID_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out QName_nonterminal2) is begin Location_Step.Node_Test := (Node_Test => QName_Node_Test, Name => To_Unbounded_String (NCNAME_Or_ID_Nonterminal1 (This.NCName_Or_ID_Part2.all).NCName_Part.Token_String.all), Prefix => To_Unbounded_String (NCNAME_Or_ID_Nonterminal1 (This.NCName_Or_ID_Part1.all).NCName_Part.Token_String.all)); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify(This : in out NCNAME_Or_ID_nonterminal1) is begin Location_Step.Node_Test := (Node_Test => QName_Node_Test, Name => To_Unbounded_String(This.NCName_Part.Token_String.all), Prefix => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify(This : in out NCNAME_Or_ID_nonterminal2) is begin Location_Step.Node_Test := (Node_Test => QName_Node_Test, Name => Get_Axis_Name(This.Axis_Name_Part.all), Prefix => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify(This : in out NCNAME_Or_ID_nonterminal3) is begin Location_Step.Node_Test := (Node_Test => QName_Node_Test, Name => Get_Node_Type_Name(This.Node_Type_Part.all), Prefix => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify(This : in out NCNAME_Or_ID_nonterminal4) is begin Location_Step.Node_Test := (Node_Test => QName_Node_Test, Name => To_Unbounded_String(This.And_Part.Token_String.all), Prefix => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify(This : in out NCNAME_Or_ID_nonterminal5) is begin Location_Step.Node_Test := (Node_Test => QName_Node_Test, Name => To_Unbounded_String(This.Or_Part.Token_String.all), Prefix => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify(This : in out NCNAME_Or_ID_nonterminal6) is begin Location_Step.Node_Test := (Node_Test => QName_Node_Test, Name => To_Unbounded_String(This.Mod_Part.Token_String.all), Prefix => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify(This : in out NCNAME_Or_ID_nonterminal7) is begin Location_Step.Node_Test := (Node_Test => QName_Node_Test, Name => To_Unbounded_String(This.Div_Part.Token_String.All), Prefix => Null_Unbounded_String); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Predicate_Expr_nonterminal) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Abbreviated_Absolute_Location_Path_nonterminal) is begin -- The "//" part Add((Axis => Descendant_Or_Self_Axis, Node_Test => (Node_Test => Node_Node_Test, Name => Star), Location_Predicates => Predicates.Null_Predicate, Output_Step => False)); Reset; Pathify(This.Relative_Location_Path_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Abbreviated_Relative_Location_Path_nonterminal) is begin Pathify(This.Relative_Location_Path_Part.all); Add(Location_Step); Add((Axis => Descendant_Or_Self_Axis, Node_Test => (Node_Test => Node_Node_Test, Name => Star), Location_Predicates => Predicates.Null_Predicate, Output_Step => False)); Reset; Pathify(This.Step_Part.all); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Abbreviated_Step_nonterminal1) is begin Location_Step := (Axis => Self_Axis, Node_Test => (Node_Test => Node_Node_Test, Name => Star), Location_Predicates => Predicates.Null_Predicate, Output_Step => False); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Abbreviated_Step_nonterminal2) is begin Location_Step := (Axis => Parent_Axis, Node_Test => (Node_Test => Node_Node_Test, Name => Star), Location_Predicates => Predicates.Null_Predicate, Output_Step => False); end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Expr_nonterminal) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Primary_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Primary_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Primary_Expr_nonterminal3) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Primary_Expr_nonterminal4) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Primary_Expr_nonterminal5) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Variable_Reference_nonterminal) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Function_Call_nonterminal) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Arguments_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Arguments_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Arguments_nonterminal3) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Argument_nonterminal) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Function_Name_nonterminal) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Union_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Union_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Path_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Path_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Path_Expr_nonterminal3) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Path_Expr_nonterminal4) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Filter_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Filter_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Or_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Or_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out And_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out And_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Equality_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Equality_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Equality_Expr_nonterminal3) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Relational_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Relational_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Relational_Expr_nonterminal3) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Relational_Expr_nonterminal4) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Relational_Expr_nonterminal5) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Additive_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Additive_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Additive_Expr_nonterminal3) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Multiplicative_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Multiplicative_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Multiplicative_Expr_nonterminal3) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Multiplicative_Expr_nonterminal4) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Unary_Expr_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Unary_Expr_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Number_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Number_nonterminal2) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Literal_nonterminal1) is begin null; end Pathify; ------------- -- Pathify -- ------------- procedure Pathify (This : in out Literal_nonterminal2) is begin null; end Pathify; ---------------------------------------------------------- ---------------------------------------------------------- ---------------------------------------------------------- ---------------------------------------------------------- ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Parseable_Token; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & " Parseable_Token"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Location_Path_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is Predicate_Path_Nodes : Dom.Core.Node_List; begin Value := (As_Expr_Text, Null_Unbounded_String); Evaluate(This.Relative_Location_Path_Part.all, Context_Node, Value); Predicate_Path_Nodes := Xia.Xpath_Query(Context_Node.N, To_String(Value.S)); Value := (As_Node_List, Predicate_Path_Nodes); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Location_Path_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Predicate_Path_Nodes : Dom.Core.Node_List; begin Value := (As_Expr_Text, Null_Unbounded_String); Evaluate(This.Absolute_Location_Path_Part.all, Context_Node, Value); Predicate_Path_Nodes := Xia.Xpath_Query(Context_Node.N, To_String(Value.S)); Value := (As_Node_List, Predicate_Path_Nodes); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Relative_Location_Path_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Step_Value : Expression_Values(As_Expr_Text); begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Relative_Location_Path_Part.all, Context_Node, Value); Evaluate(This.Step_Part.all, Context_Node, Step_Value); Append(Value.S, "/" & Step_Value.S); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Absolute_Location_Path_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"/"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Absolute_Location_Path_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Relative_Location_Path_Part.all, Context_Node, Value); Value.S := "/" & Value.S; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Absolute_Location_Path_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Abbreviated_Absolute_Location_Path_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Relative_Location_Path_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Step_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Relative_Location_Path_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Abbreviated_Relative_Location_Path_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Step_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is Predicate_Value : Expression_Values(As_Expr_Text); begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Step_Base_Part.all, Context_Node, Value); Evaluate(This.Predicates_Part.all, Context_Node, Predicate_Value); Append(Value.S, Predicate_Value.S); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Step_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Abbreviated_Step_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Predicates_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is pragma Warnings(Off, Value); begin -- There is no predicate. pragma Assert(Value.Value_Type = As_Expr_Text); null; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Predicates_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Predicate_Value : Expression_Values(As_Expr_Text); begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Predicates_Part.all, Context_Node, Value); Evaluate(This.Predicate_Part.all, Context_Node, Predicate_Value); Append(Value.S, Predicate_Value.S); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Step_Base_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is Node_Test_Value : Expression_Values(As_Expr_Text); begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Axis_Specifier_Part.all, Context_Node, Value); Evaluate(This.Node_Test_Part.all, Context_Node, Node_Test_Value); Append(Value.S, Node_Test_Value.S); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Step_Base_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Abbreviated_Step_Base_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Abbreviated_Step_Base_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Node_Test_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Abbreviated_Step_Base_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Node_Test_Part.all, Context_Node, Value); Value.S := "@" & Value.S; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Predicate_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Predicate_Expr_Part.all, Context_Node, Value); Value.S := "[" & Value.S & "]"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Specifier_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Axis_Name_Part.all, Context_Node, Value); Append(Value.S, "::"); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"ancestor"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"ancestor-or-self"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"attribute"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"child"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal5; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"descendant"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal6; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"descendant-or-self"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal7; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"following"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal8; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"following-sibling"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal9; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"namespace"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal10; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"parent"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal11; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"preceding"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal12; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"preceding-sibling"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Axis_Name_Nonterminal13; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"self"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Node_Test_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Name_Test_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Node_Test_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Node_Type_Part.all, Context_Node, Value); Append(Value.S, "()"); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Node_Test_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is Literal_Value : Expression_Values(As_Expr_Text); begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Processing_Instruction_Part.Token_String.all; Evaluate(This.Literal_Part.all, Context_Node, Literal_Value); Append(Value.S, "(" & Literal_Value.S & ")"); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Node_Type_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Comment_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Node_Type_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Text_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Node_Type_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Processing_Instruction_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Node_Type_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Node_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Name_Test_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"*"; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Name_Test_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Qname_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Name_Test_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Ncname_Or_ID_Part.all, Context_Node, Value); Append(Value.S, ":*"); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in QName_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.NCName_Or_ID_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in QName_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Part2_Value : Expression_Values(As_Expr_Text); begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.NCName_Or_ID_Part1.all, Context_Node, Value); Evaluate(This.NCName_Or_ID_Part2.all, Context_Node, Part2_Value); Append(Value.S, ":" & Part2_Value.S); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in NCNAME_Or_ID_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.NCName_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in NCNAME_Or_ID_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := Get_Axis_Name(This.Axis_Name_Part.all); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in NCNAME_Or_ID_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := Get_Node_Type_Name(This.Node_Type_Part.all); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in NCNAME_Or_ID_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.And_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in NCNAME_Or_ID_Nonterminal5; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Or_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in NCNAME_Or_ID_Nonterminal6; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Mod_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in NCNAME_Or_ID_Nonterminal7; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Div_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Predicate_Expr_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is begin if Value.Value_Type = As_Expr_Text then Evaluate(This.Expr_Part.all, Context_Node, Value); else Evaluate(This.Expr_Part.all, Context_Node, Value); -- If this is numeric, then check to see if this node occupies -- the designated position if (Value.Value_Type = Expressions.As_Number) and then (Value.Special = Normal) then if Long_Float'Floor(Value.F) = Long_Float(Context_Node.Node_Position) then Value := (As_Boolean, True); else Value := (As_Boolean, False); end if; end if; end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Abbreviated_Absolute_Location_Path_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Relative_Location_Path_Part.all, Context_Node, Value); Value.S := "//" & Value.S; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Abbreviated_Relative_Location_Path_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is Step_Part_Value : Expression_Values(As_Expr_Text); begin pragma Assert(Value.Value_Type = As_Expr_Text); Evaluate(This.Relative_Location_Path_Part.all, Context_Node, Value); Evaluate(This.Step_Part.all, Context_Node, Step_Part_Value); Append(Value.S, "//" & Step_Part_Value.S); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Abbreviated_Step_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +"."; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Abbreviated_Step_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +".."; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Expr_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Or_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Primary_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & " Primary_Expr_Nonterminal1"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Primary_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Primary_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is begin Value := (Value_Type => As_String, S => Get_Literal(This.Literal_Part)); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Primary_Expr_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values) is Float_Value : Long_Float; Special : Special_Number_Values; begin Get_Number(This.Number_Part, Float_Value, Special); Value := (Value_Type => As_Number, F => Float_Value, Special => Special); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Primary_Expr_Nonterminal5; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Function_Call_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Variable_Reference_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & " Variable_Reference_Nonterminal"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Function_Call_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is Function_Name : String_Ptr; Args : Argument_List := Evaluate_Arguments(This.Arguments_Part, Context_Node); begin -- Just reach down and get the function name Function_Name := NCName_Or_ID_Nonterminal1 (Qname_Nonterminal1(This.Function_Name_Part.Qname_Part.all).NCName_Or_ID_Part.all). NCName_Part.Token_String; Evaluate_Function(Function_Name, Context_Node, Args, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Arguments_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & "Arguments_Nonterminal1"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Arguments_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & "Arguments_Nonterminal2"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Arguments_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & "Arguments_Nonterminal3"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Argument_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Function_Name_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & " Function_Name_Nonterminal"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Union_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Path_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Union_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Union_Expr_Part.all, Context_Node, Op1); Evaluate(This.Path_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & "|" & Op2.S; else -- Evaluate the union of the ops Coerce(Op1, As_Node_List); Coerce(Op2, As_Node_List); -- Still here? Okay, merge the two sets. Value := Op1; for I in 0 .. Dom.Core.Nodes.Length(Op2.Ns) - 1 loop if not Is_In(Dom.Core.Nodes.Item(Op2.Ns, I), Value.Ns) then Dom.Core.Append_Node(Value.Ns, Dom.Core.Nodes.Item(Op2.Ns, I)); end if; end loop; end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Path_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Location_Path_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Path_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Filter_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Path_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & " Path_Expr_Nonterminal3"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Path_Expr_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & " Path_Expr_Nonterminal4"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Filter_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Primary_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Filter_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin Put_Line("Evaluating Token: " & " Filter_Expr_Nonterminal2"); Value := (As_Boolean, True); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Or_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.And_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Or_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Or_Expr_Part.all, Context_Node, Op1); Evaluate(This.And_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & " or " & Op2.S; else Coerce(Op1, As_Boolean); Coerce(Op2, As_Boolean); Value := (Value_Type => As_Boolean, B => Op1.B or Op2.B); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in And_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Equality_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in And_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.And_Expr_Part.all, Context_Node, Op1); Evaluate(This.Equality_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & " and " & Op2.S; else Coerce(Op1, As_Boolean); Coerce(Op2, As_Boolean); Value := (Value_Type => As_Boolean, B => Op1.B and Op2.B); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Equality_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Relational_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Equality_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is -- EQ Op1, Op2 : Expression_Values; begin Evaluate(This.Equality_Expr_Part.all, Context_Node, Op1); Evaluate(This.Relational_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & "=" & Op2.S; else Value := (Value_Type => As_Boolean, B => Expressions.Compare(Op1, Op2, Equal)); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Equality_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is -- NE Op1, Op2 : Expression_Values; begin Evaluate(This.Equality_Expr_Part.all, Context_Node, Op1); Evaluate(This.Relational_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & "!=" & Op2.S; else Value := (Value_Type => As_Boolean, B => Expressions.Compare(Op1, Op2, Not_Equal)); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Relational_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Additive_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Relational_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Relational_Expr_Part.all, Context_Node, Op1); Evaluate(This.Additive_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & "<" & Op2.S; else Value := (Value_Type => As_Boolean, B => Expressions.Compare(Op1, Op2, Less_Than)); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Relational_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Relational_Expr_Part.all, Context_Node, Op1); Evaluate(This.Additive_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & ">" & Op2.S; else Value := (Value_Type => As_Boolean, B => Expressions.Compare(Op1, Op2, Greater_Than)); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Relational_Expr_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Relational_Expr_Part.all, Context_Node, Op1); Evaluate(This.Additive_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & "<=" & Op2.S; else Value := (Value_Type => As_Boolean, B => Expressions.Compare(Op1, Op2, Less_Or_Equal)); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Relational_Expr_Nonterminal5; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Relational_Expr_Part.all, Context_Node, Op1); Evaluate(This.Additive_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & ">=" & Op2.S; else Value := (Value_Type => As_Boolean, B => Expressions.Compare(Op1, Op2, Greater_Or_Equal)); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Additive_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Multiplicative_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Additive_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Additive_Expr_Part.all, Context_Node, Op1); Evaluate(This.Multiplicative_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & " + " & Op2.S; else Coerce(Op1, As_Number); Coerce(Op2, As_Number); Value := Expressions.Compute(Op1, Op2, Expressions.Add); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Additive_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Additive_Expr_Part.all, Context_Node, Op1); Evaluate(This.Multiplicative_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & " - " & Op2.S; else Coerce(Op1, As_Number); Coerce(Op2, As_Number); Value := Expressions.Compute(Op1, Op2, Expressions.Subtract); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Multiplicative_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Unary_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Multiplicative_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Multiplicative_Expr_Part.all, Context_Node, Op1); Evaluate(This.Unary_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & " * " & Op2.S; else Coerce(Op1, As_Number); Coerce(Op2, As_Number); Value := Expressions.Compute(Op1, Op2, Expressions.Multiply); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Multiplicative_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Multiplicative_Expr_Part.all, Context_Node, Op1); Evaluate(This.Unary_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & " div " & Op2.S; else Coerce(Op1, As_Number); Coerce(Op2, As_Number); Value := Expressions.Compute(Op1, Op2, Expressions.Divide); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Multiplicative_Expr_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values) is Op1, Op2 : Expression_Values; begin Evaluate(This.Multiplicative_Expr_Part.all, Context_Node, Op1); Evaluate(This.Unary_Expr_Part.all, Context_Node, Op2); if Value.Value_Type = As_Expr_Text then Value.S := Op1.S & " mod " & Op2.S; else Coerce(Op1, As_Number); Coerce(Op2, As_Number); Value := Expressions.Compute(Op1, Op2, Expressions.Modulo); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Unary_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Union_Expr_Part.all, Context_Node, Value); end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Unary_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin Evaluate(This.Unary_Expr_Part.all, Context_Node, Value); if Value.Value_Type = As_Expr_Text then Value.S := "-" & Value.S; else Coerce(Value, As_Number); Value := Expressions.Compute(Value, Value, Expressions.Negate); end if; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Number_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Integer_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Number_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.Decimal_Literal_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Literal_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.DQ_Literal_Part.Token_String.all; end Evaluate; ------------- -- Evaluate -- ------------- procedure Evaluate (This : in Literal_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values) is begin pragma Assert(Value.Value_Type = As_Expr_Text); Value.S := +This.SQ_Literal_Part.Token_String.all; end Evaluate; ---------------------------------------------------------- function Evaluate_Arguments (Arguments_Part : Arguments_Nonterminal_Ptr; Context_Node : Node_Items) return Argument_List is Value : Expression_Values; use type Ada.Tags.Tag; begin if Arguments_Part.all'Tag = Arguments_Nonterminal1'Tag then return No_Arguments; elsif Arguments_Part.all'Tag = Arguments_Nonterminal2'Tag then Evaluate(Arguments_Nonterminal2(Arguments_Part.all).Argument_Part.all, Context_Node, Value); return (1 => Value); else pragma Assert(Arguments_Part.all'Tag = Arguments_Nonterminal3'Tag); Evaluate(Arguments_Nonterminal3(Arguments_Part.all).Argument_Part.all, Context_Node, Value); return Evaluate_Arguments(Arguments_Nonterminal3(Arguments_Part.all).Arguments_Part, Context_Node) & Value; end if; end Evaluate_Arguments; ---------------------------------------------------------- end xia_parser_Model; xia-1.00/xia_parser_model.ads0100666000076600007670000014723110212334121015105 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ -- Automatically generated AdaGOOP output -- (by Martin C. Carlisle) -- If you modify, be careful about losing your work! ------------------------------------------------------------------------ with xia_parser; with Mckae.XML.XPath.Expressions; use Mckae.XML.XPath.Expressions; with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; package xia_parser_Model is subtype String_Ptr is McKae.XML.XPath.Expressions.String_Ptr; type Parseable is abstract tagged null record; procedure Pathify(This : in out Parseable) is abstract; procedure Evaluate (This : in Parseable; Context_Node : in Node_Items; Value : out Expression_Values) is abstract; type Parseable_Ptr is access all Parseable'Class; type Parseable_Token is new Parseable with record Line : Natural; Column : Natural; Token_String : String_Ptr; Token_Type : xia_parser.Token; end record; procedure Pathify(This : in out Parseable_Token); procedure Evaluate (This : in Parseable_Token; Context_Node : in Node_Items; Value : out Expression_Values); type Parseable_Token_Ptr is access all Parseable_Token'Class; type Literal_nonterminal; type Literal_nonterminal_ptr is access all Literal_nonterminal'Class; type Number_nonterminal; type Number_nonterminal_ptr is access all Number_nonterminal'Class; type Unary_Expr_nonterminal; type Unary_Expr_nonterminal_ptr is access all Unary_Expr_nonterminal'Class; type Multiplicative_Expr_nonterminal; type Multiplicative_Expr_nonterminal_ptr is access all Multiplicative_Expr_nonterminal'Class; type Additive_Expr_nonterminal; type Additive_Expr_nonterminal_ptr is access all Additive_Expr_nonterminal'Class; type Relational_Expr_nonterminal; type Relational_Expr_nonterminal_ptr is access all Relational_Expr_nonterminal'Class; type Equality_Expr_nonterminal; type Equality_Expr_nonterminal_ptr is access all Equality_Expr_nonterminal'Class; type And_Expr_nonterminal; type And_Expr_nonterminal_ptr is access all And_Expr_nonterminal'Class; type Or_Expr_nonterminal; type Or_Expr_nonterminal_ptr is access all Or_Expr_nonterminal'Class; type Filter_Expr_nonterminal; type Filter_Expr_nonterminal_ptr is access all Filter_Expr_nonterminal'Class; type Path_Expr_nonterminal; type Path_Expr_nonterminal_ptr is access all Path_Expr_nonterminal'Class; type Union_Expr_nonterminal; type Union_Expr_nonterminal_ptr is access all Union_Expr_nonterminal'Class; type Function_Name_nonterminal; type Function_Name_nonterminal_ptr is access all Function_Name_nonterminal'Class; type Argument_nonterminal; type Argument_nonterminal_ptr is access all Argument_nonterminal'Class; type Arguments_nonterminal; type Arguments_nonterminal_ptr is access all Arguments_nonterminal'Class; type Function_Call_nonterminal; type Function_Call_nonterminal_ptr is access all Function_Call_nonterminal'Class; type Variable_Reference_nonterminal; type Variable_Reference_nonterminal_ptr is access all Variable_Reference_nonterminal'Class; type Primary_Expr_nonterminal; type Primary_Expr_nonterminal_ptr is access all Primary_Expr_nonterminal'Class; type Expr_nonterminal; type Expr_nonterminal_ptr is access all Expr_nonterminal'Class; type Abbreviated_Step_nonterminal; type Abbreviated_Step_nonterminal_ptr is access all Abbreviated_Step_nonterminal'Class; type Abbreviated_Relative_Location_Path_nonterminal; type Abbreviated_Relative_Location_Path_nonterminal_ptr is access all Abbreviated_Relative_Location_Path_nonterminal'Class; type Abbreviated_Absolute_Location_Path_nonterminal; type Abbreviated_Absolute_Location_Path_nonterminal_ptr is access all Abbreviated_Absolute_Location_Path_nonterminal'Class; type Predicate_Expr_nonterminal; type Predicate_Expr_nonterminal_ptr is access all Predicate_Expr_nonterminal'Class; type NCNAME_Or_ID_nonterminal; type NCNAME_Or_ID_nonterminal_ptr is access all NCNAME_Or_ID_nonterminal'Class; type QName_nonterminal; type QName_nonterminal_ptr is access all QName_nonterminal'Class; type Name_Test_nonterminal; type Name_Test_nonterminal_ptr is access all Name_Test_nonterminal'Class; type Node_Type_nonterminal; type Node_Type_nonterminal_ptr is access all Node_Type_nonterminal'Class; type Node_Test_nonterminal; type Node_Test_nonterminal_ptr is access all Node_Test_nonterminal'Class; type Axis_Name_nonterminal; type Axis_Name_nonterminal_ptr is access all Axis_Name_nonterminal'Class; type Axis_Specifier_nonterminal; type Axis_Specifier_nonterminal_ptr is access all Axis_Specifier_nonterminal'Class; type Predicate_nonterminal; type Predicate_nonterminal_ptr is access all Predicate_nonterminal'Class; type Abbreviated_Step_Base_nonterminal; type Abbreviated_Step_Base_nonterminal_ptr is access all Abbreviated_Step_Base_nonterminal'Class; type Step_Base_nonterminal; type Step_Base_nonterminal_ptr is access all Step_Base_nonterminal'Class; type Predicates_nonterminal; type Predicates_nonterminal_ptr is access all Predicates_nonterminal'Class; type Step_nonterminal; type Step_nonterminal_ptr is access all Step_nonterminal'Class; type Relative_Location_Path_nonterminal; type Relative_Location_Path_nonterminal_ptr is access all Relative_Location_Path_nonterminal'Class; type Absolute_Location_Path_nonterminal; type Absolute_Location_Path_nonterminal_ptr is access all Absolute_Location_Path_nonterminal'Class; type Location_Path_nonterminal; type Location_Path_nonterminal_ptr is access all Location_Path_nonterminal'Class; type Location_Path_nonterminal is abstract new Parseable with null record; type Location_Path_nonterminal1 is new Location_Path_nonterminal with record Relative_Location_Path_part : Relative_Location_Path_nonterminal_Ptr; end record; procedure Pathify(This : in out Location_Path_nonterminal1); procedure Evaluate(This : in Location_Path_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Location_Path_nonterminal2 is new Location_Path_nonterminal with record Absolute_Location_Path_part : Absolute_Location_Path_nonterminal_Ptr; end record; procedure Pathify(This : in out Location_Path_nonterminal2); procedure Evaluate(This : in Location_Path_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Absolute_Location_Path_nonterminal is abstract new Parseable with null record; type Absolute_Location_Path_nonterminal1 is new Absolute_Location_Path_nonterminal with record SLASH_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Absolute_Location_Path_nonterminal1); procedure Evaluate(This : in Absolute_Location_Path_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Absolute_Location_Path_nonterminal2 is new Absolute_Location_Path_nonterminal with record SLASH_part : Parseable_Token_Ptr; Relative_Location_Path_part : Relative_Location_Path_nonterminal_Ptr; end record; procedure Pathify(This : in out Absolute_Location_Path_nonterminal2); procedure Evaluate(This : in Absolute_Location_Path_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Absolute_Location_Path_nonterminal3 is new Absolute_Location_Path_nonterminal with record Abbreviated_Absolute_Location_Path_part : Abbreviated_Absolute_Location_Path_nonterminal_Ptr; end record; procedure Pathify(This : in out Absolute_Location_Path_nonterminal3); procedure Evaluate(This : in Absolute_Location_Path_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Relative_Location_Path_nonterminal is abstract new Parseable with null record; type Relative_Location_Path_nonterminal1 is new Relative_Location_Path_nonterminal with record Step_part : Step_nonterminal_Ptr; end record; procedure Pathify(This : in out Relative_Location_Path_nonterminal1); procedure Evaluate(This : in Relative_Location_Path_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Relative_Location_Path_nonterminal2 is new Relative_Location_Path_nonterminal with record Relative_Location_Path_part : Relative_Location_Path_nonterminal_Ptr; SLASH_part : Parseable_Token_Ptr; Step_part : Step_nonterminal_Ptr; end record; procedure Pathify(This : in out Relative_Location_Path_nonterminal2); procedure Evaluate(This : in Relative_Location_Path_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Relative_Location_Path_nonterminal3 is new Relative_Location_Path_nonterminal with record Abbreviated_Relative_Location_Path_part : Abbreviated_Relative_Location_Path_nonterminal_Ptr; end record; procedure Pathify(This : in out Relative_Location_Path_nonterminal3); procedure Evaluate(This : in Relative_Location_Path_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Step_nonterminal is abstract new Parseable with null record; type Step_nonterminal1 is new Step_nonterminal with record Step_Base_part : Step_Base_nonterminal_Ptr; Predicates_part : Predicates_nonterminal_Ptr; end record; procedure Pathify(This : in out Step_nonterminal1); procedure Evaluate(This : in Step_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Step_nonterminal2 is new Step_nonterminal with record Abbreviated_Step_part : Abbreviated_Step_nonterminal_Ptr; end record; procedure Pathify(This : in out Step_nonterminal2); procedure Evaluate(This : in Step_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Predicates_nonterminal is abstract new Parseable with null record; type Predicates_nonterminal1 is new Predicates_nonterminal with record null; end record; procedure Pathify(This : in out Predicates_nonterminal1); procedure Evaluate(This : in Predicates_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Predicates_nonterminal2 is new Predicates_nonterminal with record Predicates_part : Predicates_nonterminal_Ptr; Predicate_part : Predicate_nonterminal_Ptr; end record; procedure Pathify(This : in out Predicates_nonterminal2); procedure Evaluate(This : in Predicates_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Step_Base_nonterminal is abstract new Parseable with null record; type Step_Base_nonterminal1 is new Step_Base_nonterminal with record Axis_Specifier_part : Axis_Specifier_nonterminal_Ptr; Node_Test_part : Node_Test_nonterminal_Ptr; end record; procedure Pathify(This : in out Step_Base_nonterminal1); procedure Evaluate(This : in Step_Base_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Step_Base_nonterminal2 is new Step_Base_nonterminal with record Abbreviated_Step_Base_part : Abbreviated_Step_Base_nonterminal_Ptr; end record; procedure Pathify(This : in out Step_Base_nonterminal2); procedure Evaluate(This : in Step_Base_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Abbreviated_Step_Base_nonterminal is abstract new Parseable with null record; type Abbreviated_Step_Base_nonterminal1 is new Abbreviated_Step_Base_nonterminal with record Node_Test_part : Node_Test_nonterminal_Ptr; end record; procedure Pathify(This : in out Abbreviated_Step_Base_nonterminal1); procedure Evaluate(This : in Abbreviated_Step_Base_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Abbreviated_Step_Base_nonterminal2 is new Abbreviated_Step_Base_nonterminal with record AT_SIGN_part : Parseable_Token_Ptr; Node_Test_part : Node_Test_nonterminal_Ptr; end record; procedure Pathify(This : in out Abbreviated_Step_Base_nonterminal2); procedure Evaluate(This : in Abbreviated_Step_Base_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Predicate_nonterminal is new Parseable with record L_BRACKET_part : Parseable_Token_Ptr; Predicate_Expr_part : Predicate_Expr_nonterminal_Ptr; R_BRACKET_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Predicate_nonterminal); procedure Evaluate(This : in Predicate_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Specifier_nonterminal is new Parseable with record Axis_Name_part : Axis_Name_nonterminal_Ptr; DOUBLE_COLON_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Axis_Specifier_nonterminal); procedure Evaluate(This : in Axis_Specifier_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal is abstract new Parseable with null record; function Get_Axis_Name(This : in Axis_Name_Nonterminal) return Unbounded_String is abstract; type Axis_Name_nonterminal1 is new Axis_Name_nonterminal with record ANCESTOR_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal1) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal1); procedure Evaluate(This : in Axis_Name_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal2 is new Axis_Name_nonterminal with record ANCESTOR_OR_SELF_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal2) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal2); procedure Evaluate(This : in Axis_Name_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal3 is new Axis_Name_nonterminal with record ATTRIBUTE_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal3) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal3); procedure Evaluate(This : in Axis_Name_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal4 is new Axis_Name_nonterminal with record CHILD_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal4) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal4); procedure Evaluate(This : in Axis_Name_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal5 is new Axis_Name_nonterminal with record DESCENDANT_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal5) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal5); procedure Evaluate(This : in Axis_Name_Nonterminal5; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal6 is new Axis_Name_nonterminal with record DESCENDANT_OR_SELF_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal6) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal6); procedure Evaluate(This : in Axis_Name_Nonterminal6; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal7 is new Axis_Name_nonterminal with record FOLLOWING_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal7) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal7); procedure Evaluate(This : in Axis_Name_Nonterminal7; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal8 is new Axis_Name_nonterminal with record FOLLOWING_SIBLING_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal8) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal8); procedure Evaluate(This : in Axis_Name_Nonterminal8; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal9 is new Axis_Name_nonterminal with record NAMESPACE_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal9) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal9); procedure Evaluate(This : in Axis_Name_Nonterminal9; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal10 is new Axis_Name_nonterminal with record PARENT_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal10) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal10); procedure Evaluate(This : in Axis_Name_Nonterminal10; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal11 is new Axis_Name_nonterminal with record PRECEDING_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal11) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal11); procedure Evaluate(This : in Axis_Name_Nonterminal11; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal12 is new Axis_Name_nonterminal with record PRECEDING_SIBLING_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal12) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal12); procedure Evaluate(This : in Axis_Name_Nonterminal12; Context_Node : in Node_Items; Value : out Expression_Values); type Axis_Name_nonterminal13 is new Axis_Name_nonterminal with record SELF_part : Parseable_Token_Ptr; end record; function Get_Axis_Name(This : in Axis_Name_nonterminal13) return Unbounded_String; procedure Pathify(This : in out Axis_Name_nonterminal13); procedure Evaluate(This : in Axis_Name_Nonterminal13; Context_Node : in Node_Items; Value : out Expression_Values); type Node_Test_nonterminal is abstract new Parseable with null record; type Node_Test_nonterminal1 is new Node_Test_nonterminal with record Name_Test_part : Name_Test_nonterminal_Ptr; end record; procedure Pathify(This : in out Node_Test_nonterminal1); procedure Evaluate(This : in Node_Test_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Node_Test_nonterminal2 is new Node_Test_nonterminal with record Node_Type_part : Node_Type_nonterminal_Ptr; L_PAREN_part : Parseable_Token_Ptr; R_PAREN_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Node_Test_nonterminal2); procedure Evaluate(This : in Node_Test_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Node_Test_nonterminal3 is new Node_Test_nonterminal with record PROCESSING_INSTRUCTION_part : Parseable_Token_Ptr; L_PAREN_part : Parseable_Token_Ptr; LITERAL_part : LITERAL_nonterminal_Ptr; R_PAREN_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Node_Test_nonterminal3); procedure Evaluate(This : in Node_Test_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Node_Type_nonterminal is abstract new Parseable with null record; function Get_Node_Type_Name(This : in Node_Type_Nonterminal) return Unbounded_String is abstract; type Node_Type_nonterminal1 is new Node_Type_nonterminal with record COMMENT_part : Parseable_Token_Ptr; end record; function Get_Node_Type_Name(This : in Node_Type_Nonterminal1) return Unbounded_String; procedure Pathify(This : in out Node_Type_nonterminal1); procedure Evaluate(This : in Node_Type_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Node_Type_nonterminal2 is new Node_Type_nonterminal with record TEXT_part : Parseable_Token_Ptr; end record; function Get_Node_Type_Name(This : in Node_Type_Nonterminal2) return Unbounded_String; procedure Pathify(This : in out Node_Type_nonterminal2); procedure Evaluate(This : in Node_Type_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Node_Type_nonterminal3 is new Node_Type_nonterminal with record PROCESSING_INSTRUCTION_part : Parseable_Token_Ptr; end record; function Get_Node_Type_Name(This : in Node_Type_Nonterminal3) return Unbounded_String; procedure Pathify(This : in out Node_Type_nonterminal3); procedure Evaluate(This : in Node_Type_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Node_Type_nonterminal4 is new Node_Type_nonterminal with record NODE_part : Parseable_Token_Ptr; end record; function Get_Node_Type_Name(This : in Node_Type_Nonterminal4) return Unbounded_String; procedure Pathify(This : in out Node_Type_nonterminal4); procedure Evaluate(This : in Node_Type_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values); type Name_Test_nonterminal is abstract new Parseable with null record; type Name_Test_nonterminal1 is new Name_Test_nonterminal with record STAR_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Name_Test_nonterminal1); procedure Evaluate(This : in Name_Test_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Name_Test_nonterminal2 is new Name_Test_nonterminal with record QName_part : QName_nonterminal_Ptr; end record; procedure Pathify(This : in out Name_Test_nonterminal2); procedure Evaluate(This : in Name_Test_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Name_Test_nonterminal3 is new Name_Test_nonterminal with record NCNAME_Or_ID_part : NCNAME_Or_ID_nonterminal_Ptr; COLON_part : Parseable_Token_Ptr; STAR_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Name_Test_nonterminal3); procedure Evaluate(This : in Name_Test_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type QName_nonterminal is abstract new Parseable with null record; type QName_nonterminal1 is new QName_nonterminal with record NCNAME_Or_ID_part : NCNAME_Or_ID_nonterminal_Ptr; end record; procedure Pathify(This : in out QName_nonterminal1); procedure Evaluate(This : in QName_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type QName_nonterminal2 is new QName_nonterminal with record NCNAME_Or_ID_part1 : NCNAME_Or_ID_nonterminal_Ptr; COLON_part : Parseable_Token_Ptr; NCNAME_Or_ID_part2 : NCNAME_Or_ID_nonterminal_Ptr; end record; procedure Pathify(This : in out QName_nonterminal2); procedure Evaluate(This : in QName_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type NCNAME_Or_ID_nonterminal is abstract new Parseable with null record; type NCNAME_Or_ID_nonterminal1 is new NCNAME_Or_ID_nonterminal with record NCNAME_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out NCNAME_Or_ID_nonterminal1); procedure Evaluate(This : in NCNAME_Or_ID_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type NCNAME_Or_ID_nonterminal2 is new NCNAME_Or_ID_nonterminal with record Axis_Name_part : Axis_Name_nonterminal_Ptr; end record; procedure Pathify(This : in out NCNAME_Or_ID_nonterminal2); procedure Evaluate(This : in NCNAME_Or_ID_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type NCNAME_Or_ID_nonterminal3 is new NCNAME_Or_ID_nonterminal with record Node_Type_part : Node_Type_nonterminal_Ptr; end record; procedure Pathify(This : in out NCNAME_Or_ID_nonterminal3); procedure Evaluate(This : in NCNAME_Or_ID_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type NCNAME_Or_ID_nonterminal4 is new NCNAME_Or_ID_nonterminal with record AND_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out NCNAME_Or_ID_nonterminal4); procedure Evaluate(This : in NCNAME_Or_ID_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values); type NCNAME_Or_ID_nonterminal5 is new NCNAME_Or_ID_nonterminal with record OR_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out NCNAME_Or_ID_nonterminal5); procedure Evaluate(This : in NCNAME_Or_ID_Nonterminal5; Context_Node : in Node_Items; Value : out Expression_Values); type NCNAME_Or_ID_nonterminal6 is new NCNAME_Or_ID_nonterminal with record MOD_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out NCNAME_Or_ID_nonterminal6); procedure Evaluate(This : in NCNAME_Or_ID_Nonterminal6; Context_Node : in Node_Items; Value : out Expression_Values); type NCNAME_Or_ID_nonterminal7 is new NCNAME_Or_ID_nonterminal with record DIV_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out NCNAME_Or_ID_nonterminal7); procedure Evaluate(This : in NCNAME_Or_ID_Nonterminal7; Context_Node : in Node_Items; Value : out Expression_Values); type Predicate_Expr_nonterminal is new Parseable with record Expr_part : Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Predicate_Expr_nonterminal); procedure Evaluate(This : in Predicate_Expr_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); type Abbreviated_Absolute_Location_Path_nonterminal is new Parseable with record DOUBLE_SLASH_part : Parseable_Token_Ptr; Relative_Location_Path_part : Relative_Location_Path_nonterminal_Ptr; end record; procedure Pathify(This : in out Abbreviated_Absolute_Location_Path_nonterminal); procedure Evaluate(This : in Abbreviated_Absolute_Location_Path_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); type Abbreviated_Relative_Location_Path_nonterminal is new Parseable with record Relative_Location_Path_part : Relative_Location_Path_nonterminal_Ptr; DOUBLE_SLASH_part : Parseable_Token_Ptr; Step_part : Step_nonterminal_Ptr; end record; procedure Pathify(This : in out Abbreviated_Relative_Location_Path_nonterminal); procedure Evaluate(This : in Abbreviated_Relative_Location_Path_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); type Abbreviated_Step_nonterminal is abstract new Parseable with null record; type Abbreviated_Step_nonterminal1 is new Abbreviated_Step_nonterminal with record DOT_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Abbreviated_Step_nonterminal1); procedure Evaluate(This : in Abbreviated_Step_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Abbreviated_Step_nonterminal2 is new Abbreviated_Step_nonterminal with record DOUBLE_DOT_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Abbreviated_Step_nonterminal2); procedure Evaluate(This : in Abbreviated_Step_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Expr_nonterminal is new Parseable with record Or_Expr_part : Or_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Expr_nonterminal); procedure Evaluate(This : in Expr_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); -- procedure Evaluate (This : in Expr_Nonterminal; -- Context_Node : in Node_Items; -- Value : out Expression_Values); type Primary_Expr_nonterminal is abstract new Parseable with null record; type Primary_Expr_nonterminal1 is new Primary_Expr_nonterminal with record Variable_Reference_part : Variable_Reference_nonterminal_Ptr; end record; procedure Pathify(This : in out Primary_Expr_nonterminal1); procedure Evaluate(This : in Primary_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Primary_Expr_nonterminal2 is new Primary_Expr_nonterminal with record L_PAREN_part : Parseable_Token_Ptr; Expr_part : Expr_nonterminal_Ptr; R_PAREN_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Primary_Expr_nonterminal2); procedure Evaluate(This : in Primary_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Primary_Expr_nonterminal3 is new Primary_Expr_nonterminal with record LITERAL_part : LITERAL_nonterminal_Ptr; end record; procedure Pathify(This : in out Primary_Expr_nonterminal3); procedure Evaluate(This : in Primary_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Primary_Expr_nonterminal4 is new Primary_Expr_nonterminal with record Number_part : Number_nonterminal_Ptr; end record; procedure Pathify(This : in out Primary_Expr_nonterminal4); procedure Evaluate(This : in Primary_Expr_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values); type Primary_Expr_nonterminal5 is new Primary_Expr_nonterminal with record Function_Call_part : Function_Call_nonterminal_Ptr; end record; procedure Pathify(This : in out Primary_Expr_nonterminal5); procedure Evaluate(This : in Primary_Expr_Nonterminal5; Context_Node : in Node_Items; Value : out Expression_Values); type Variable_Reference_nonterminal is new Parseable with record DOLLAR_part : Parseable_Token_Ptr; QName_part : QName_nonterminal_Ptr; end record; procedure Pathify(This : in out Variable_Reference_nonterminal); procedure Evaluate(This : in Variable_Reference_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); type Function_Call_nonterminal is new Parseable with record Function_Name_part : Function_Name_nonterminal_Ptr; L_PAREN_part : Parseable_Token_Ptr; Arguments_part : Arguments_nonterminal_Ptr; R_PAREN_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Function_Call_nonterminal); procedure Evaluate(This : in Function_Call_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); type Arguments_nonterminal is abstract new Parseable with null record; type Arguments_nonterminal1 is new Arguments_nonterminal with record null; end record; procedure Pathify(This : in out Arguments_nonterminal1); procedure Evaluate(This : in Arguments_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Arguments_nonterminal2 is new Arguments_nonterminal with record Argument_part : Argument_nonterminal_Ptr; end record; procedure Pathify(This : in out Arguments_nonterminal2); procedure Evaluate(This : in Arguments_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Arguments_nonterminal3 is new Arguments_nonterminal with record Arguments_part : Arguments_nonterminal_Ptr; COMMA_part : Parseable_Token_Ptr; Argument_part : Argument_nonterminal_Ptr; end record; procedure Pathify(This : in out Arguments_nonterminal3); procedure Evaluate(This : in Arguments_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Argument_nonterminal is new Parseable with record Expr_part : Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Argument_nonterminal); procedure Evaluate(This : in Argument_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); type Function_Name_nonterminal is new Parseable with record QName_part : QName_nonterminal_Ptr; end record; procedure Pathify(This : in out Function_Name_nonterminal); procedure Evaluate(This : in Function_Name_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); type Union_Expr_nonterminal is abstract new Parseable with null record; type Union_Expr_nonterminal1 is new Union_Expr_nonterminal with record Path_Expr_part : Path_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Union_Expr_nonterminal1); procedure Evaluate(This : in Union_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Union_Expr_nonterminal2 is new Union_Expr_nonterminal with record Union_Expr_part : Union_Expr_nonterminal_Ptr; V_BAR_part : Parseable_Token_Ptr; Path_Expr_part : Path_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Union_Expr_nonterminal2); procedure Evaluate(This : in Union_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Path_Expr_nonterminal is abstract new Parseable with null record; type Path_Expr_nonterminal1 is new Path_Expr_nonterminal with record Location_Path_part : Location_Path_nonterminal_Ptr; end record; procedure Pathify(This : in out Path_Expr_nonterminal1); procedure Evaluate(This : in Path_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Path_Expr_nonterminal2 is new Path_Expr_nonterminal with record Filter_Expr_part : Filter_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Path_Expr_nonterminal2); procedure Evaluate(This : in Path_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Path_Expr_nonterminal3 is new Path_Expr_nonterminal with record Filter_Expr_part : Filter_Expr_nonterminal_Ptr; SLASH_part : Parseable_Token_Ptr; Relative_Location_Path_part : Relative_Location_Path_nonterminal_Ptr; end record; procedure Pathify(This : in out Path_Expr_nonterminal3); procedure Evaluate(This : in Path_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Path_Expr_nonterminal4 is new Path_Expr_nonterminal with record Filter_Expr_part : Filter_Expr_nonterminal_Ptr; DOUBLE_SLASH_part : Parseable_Token_Ptr; Relative_Location_Path_part : Relative_Location_Path_nonterminal_Ptr; end record; procedure Pathify(This : in out Path_Expr_nonterminal4); procedure Evaluate(This : in Path_Expr_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values); type Filter_Expr_nonterminal is abstract new Parseable with null record; type Filter_Expr_nonterminal1 is new Filter_Expr_nonterminal with record Primary_Expr_part : Primary_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Filter_Expr_nonterminal1); procedure Evaluate(This : in Filter_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Filter_Expr_nonterminal2 is new Filter_Expr_nonterminal with record Filter_Expr_part : Filter_Expr_nonterminal_Ptr; Predicate_part : Predicate_nonterminal_Ptr; end record; procedure Pathify(This : in out Filter_Expr_nonterminal2); procedure Evaluate(This : in Filter_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Or_Expr_nonterminal is abstract new Parseable with null record; type Or_Expr_nonterminal1 is new Or_Expr_nonterminal with record And_Expr_part : And_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Or_Expr_nonterminal1); procedure Evaluate(This : in Or_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Or_Expr_nonterminal2 is new Or_Expr_nonterminal with record Or_Expr_part : Or_Expr_nonterminal_Ptr; OR_part : Parseable_Token_Ptr; And_Expr_part : And_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Or_Expr_nonterminal2); procedure Evaluate(This : in Or_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type And_Expr_nonterminal is abstract new Parseable with null record; type And_Expr_nonterminal1 is new And_Expr_nonterminal with record Equality_Expr_part : Equality_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out And_Expr_nonterminal1); procedure Evaluate(This : in And_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type And_Expr_nonterminal2 is new And_Expr_nonterminal with record And_Expr_part : And_Expr_nonterminal_Ptr; AND_part : Parseable_Token_Ptr; Equality_Expr_part : Equality_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out And_Expr_nonterminal2); procedure Evaluate(This : in And_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Equality_Expr_nonterminal is abstract new Parseable with null record; type Equality_Expr_nonterminal1 is new Equality_Expr_nonterminal with record Relational_Expr_part : Relational_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Equality_Expr_nonterminal1); procedure Evaluate(This : in Equality_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Equality_Expr_nonterminal2 is new Equality_Expr_nonterminal with record Equality_Expr_part : Equality_Expr_nonterminal_Ptr; EQ_part : Parseable_Token_Ptr; Relational_Expr_part : Relational_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Equality_Expr_nonterminal2); procedure Evaluate(This : in Equality_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Equality_Expr_nonterminal3 is new Equality_Expr_nonterminal with record Equality_Expr_part : Equality_Expr_nonterminal_Ptr; NE_part : Parseable_Token_Ptr; Relational_Expr_part : Relational_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Equality_Expr_nonterminal3); procedure Evaluate(This : in Equality_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Relational_Expr_nonterminal is abstract new Parseable with null record; type Relational_Expr_nonterminal1 is new Relational_Expr_nonterminal with record Additive_Expr_part : Additive_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Relational_Expr_nonterminal1); procedure Evaluate(This : in Relational_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Relational_Expr_nonterminal2 is new Relational_Expr_nonterminal with record Relational_Expr_part : Relational_Expr_nonterminal_Ptr; LT_part : Parseable_Token_Ptr; Additive_Expr_part : Additive_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Relational_Expr_nonterminal2); procedure Evaluate(This : in Relational_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Relational_Expr_nonterminal3 is new Relational_Expr_nonterminal with record Relational_Expr_part : Relational_Expr_nonterminal_Ptr; GT_part : Parseable_Token_Ptr; Additive_Expr_part : Additive_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Relational_Expr_nonterminal3); procedure Evaluate(This : in Relational_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Relational_Expr_nonterminal4 is new Relational_Expr_nonterminal with record Relational_Expr_part : Relational_Expr_nonterminal_Ptr; LE_part : Parseable_Token_Ptr; Additive_Expr_part : Additive_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Relational_Expr_nonterminal4); procedure Evaluate(This : in Relational_Expr_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values); type Relational_Expr_nonterminal5 is new Relational_Expr_nonterminal with record Relational_Expr_part : Relational_Expr_nonterminal_Ptr; GE_part : Parseable_Token_Ptr; Additive_Expr_part : Additive_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Relational_Expr_nonterminal5); procedure Evaluate(This : in Relational_Expr_Nonterminal5; Context_Node : in Node_Items; Value : out Expression_Values); type Additive_Expr_nonterminal is abstract new Parseable with null record; type Additive_Expr_nonterminal1 is new Additive_Expr_nonterminal with record Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Additive_Expr_nonterminal1); procedure Evaluate(This : in Additive_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Additive_Expr_nonterminal2 is new Additive_Expr_nonterminal with record Additive_Expr_part : Additive_Expr_nonterminal_Ptr; PLUS_part : Parseable_Token_Ptr; Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Additive_Expr_nonterminal2); procedure Evaluate(This : in Additive_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Additive_Expr_nonterminal3 is new Additive_Expr_nonterminal with record Additive_Expr_part : Additive_Expr_nonterminal_Ptr; MINUS_part : Parseable_Token_Ptr; Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Additive_Expr_nonterminal3); procedure Evaluate(This : in Additive_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Multiplicative_Expr_nonterminal is abstract new Parseable with null record; type Multiplicative_Expr_nonterminal1 is new Multiplicative_Expr_nonterminal with record Unary_Expr_part : Unary_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Multiplicative_Expr_nonterminal1); procedure Evaluate(This : in Multiplicative_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Multiplicative_Expr_nonterminal2 is new Multiplicative_Expr_nonterminal with record Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_Ptr; STAR_part : Parseable_Token_Ptr; Unary_Expr_part : Unary_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Multiplicative_Expr_nonterminal2); procedure Evaluate(This : in Multiplicative_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Multiplicative_Expr_nonterminal3 is new Multiplicative_Expr_nonterminal with record Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_Ptr; DIV_part : Parseable_Token_Ptr; Unary_Expr_part : Unary_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Multiplicative_Expr_nonterminal3); procedure Evaluate(This : in Multiplicative_Expr_Nonterminal3; Context_Node : in Node_Items; Value : out Expression_Values); type Multiplicative_Expr_nonterminal4 is new Multiplicative_Expr_nonterminal with record Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_Ptr; MOD_part : Parseable_Token_Ptr; Unary_Expr_part : Unary_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Multiplicative_Expr_nonterminal4); procedure Evaluate(This : in Multiplicative_Expr_Nonterminal4; Context_Node : in Node_Items; Value : out Expression_Values); type Unary_Expr_nonterminal is abstract new Parseable with null record; type Unary_Expr_nonterminal1 is new Unary_Expr_nonterminal with record Union_Expr_part : Union_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Unary_Expr_nonterminal1); procedure Evaluate(This : in Unary_Expr_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Unary_Expr_nonterminal2 is new Unary_Expr_nonterminal with record MINUS_part : Parseable_Token_Ptr; Unary_Expr_part : Unary_Expr_nonterminal_Ptr; end record; procedure Pathify(This : in out Unary_Expr_nonterminal2); procedure Evaluate(This : in Unary_Expr_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Number_nonterminal is abstract new Parseable with null record; type Number_nonterminal1 is new Number_nonterminal with record INTEGER_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Number_nonterminal1); procedure Evaluate(This : in Number_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Number_nonterminal2 is new Number_nonterminal with record DECIMAL_LITERAL_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Number_nonterminal2); procedure Evaluate(This : in Number_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); type Literal_nonterminal is abstract new Parseable with null record; type Literal_nonterminal1 is new Literal_nonterminal with record DQ_LITERAL_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Literal_nonterminal1); procedure Evaluate(This : in Literal_Nonterminal1; Context_Node : in Node_Items; Value : out Expression_Values); type Literal_nonterminal2 is new Literal_nonterminal with record SQ_LITERAL_part : Parseable_Token_Ptr; end record; procedure Pathify(This : in out Literal_nonterminal2); procedure Evaluate(This : in Literal_Nonterminal2; Context_Node : in Node_Items; Value : out Expression_Values); procedure Reset; end xia_parser_Model; xia-1.00/xia_parser_parser.adb0100666000076600007670000013515210212334121015257 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Text_IO; use Text_IO; with xia_parser; use xia_parser; with xia_parser_Goto; use xia_parser_Goto; with xia_parser_Shift_Reduce; use xia_parser_Shift_Reduce; with xia_parser_Tokens; use xia_parser_Tokens; package body xia_parser_Parser is package Language_YY2_Lexical_Analyzer renames xia_parser; use Language_YY2_Lexical_Analyzer; Parse_Tree : Parseable_Ptr; Token_String : String_Ptr; procedure YYError(S : in String := "Syntax Error") is begin pragma Debug(Put_Line("Syntax error on line " & Natural'image(xia_parser.Get_Current_Line) & ", column" & Natural'Image(Xia_Parser.Get_Current_Column))); raise Syntax_Error; end YYError; procedure YYParse is -- Rename User Defined Packages to Internal Names. package yy_goto_tables renames Xia_Parser_Goto; package yy_shift_reduce_tables renames Xia_Parser_Shift_Reduce; package yy_tokens renames Xia_Parser_Tokens; package yy2_tokens renames Language_YY2_Lexical_Analyzer; use yy2_tokens; use yy_tokens, yy_goto_tables, yy_shift_reduce_tables; procedure yyerrok; procedure yyclearin; package yy is -- the size of the value and state stacks stack_size : constant Natural := 300; -- subtype rule is natural; subtype parse_state is natural; -- subtype nonterminal is integer; -- encryption constants default : constant := -1; first_shift_entry : constant := 0; accept_code : constant := -3001; error_code : constant := -3000; -- stack data used by the parser tos : natural := 0; value_stack : array(0..stack_size) of yy_tokens.yystype; state_stack : array(0..stack_size) of parse_state; -- current input symbol and action the parser is on action : integer; rule_id : rule; input_symbol : yy2_tokens.token; -- error recovery flag error_flag : natural := 0; -- indicates 3 - (number of valid shifts after an error occurs) look_ahead : boolean := true; index : integer; -- Is Debugging option on or off DEBUG : constant boolean := FALSE; -- DEBUG : constant boolean := TRUE; end yy; function goto_state (state : yy.parse_state; sym : nonterminal) return yy.parse_state; function parse_action (state : yy.parse_state; t : yy2_tokens.token) return integer; pragma inline(goto_state, parse_action); function goto_state(state : yy.parse_state; sym : nonterminal) return yy.parse_state is index : integer; begin index := goto_offset(state); while integer(goto_matrix(index).nonterm) /= sym loop index := index + 1; end loop; return integer(goto_matrix(index).newstate); end goto_state; function parse_action(state : yy.parse_state; t : yy2_tokens.token) return integer is index : integer; tok_pos : integer; default : constant integer := -1; begin tok_pos := yy2_tokens.token'pos(t); index := shift_reduce_offset(state); while integer(shift_reduce_matrix(index).t) /= tok_pos and then integer(shift_reduce_matrix(index).t) /= default loop index := index + 1; end loop; return integer(shift_reduce_matrix(index).act); end parse_action; -- error recovery stuff procedure handle_error is temp_action : integer; begin if yy.error_flag = 3 then -- no shift yet, clobber input. if yy.debug then text_io.put_line("Ayacc.YYParse: Error Recovery Clobbers " & yy2_tokens.token'image(yy.input_symbol)); end if; if yy.input_symbol = yy2_tokens.end_of_input then -- don't discard, if yy.debug then text_io.put_line("Ayacc.YYParse: Can't discard END_OF_INPUT, quiting..."); end if; raise yy_tokens.syntax_error; end if; yy.look_ahead := true; -- get next token return; -- and try again... end if; if yy.error_flag = 0 then -- brand new error yyerror("Syntax Error"); end if; yy.error_flag := 3; -- find state on stack where error is a valid shift -- if yy.debug then text_io.put_line("Ayacc.YYParse: Looking for state with error as valid shift"); end if; loop if yy.debug then text_io.put_line("Ayacc.YYParse: Examining State " & yy.parse_state'image(yy.state_stack(yy.tos))); end if; temp_action := parse_action(yy.state_stack(yy.tos), error); if temp_action >= yy.first_shift_entry then if yy.tos = yy.stack_size then text_io.put_line(" Stack size exceeded on state_stack"); raise yy_Tokens.syntax_error; end if; yy.tos := yy.tos + 1; yy.state_stack(yy.tos) := temp_action; exit; end if; Decrement_Stack_Pointer : begin yy.tos := yy.tos - 1; exception when Constraint_Error => yy.tos := 0; end Decrement_Stack_Pointer; if yy.tos = 0 then if yy.debug then text_io.put_line("Ayacc.YYParse: Error recovery popped entire stack, aborting..."); end if; raise yy_tokens.syntax_error; end if; end loop; if yy.debug then text_io.put_line("Ayacc.YYParse: Shifted error token in state " & yy.parse_state'image(yy.state_stack(yy.tos))); end if; end handle_error; -- print debugging information for a shift operation procedure shift_debug(state_id: yy.parse_state; lexeme: yy2_tokens.token) is begin text_io.put_line("Ayacc.YYParse: Shift "& yy.parse_state'image(state_id)&" on input symbol "& yy2_tokens.token'image(lexeme) ); end; -- print debugging information for a reduce operation procedure reduce_debug(rule_id: rule; state_id: yy.parse_state) is begin text_io.put_line("Ayacc.YYParse: Reduce by rule "&rule'image(rule_id)&" goto state "& yy.parse_state'image(state_id)); end; -- make the parser believe that 3 valid shifts have occured. -- used for error recovery. procedure yyerrok is begin yy.error_flag := 0; end yyerrok; -- called to clear input symbol that caused an error. procedure yyclearin is begin -- yy.input_symbol := Get_Token; yy.look_ahead := true; end yyclearin; begin -- initialize by pushing state 0 and getting the first input symbol yy.state_stack(yy.tos) := 0; loop yy.index := shift_reduce_offset(yy.state_stack(yy.tos)); if integer(shift_reduce_matrix(yy.index).t) = yy.default then yy.action := integer(shift_reduce_matrix(yy.index).act); else if yy.look_ahead then yy.look_ahead := false; yy.input_symbol := Get_Token; end if; yy.action := parse_action(yy.state_stack(yy.tos), yy.input_symbol); end if; if yy.action >= yy.first_shift_entry then -- SHIFT if yy.debug then shift_debug(yy.action, yy.input_symbol); end if; -- Enter new state if yy.tos = yy.stack_size then text_io.put_line(" Stack size exceeded on state_stack"); raise yy_Tokens.syntax_error; end if; yy.tos := yy.tos + 1; yy.state_stack(yy.tos) := yy.action; yy.value_stack(yy.tos) := yylval; if yy.error_flag > 0 then -- indicate a valid shift yy.error_flag := yy.error_flag - 1; end if; -- Advance lookahead yy.look_ahead := true; elsif yy.action = yy.error_code then -- ERROR handle_error; elsif yy.action = yy.accept_code then if yy.debug then text_io.put_line("Ayacc.YYParse: Accepting Grammar..."); end if; exit; else -- Reduce Action -- Convert action into a rule yy.rule_id := -1 * yy.action; -- Execute User Action -- user_action(yy.rule_id); case yy.rule_id is when 1 => --#line 70 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,NCNAME_token); when 2 => --#line 74 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DECIMAL_LITERAL_token); when 3 => --#line 78 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,INTEGER_token); when 4 => --#line 82 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DQ_LITERAL_token); when 5 => --#line 86 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,SQ_LITERAL_token); when 6 => --#line 90 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,LE_token); when 7 => --#line 94 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,LT_token); when 8 => --#line 98 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,GE_token); when 9 => --#line 102 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,GT_token); when 10 => --#line 106 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,NE_token); when 11 => --#line 110 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,EQ_token); when 12 => --#line 114 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,V_BAR_token); when 13 => --#line 118 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DOLLAR_token); when 14 => --#line 122 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,COMMA_token); when 15 => --#line 126 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,AT_SIGN_token); when 16 => --#line 130 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DOUBLE_COLON_token); when 17 => --#line 134 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,COLON_token); when 18 => --#line 138 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DOUBLE_SLASH_token); when 19 => --#line 142 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,SLASH_token); when 20 => --#line 146 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DOUBLE_DOT_token); when 21 => --#line 150 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DOT_token); when 22 => --#line 154 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,MINUS_token); when 23 => --#line 158 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,PLUS_token); when 24 => --#line 162 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,STAR_token); when 25 => --#line 166 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,R_BRACKET_token); when 26 => --#line 170 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,L_BRACKET_token); when 27 => --#line 174 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,R_PAREN_token); when 28 => --#line 178 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,L_PAREN_token); when 29 => --#line 182 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,OR_token); when 30 => --#line 186 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,MOD_token); when 31 => --#line 190 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DIV_token); when 32 => --#line 194 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,AND_token); when 33 => --#line 198 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,NODE_token); when 34 => --#line 202 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,PROCESSING_INSTRUCTION_token); when 35 => --#line 206 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,TEXT_token); when 36 => --#line 210 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,COMMENT_token); when 37 => --#line 214 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,SELF_token); when 38 => --#line 218 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,PRECEDING_SIBLING_token); when 39 => --#line 222 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,PRECEDING_token); when 40 => --#line 226 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,PARENT_token); when 41 => --#line 230 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,NAMESPACE_token); when 42 => --#line 234 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,FOLLOWING_SIBLING_token); when 43 => --#line 238 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,FOLLOWING_token); when 44 => --#line 242 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DESCENDANT_OR_SELF_token); when 45 => --#line 246 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,DESCENDANT_token); when 46 => --#line 250 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,CHILD_token); when 47 => --#line 254 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,ATTRIBUTE_token); when 48 => --#line 258 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,ANCESTOR_OR_SELF_token); when 49 => --#line 262 Token_String := new String'(Get_Token_String); yyval := new Parseable_Token'(Get_Current_Line,Get_Current_Column-Token_String.all'Length, Token_String,ANCESTOR_token); when 50 => --#line 267 Parse_Tree := yy.value_stack(yy.tos); when 51 => --#line 270 yyval := new Location_Path_nonterminal1; Location_Path_nonterminal1( yyval.all).Relative_Location_Path_part := Relative_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 52 => --#line 274 yyval := new Location_Path_nonterminal2; Location_Path_nonterminal2( yyval.all).Absolute_Location_Path_part := Absolute_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 53 => --#line 280 yyval := new Absolute_Location_Path_nonterminal1; Absolute_Location_Path_nonterminal1( yyval.all).SLASH_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 54 => --#line 284 yyval := new Absolute_Location_Path_nonterminal2; Absolute_Location_Path_nonterminal2( yyval.all).SLASH_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Absolute_Location_Path_nonterminal2( yyval.all).Relative_Location_Path_part := Relative_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 55 => --#line 289 yyval := new Absolute_Location_Path_nonterminal3; Absolute_Location_Path_nonterminal3( yyval.all).Abbreviated_Absolute_Location_Path_part := Abbreviated_Absolute_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 56 => --#line 295 yyval := new Relative_Location_Path_nonterminal1; Relative_Location_Path_nonterminal1( yyval.all).Step_part := Step_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 57 => --#line 299 yyval := new Relative_Location_Path_nonterminal2; Relative_Location_Path_nonterminal2( yyval.all).Relative_Location_Path_part := Relative_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Relative_Location_Path_nonterminal2( yyval.all).SLASH_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Relative_Location_Path_nonterminal2( yyval.all).Step_part := Step_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 58 => --#line 305 yyval := new Relative_Location_Path_nonterminal3; Relative_Location_Path_nonterminal3( yyval.all).Abbreviated_Relative_Location_Path_part := Abbreviated_Relative_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 59 => --#line 311 yyval := new Step_nonterminal1; Step_nonterminal1( yyval.all).Step_Base_part := Step_Base_Nonterminal_Ptr( yy.value_stack(yy.tos-1)); Step_nonterminal1( yyval.all).Predicates_part := Predicates_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 60 => --#line 316 yyval := new Step_nonterminal2; Step_nonterminal2( yyval.all).Abbreviated_Step_part := Abbreviated_Step_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 61 => --#line 322 yyval := new Predicates_nonterminal1; when 62 => --#line 325 yyval := new Predicates_nonterminal2; Predicates_nonterminal2( yyval.all).Predicates_part := Predicates_Nonterminal_Ptr( yy.value_stack(yy.tos-1)); Predicates_nonterminal2( yyval.all).Predicate_part := Predicate_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 63 => --#line 332 yyval := new Step_Base_nonterminal1; Step_Base_nonterminal1( yyval.all).Axis_Specifier_part := Axis_Specifier_Nonterminal_Ptr( yy.value_stack(yy.tos-1)); Step_Base_nonterminal1( yyval.all).Node_Test_part := Node_Test_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 64 => --#line 337 yyval := new Step_Base_nonterminal2; Step_Base_nonterminal2( yyval.all).Abbreviated_Step_Base_part := Abbreviated_Step_Base_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 65 => --#line 343 yyval := new Abbreviated_Step_Base_nonterminal1; Abbreviated_Step_Base_nonterminal1( yyval.all).Node_Test_part := Node_Test_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 66 => --#line 347 yyval := new Abbreviated_Step_Base_nonterminal2; Abbreviated_Step_Base_nonterminal2( yyval.all).AT_SIGN_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Abbreviated_Step_Base_nonterminal2( yyval.all).Node_Test_part := Node_Test_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 67 => --#line 354 yyval := new Predicate_nonterminal; Predicate_nonterminal( yyval.all).L_BRACKET_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-2)); Predicate_nonterminal( yyval.all).Predicate_Expr_part := Predicate_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-1)); Predicate_nonterminal( yyval.all).R_BRACKET_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 68 => --#line 362 yyval := new Axis_Specifier_nonterminal; Axis_Specifier_nonterminal( yyval.all).Axis_Name_part := Axis_Name_Nonterminal_Ptr( yy.value_stack(yy.tos-1)); Axis_Specifier_nonterminal( yyval.all).DOUBLE_COLON_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 69 => --#line 369 yyval := new Axis_Name_nonterminal1; Axis_Name_nonterminal1( yyval.all).ANCESTOR_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 70 => --#line 373 yyval := new Axis_Name_nonterminal2; Axis_Name_nonterminal2( yyval.all).ANCESTOR_OR_SELF_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 71 => --#line 377 yyval := new Axis_Name_nonterminal3; Axis_Name_nonterminal3( yyval.all).ATTRIBUTE_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 72 => --#line 381 yyval := new Axis_Name_nonterminal4; Axis_Name_nonterminal4( yyval.all).CHILD_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 73 => --#line 385 yyval := new Axis_Name_nonterminal5; Axis_Name_nonterminal5( yyval.all).DESCENDANT_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 74 => --#line 389 yyval := new Axis_Name_nonterminal6; Axis_Name_nonterminal6( yyval.all).DESCENDANT_OR_SELF_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 75 => --#line 393 yyval := new Axis_Name_nonterminal7; Axis_Name_nonterminal7( yyval.all).FOLLOWING_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 76 => --#line 397 yyval := new Axis_Name_nonterminal8; Axis_Name_nonterminal8( yyval.all).FOLLOWING_SIBLING_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 77 => --#line 401 yyval := new Axis_Name_nonterminal9; Axis_Name_nonterminal9( yyval.all).NAMESPACE_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 78 => --#line 405 yyval := new Axis_Name_nonterminal10; Axis_Name_nonterminal10( yyval.all).PARENT_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 79 => --#line 409 yyval := new Axis_Name_nonterminal11; Axis_Name_nonterminal11( yyval.all).PRECEDING_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 80 => --#line 413 yyval := new Axis_Name_nonterminal12; Axis_Name_nonterminal12( yyval.all).PRECEDING_SIBLING_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 81 => --#line 417 yyval := new Axis_Name_nonterminal13; Axis_Name_nonterminal13( yyval.all).SELF_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 82 => --#line 423 yyval := new Node_Test_nonterminal1; Node_Test_nonterminal1( yyval.all).Name_Test_part := Name_Test_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 83 => --#line 427 yyval := new Node_Test_nonterminal2; Node_Test_nonterminal2( yyval.all).Node_Type_part := Node_Type_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Node_Test_nonterminal2( yyval.all).L_PAREN_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Node_Test_nonterminal2( yyval.all).R_PAREN_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 84 => --#line 433 yyval := new Node_Test_nonterminal3; Node_Test_nonterminal3( yyval.all).PROCESSING_INSTRUCTION_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-3)); Node_Test_nonterminal3( yyval.all).L_PAREN_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-2)); Node_Test_nonterminal3( yyval.all).LITERAL_part := LITERAL_Nonterminal_Ptr( yy.value_stack(yy.tos-1)); Node_Test_nonterminal3( yyval.all).R_PAREN_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 85 => --#line 442 yyval := new Node_Type_nonterminal1; Node_Type_nonterminal1( yyval.all).COMMENT_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 86 => --#line 446 yyval := new Node_Type_nonterminal2; Node_Type_nonterminal2( yyval.all).TEXT_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 87 => --#line 450 yyval := new Node_Type_nonterminal3; Node_Type_nonterminal3( yyval.all).PROCESSING_INSTRUCTION_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 88 => --#line 454 yyval := new Node_Type_nonterminal4; Node_Type_nonterminal4( yyval.all).NODE_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 89 => --#line 460 yyval := new Name_Test_nonterminal1; Name_Test_nonterminal1( yyval.all).STAR_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 90 => --#line 464 yyval := new Name_Test_nonterminal2; Name_Test_nonterminal2( yyval.all).QName_part := QName_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 91 => --#line 468 yyval := new Name_Test_nonterminal3; Name_Test_nonterminal3( yyval.all).NCNAME_Or_ID_part := NCNAME_Or_ID_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Name_Test_nonterminal3( yyval.all).COLON_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Name_Test_nonterminal3( yyval.all).STAR_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 92 => --#line 476 yyval := new QName_nonterminal1; QName_nonterminal1( yyval.all).NCNAME_Or_ID_part := NCNAME_Or_ID_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 93 => --#line 480 yyval := new QName_nonterminal2; QName_nonterminal2( yyval.all).NCNAME_Or_ID_part1 := NCNAME_Or_ID_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); QName_nonterminal2( yyval.all).COLON_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); QName_nonterminal2( yyval.all).NCNAME_Or_ID_part2 := NCNAME_Or_ID_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 94 => --#line 488 yyval := new NCNAME_Or_ID_nonterminal1; NCNAME_Or_ID_nonterminal1( yyval.all).NCNAME_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 95 => --#line 492 yyval := new NCNAME_Or_ID_nonterminal2; NCNAME_Or_ID_nonterminal2( yyval.all).Axis_Name_part := Axis_Name_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 96 => --#line 496 yyval := new NCNAME_Or_ID_nonterminal3; NCNAME_Or_ID_nonterminal3( yyval.all).Node_Type_part := Node_Type_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 97 => --#line 500 yyval := new NCNAME_Or_ID_nonterminal4; NCNAME_Or_ID_nonterminal4( yyval.all).AND_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 98 => --#line 504 yyval := new NCNAME_Or_ID_nonterminal5; NCNAME_Or_ID_nonterminal5( yyval.all).OR_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 99 => --#line 508 yyval := new NCNAME_Or_ID_nonterminal6; NCNAME_Or_ID_nonterminal6( yyval.all).MOD_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 100 => --#line 512 yyval := new NCNAME_Or_ID_nonterminal7; NCNAME_Or_ID_nonterminal7( yyval.all).DIV_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 101 => --#line 518 yyval := new Predicate_Expr_nonterminal; Predicate_Expr_nonterminal( yyval.all).Expr_part := Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 102 => --#line 524 yyval := new Abbreviated_Absolute_Location_Path_nonterminal; Abbreviated_Absolute_Location_Path_nonterminal( yyval.all).DOUBLE_SLASH_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Abbreviated_Absolute_Location_Path_nonterminal( yyval.all).Relative_Location_Path_part := Relative_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 103 => --#line 531 yyval := new Abbreviated_Relative_Location_Path_nonterminal; Abbreviated_Relative_Location_Path_nonterminal( yyval.all).Relative_Location_Path_part := Relative_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Abbreviated_Relative_Location_Path_nonterminal( yyval.all).DOUBLE_SLASH_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Abbreviated_Relative_Location_Path_nonterminal( yyval.all).Step_part := Step_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 104 => --#line 539 yyval := new Abbreviated_Step_nonterminal1; Abbreviated_Step_nonterminal1( yyval.all).DOT_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 105 => --#line 543 yyval := new Abbreviated_Step_nonterminal2; Abbreviated_Step_nonterminal2( yyval.all).DOUBLE_DOT_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 106 => --#line 549 yyval := new Expr_nonterminal; Expr_nonterminal( yyval.all).Or_Expr_part := Or_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 107 => --#line 555 yyval := new Primary_Expr_nonterminal1; Primary_Expr_nonterminal1( yyval.all).Variable_Reference_part := Variable_Reference_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 108 => --#line 559 yyval := new Primary_Expr_nonterminal2; Primary_Expr_nonterminal2( yyval.all).L_PAREN_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-2)); Primary_Expr_nonterminal2( yyval.all).Expr_part := Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-1)); Primary_Expr_nonterminal2( yyval.all).R_PAREN_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 109 => --#line 565 yyval := new Primary_Expr_nonterminal3; Primary_Expr_nonterminal3( yyval.all).LITERAL_part := LITERAL_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 110 => --#line 569 yyval := new Primary_Expr_nonterminal4; Primary_Expr_nonterminal4( yyval.all).Number_part := Number_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 111 => --#line 573 yyval := new Primary_Expr_nonterminal5; Primary_Expr_nonterminal5( yyval.all).Function_Call_part := Function_Call_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 112 => --#line 579 yyval := new Variable_Reference_nonterminal; Variable_Reference_nonterminal( yyval.all).DOLLAR_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Variable_Reference_nonterminal( yyval.all).QName_part := QName_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 113 => --#line 586 yyval := new Function_Call_nonterminal; Function_Call_nonterminal( yyval.all).Function_Name_part := Function_Name_Nonterminal_Ptr( yy.value_stack(yy.tos-3)); Function_Call_nonterminal( yyval.all).L_PAREN_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-2)); Function_Call_nonterminal( yyval.all).Arguments_part := Arguments_Nonterminal_Ptr( yy.value_stack(yy.tos-1)); Function_Call_nonterminal( yyval.all).R_PAREN_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 114 => --#line 595 yyval := new Arguments_nonterminal1; when 115 => --#line 598 yyval := new Arguments_nonterminal2; Arguments_nonterminal2( yyval.all).Argument_part := Argument_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 116 => --#line 602 yyval := new Arguments_nonterminal3; Arguments_nonterminal3( yyval.all).Arguments_part := Arguments_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Arguments_nonterminal3( yyval.all).COMMA_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Arguments_nonterminal3( yyval.all).Argument_part := Argument_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 117 => --#line 610 yyval := new Argument_nonterminal; Argument_nonterminal( yyval.all).Expr_part := Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 118 => --#line 616 yyval := new Function_Name_nonterminal; Function_Name_nonterminal( yyval.all).QName_part := QName_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 119 => --#line 622 yyval := new Union_Expr_nonterminal1; Union_Expr_nonterminal1( yyval.all).Path_Expr_part := Path_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 120 => --#line 626 yyval := new Union_Expr_nonterminal2; Union_Expr_nonterminal2( yyval.all).Union_Expr_part := Union_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Union_Expr_nonterminal2( yyval.all).V_BAR_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Union_Expr_nonterminal2( yyval.all).Path_Expr_part := Path_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 121 => --#line 634 yyval := new Path_Expr_nonterminal1; Path_Expr_nonterminal1( yyval.all).Location_Path_part := Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 122 => --#line 638 yyval := new Path_Expr_nonterminal2; Path_Expr_nonterminal2( yyval.all).Filter_Expr_part := Filter_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 123 => --#line 642 yyval := new Path_Expr_nonterminal3; Path_Expr_nonterminal3( yyval.all).Filter_Expr_part := Filter_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Path_Expr_nonterminal3( yyval.all).SLASH_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Path_Expr_nonterminal3( yyval.all).Relative_Location_Path_part := Relative_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 124 => --#line 648 yyval := new Path_Expr_nonterminal4; Path_Expr_nonterminal4( yyval.all).Filter_Expr_part := Filter_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Path_Expr_nonterminal4( yyval.all).DOUBLE_SLASH_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Path_Expr_nonterminal4( yyval.all).Relative_Location_Path_part := Relative_Location_Path_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 125 => --#line 656 yyval := new Filter_Expr_nonterminal1; Filter_Expr_nonterminal1( yyval.all).Primary_Expr_part := Primary_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 126 => --#line 660 yyval := new Filter_Expr_nonterminal2; Filter_Expr_nonterminal2( yyval.all).Filter_Expr_part := Filter_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-1)); Filter_Expr_nonterminal2( yyval.all).Predicate_part := Predicate_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 127 => --#line 667 yyval := new Or_Expr_nonterminal1; Or_Expr_nonterminal1( yyval.all).And_Expr_part := And_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 128 => --#line 671 yyval := new Or_Expr_nonterminal2; Or_Expr_nonterminal2( yyval.all).Or_Expr_part := Or_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Or_Expr_nonterminal2( yyval.all).OR_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Or_Expr_nonterminal2( yyval.all).And_Expr_part := And_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 129 => --#line 679 yyval := new And_Expr_nonterminal1; And_Expr_nonterminal1( yyval.all).Equality_Expr_part := Equality_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 130 => --#line 683 yyval := new And_Expr_nonterminal2; And_Expr_nonterminal2( yyval.all).And_Expr_part := And_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); And_Expr_nonterminal2( yyval.all).AND_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); And_Expr_nonterminal2( yyval.all).Equality_Expr_part := Equality_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 131 => --#line 691 yyval := new Equality_Expr_nonterminal1; Equality_Expr_nonterminal1( yyval.all).Relational_Expr_part := Relational_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 132 => --#line 695 yyval := new Equality_Expr_nonterminal2; Equality_Expr_nonterminal2( yyval.all).Equality_Expr_part := Equality_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Equality_Expr_nonterminal2( yyval.all).EQ_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Equality_Expr_nonterminal2( yyval.all).Relational_Expr_part := Relational_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 133 => --#line 701 yyval := new Equality_Expr_nonterminal3; Equality_Expr_nonterminal3( yyval.all).Equality_Expr_part := Equality_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Equality_Expr_nonterminal3( yyval.all).NE_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Equality_Expr_nonterminal3( yyval.all).Relational_Expr_part := Relational_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 134 => --#line 709 yyval := new Relational_Expr_nonterminal1; Relational_Expr_nonterminal1( yyval.all).Additive_Expr_part := Additive_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 135 => --#line 713 yyval := new Relational_Expr_nonterminal2; Relational_Expr_nonterminal2( yyval.all).Relational_Expr_part := Relational_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Relational_Expr_nonterminal2( yyval.all).LT_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Relational_Expr_nonterminal2( yyval.all).Additive_Expr_part := Additive_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 136 => --#line 719 yyval := new Relational_Expr_nonterminal3; Relational_Expr_nonterminal3( yyval.all).Relational_Expr_part := Relational_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Relational_Expr_nonterminal3( yyval.all).GT_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Relational_Expr_nonterminal3( yyval.all).Additive_Expr_part := Additive_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 137 => --#line 725 yyval := new Relational_Expr_nonterminal4; Relational_Expr_nonterminal4( yyval.all).Relational_Expr_part := Relational_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Relational_Expr_nonterminal4( yyval.all).LE_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Relational_Expr_nonterminal4( yyval.all).Additive_Expr_part := Additive_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 138 => --#line 731 yyval := new Relational_Expr_nonterminal5; Relational_Expr_nonterminal5( yyval.all).Relational_Expr_part := Relational_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Relational_Expr_nonterminal5( yyval.all).GE_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Relational_Expr_nonterminal5( yyval.all).Additive_Expr_part := Additive_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 139 => --#line 739 yyval := new Additive_Expr_nonterminal1; Additive_Expr_nonterminal1( yyval.all).Multiplicative_Expr_part := Multiplicative_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 140 => --#line 743 yyval := new Additive_Expr_nonterminal2; Additive_Expr_nonterminal2( yyval.all).Additive_Expr_part := Additive_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Additive_Expr_nonterminal2( yyval.all).PLUS_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Additive_Expr_nonterminal2( yyval.all).Multiplicative_Expr_part := Multiplicative_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 141 => --#line 749 yyval := new Additive_Expr_nonterminal3; Additive_Expr_nonterminal3( yyval.all).Additive_Expr_part := Additive_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Additive_Expr_nonterminal3( yyval.all).MINUS_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Additive_Expr_nonterminal3( yyval.all).Multiplicative_Expr_part := Multiplicative_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 142 => --#line 757 yyval := new Multiplicative_Expr_nonterminal1; Multiplicative_Expr_nonterminal1( yyval.all).Unary_Expr_part := Unary_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 143 => --#line 761 yyval := new Multiplicative_Expr_nonterminal2; Multiplicative_Expr_nonterminal2( yyval.all).Multiplicative_Expr_part := Multiplicative_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Multiplicative_Expr_nonterminal2( yyval.all).STAR_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Multiplicative_Expr_nonterminal2( yyval.all).Unary_Expr_part := Unary_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 144 => --#line 767 yyval := new Multiplicative_Expr_nonterminal3; Multiplicative_Expr_nonterminal3( yyval.all).Multiplicative_Expr_part := Multiplicative_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Multiplicative_Expr_nonterminal3( yyval.all).DIV_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Multiplicative_Expr_nonterminal3( yyval.all).Unary_Expr_part := Unary_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 145 => --#line 773 yyval := new Multiplicative_Expr_nonterminal4; Multiplicative_Expr_nonterminal4( yyval.all).Multiplicative_Expr_part := Multiplicative_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos-2)); Multiplicative_Expr_nonterminal4( yyval.all).MOD_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Multiplicative_Expr_nonterminal4( yyval.all).Unary_Expr_part := Unary_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 146 => --#line 781 yyval := new Unary_Expr_nonterminal1; Unary_Expr_nonterminal1( yyval.all).Union_Expr_part := Union_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 147 => --#line 785 yyval := new Unary_Expr_nonterminal2; Unary_Expr_nonterminal2( yyval.all).MINUS_part := Parseable_Token_Ptr( yy.value_stack(yy.tos-1)); Unary_Expr_nonterminal2( yyval.all).Unary_Expr_part := Unary_Expr_Nonterminal_Ptr( yy.value_stack(yy.tos)); when 148 => --#line 792 yyval := new Number_nonterminal1; Number_nonterminal1( yyval.all).INTEGER_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 149 => --#line 796 yyval := new Number_nonterminal2; Number_nonterminal2( yyval.all).DECIMAL_LITERAL_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 150 => --#line 802 yyval := new Literal_nonterminal1; Literal_nonterminal1( yyval.all).DQ_LITERAL_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when 151 => --#line 806 yyval := new Literal_nonterminal2; Literal_nonterminal2( yyval.all).SQ_LITERAL_part := Parseable_Token_Ptr( yy.value_stack(yy.tos)); when others => null; end case; -- Pop RHS states and goto next state yy.tos := yy.tos - rule_length(yy.rule_id) + 1; if yy.tos > yy.stack_size then text_io.put_line(" Stack size exceeded on state_stack"); raise yy_Tokens.syntax_error; end if; yy.state_stack(yy.tos) := goto_state(yy.state_stack(yy.tos-1) , get_lhs_rule(yy.rule_id)); yy.value_stack(yy.tos) := yyval; if yy.debug then reduce_debug(yy.rule_id, goto_state(yy.state_stack(yy.tos - 1), get_lhs_rule(yy.rule_id))); end if; end if; end loop; end yyparse; procedure Run(Set_String : in String) is begin xia_parser.Reset(Set_String); begin YYParse; exception when others => xia_parser.Close_Files; raise; end; xia_parser.Close_Files; end Run; function Get_Parse_Tree return Parseable_Ptr is begin return Parse_Tree; end Get_Parse_Tree; end xia_parser_Parser; xia-1.00/xia_parser_parser.ads0100666000076600007670000000444010212334121015273 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with xia_parser_Model; use xia_parser_Model; package xia_parser_Parser is procedure Run(Set_String : in String); function Get_Parse_Tree return Parseable_Ptr; Syntax_Error : exception; end xia_parser_Parser; xia-1.00/xia_parser_shift_reduce.ads0100666000076600007670000004504510212334121016451 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ package Xia_Parser_Shift_Reduce is type Small_Integer is range -32_000 .. 32_000; type Shift_Reduce_Entry is record T : Small_Integer; Act : Small_Integer; end record; pragma Pack(Shift_Reduce_Entry); subtype Row is Integer range -1 .. Integer'Last; --pragma suppress(index_check); type Shift_Reduce_Array is array (Row range <>) of Shift_Reduce_Entry; Shift_Reduce_Matrix : constant Shift_Reduce_Array := ( (-1,-1) -- Dummy Entry -- state 0 ,( 2, 68),( 16, 38),( 19, 16),( 20, 10) ,( 21, 21),( 22, 20),( 25, 59),( 30, 70) ,( 31, 71),( 32, 72),( 33, 69),( 34, 67) ,( 35, 58),( 36, 66),( 37, 65),( 38, 51) ,( 39, 50),( 40, 49),( 41, 48),( 42, 47) ,( 43, 46),( 44, 45),( 45, 44),( 46, 43) ,( 47, 42),( 48, 41),( 49, 40),( 50, 39) ,(-1,-3000) -- state 1 ,(-1,-50) -- state 2 ,( 19, 16),( 20, 10) ,(-1,-51) -- state 3 ,(-1,-52) -- state 4 ,(-1,-56) -- state 5 ,(-1,-58) -- state 6 ,( 2, 68),( 16, 38),( 21, 21),( 22, 20) ,( 25, 59),( 30, 70),( 31, 71),( 32, 72) ,( 33, 69),( 34, 67),( 35, 58),( 36, 66) ,( 37, 65),( 38, 51),( 39, 50),( 40, 49) ,( 41, 48),( 42, 47),( 43, 46),( 44, 45) ,( 45, 44),( 46, 43),( 47, 42),( 48, 41) ,( 49, 40),( 50, 39),(-1,-53) -- state 7 ,(-1,-55) -- state 8 ,(-1,-61) -- state 9 ,(-1,-60) -- state 10 ,(-1,-19) -- state 11 ,( 2, 68) ,( 16, 38),( 21, 21),( 22, 20),( 25, 59) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 12 ,( 2, 68),( 25, 59) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 13 ,(-1,-64) -- state 14 ,(-1,-104) -- state 15 ,(-1,-105) -- state 16 ,(-1,-18) -- state 17 ,( 17, 81),(-1,-95) -- state 18 ,(-1,-65) -- state 19 ,( 2, 68),( 25, 59),( 30, 70) ,( 31, 71),( 32, 72),( 33, 69),( 34, 67) ,( 35, 58),( 36, 66),( 37, 65),( 38, 51) ,( 39, 50),( 40, 49),( 41, 48),( 42, 47) ,( 43, 46),( 44, 45),( 45, 44),( 46, 43) ,( 47, 42),( 48, 41),( 49, 40),( 50, 39) ,(-1,-3000) -- state 20 ,(-1,-21) -- state 21 ,(-1,-20) -- state 22 ,(-1,-69) -- state 23 ,(-1,-70) -- state 24 ,(-1,-71) -- state 25 ,(-1,-72) -- state 26 ,(-1,-73) -- state 27 ,(-1,-74) -- state 28 ,(-1,-75) -- state 29 ,(-1,-76) -- state 30 ,(-1,-77) -- state 31 ,(-1,-78) -- state 32 ,(-1,-79) -- state 33 ,(-1,-80) -- state 34 ,(-1,-81) -- state 35 ,(-1,-82) -- state 36 ,( 29, 84),(-1,-96) -- state 37 ,( 29, 84) ,(-1,-87) -- state 38 ,(-1,-15) -- state 39 ,(-1,-49) -- state 40 ,(-1,-48) -- state 41 ,(-1,-47) -- state 42 ,(-1,-46) -- state 43 ,(-1,-45) -- state 44 ,(-1,-44) -- state 45 ,(-1,-43) -- state 46 ,(-1,-42) -- state 47 ,(-1,-41) -- state 48 ,(-1,-40) -- state 49 ,(-1,-39) -- state 50 ,(-1,-38) -- state 51 ,(-1,-37) -- state 52 ,(-1,-89) -- state 53 ,(-1,-90) -- state 54 ,( 18, 87),(-1,-92) -- state 55 ,(-1,-85) -- state 56 ,(-1,-86) -- state 57 ,(-1,-88) -- state 58 ,(-1,-34) -- state 59 ,(-1,-24) -- state 60 ,(-1,-94) -- state 61 ,(-1,-97) -- state 62 ,(-1,-98) -- state 63 ,(-1,-99) -- state 64 ,(-1,-100) -- state 65 ,(-1,-36) -- state 66 ,(-1,-35) -- state 67 ,(-1,-33) -- state 68 ,(-1,-1) -- state 69 ,(-1,-32) -- state 70 ,(-1,-29) -- state 71 ,(-1,-30) -- state 72 ,(-1,-31) -- state 73 ,( 0,-3001),(-1,-3000) -- state 74 ,( 2, 68) ,( 16, 38),( 21, 21),( 22, 20),( 25, 59) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 75 ,( 2, 68),( 16, 38) ,( 21, 21),( 22, 20),( 25, 59),( 30, 70) ,( 31, 71),( 32, 72),( 33, 69),( 34, 67) ,( 35, 58),( 36, 66),( 37, 65),( 38, 51) ,( 39, 50),( 40, 49),( 41, 48),( 42, 47) ,( 43, 46),( 44, 45),( 45, 44),( 46, 43) ,( 47, 42),( 48, 41),( 49, 40),( 50, 39) ,(-1,-3000) -- state 76 ,( 19, 16),( 20, 10),(-1,-54) -- state 77 ,( 27, 93),(-1,-59) -- state 78 ,( 19, 16),( 20, 10) ,(-1,-102) -- state 79 ,(-1,-95) -- state 80 ,(-1,-63) -- state 81 ,(-1,-16) -- state 82 ,(-1,-68) -- state 83 ,(-1,-66) -- state 84 ,(-1,-28) -- state 85 ,( 28, 95) ,(-1,-3000) -- state 86 ,( 5, 99),( 6, 100),(-1,-3000) -- state 87 ,(-1,-17) -- state 88 ,( 2, 68),( 25, 59),( 30, 70) ,( 31, 71),( 32, 72),( 33, 69),( 34, 67) ,( 35, 58),( 36, 66),( 37, 65),( 38, 51) ,( 39, 50),( 40, 49),( 41, 48),( 42, 47) ,( 43, 46),( 44, 45),( 45, 44),( 46, 43) ,( 47, 42),( 48, 41),( 49, 40),( 50, 39) ,(-1,-3000) -- state 89 ,(-1,-3000) -- state 90 ,(-1,-57) -- state 91 ,(-1,-103) -- state 92 ,( 2, 68),( 3, 132),( 4, 131),( 5, 99) ,( 6, 100),( 14, 130),( 16, 38),( 19, 16) ,( 20, 10),( 21, 21),( 22, 20),( 23, 117) ,( 25, 59),( 29, 84),( 30, 70),( 31, 71) ,( 32, 72),( 33, 69),( 34, 67),( 35, 58) ,( 36, 66),( 37, 65),( 38, 51),( 39, 50) ,( 40, 49),( 41, 48),( 42, 47),( 43, 46) ,( 44, 45),( 45, 44),( 46, 43),( 47, 42) ,( 48, 41),( 49, 40),( 50, 39),(-1,-3000) -- state 93 ,(-1,-26) -- state 94 ,(-1,-62) -- state 95 ,(-1,-27) -- state 96 ,(-1,-83) -- state 97 ,(-1,-150) -- state 98 ,(-1,-151) -- state 99 ,(-1,-4) -- state 100 ,(-1,-5) -- state 101 ,( 28, 95),(-1,-3000) -- state 102 ,(-1,-96) -- state 103 ,(-1,-87) -- state 104 ,(-1,-91) -- state 105 ,(-1,-93) -- state 106 ,(-1,-101) -- state 107 ,( 30, 70) ,(-1,-106) -- state 108 ,( 33, 69),(-1,-127) -- state 109 ,( 11, 139) ,( 12, 138),(-1,-129) -- state 110 ,( 7, 144),( 8, 142) ,( 9, 145),( 10, 143),(-1,-131) -- state 111 ,( 23, 117) ,( 24, 150),(-1,-134) -- state 112 ,( 25, 59),( 31, 71) ,( 32, 72),(-1,-139) -- state 113 ,(-1,-142) -- state 114 ,( 13, 156) ,(-1,-146) -- state 115 ,( 2, 68),( 3, 132),( 4, 131) ,( 5, 99),( 6, 100),( 14, 130),( 16, 38) ,( 19, 16),( 20, 10),( 21, 21),( 22, 20) ,( 23, 117),( 25, 59),( 29, 84),( 30, 70) ,( 31, 71),( 32, 72),( 33, 69),( 34, 67) ,( 35, 58),( 36, 66),( 37, 65),( 38, 51) ,( 39, 50),( 40, 49),( 41, 48),( 42, 47) ,( 43, 46),( 44, 45),( 45, 44),( 46, 43) ,( 47, 42),( 48, 41),( 49, 40),( 50, 39) ,(-1,-3000) -- state 116 ,(-1,-119) -- state 117 ,(-1,-22) -- state 118 ,(-1,-121) -- state 119 ,( 19, 16),( 20, 10),( 27, 93),(-1,-122) -- state 120 ,(-1,-125) -- state 121 ,(-1,-107) -- state 122 ,( 2, 68),( 3, 132) ,( 4, 131),( 5, 99),( 6, 100),( 14, 130) ,( 16, 38),( 19, 16),( 20, 10),( 21, 21) ,( 22, 20),( 23, 117),( 25, 59),( 29, 84) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 123 ,(-1,-109) -- state 124 ,(-1,-110) -- state 125 ,(-1,-111) -- state 126 ,( 2, 68),( 30, 70),( 31, 71) ,( 32, 72),( 33, 69),( 34, 67),( 35, 58) ,( 36, 66),( 37, 65),( 38, 51),( 39, 50) ,( 40, 49),( 41, 48),( 42, 47),( 43, 46) ,( 44, 45),( 45, 44),( 46, 43),( 47, 42) ,( 48, 41),( 49, 40),( 50, 39),(-1,-3000) -- state 127 ,(-1,-148) -- state 128 ,(-1,-149) -- state 129 ,( 29, 84),(-1,-3000) -- state 130 ,(-1,-13) -- state 131 ,(-1,-3) -- state 132 ,(-1,-2) -- state 133 ,( 29,-118) ,(-1,-90) -- state 134 ,( 26, 166),(-1,-3000) -- state 135 ,(-1,-84) -- state 136 ,( 2, 68),( 3, 132),( 4, 131),( 5, 99) ,( 6, 100),( 14, 130),( 16, 38),( 19, 16) ,( 20, 10),( 21, 21),( 22, 20),( 23, 117) ,( 25, 59),( 29, 84),( 30, 70),( 31, 71) ,( 32, 72),( 33, 69),( 34, 67),( 35, 58) ,( 36, 66),( 37, 65),( 38, 51),( 39, 50) ,( 40, 49),( 41, 48),( 42, 47),( 43, 46) ,( 44, 45),( 45, 44),( 46, 43),( 47, 42) ,( 48, 41),( 49, 40),( 50, 39),(-1,-3000) -- state 137 ,( 2, 68),( 3, 132),( 4, 131),( 5, 99) ,( 6, 100),( 14, 130),( 16, 38),( 19, 16) ,( 20, 10),( 21, 21),( 22, 20),( 23, 117) ,( 25, 59),( 29, 84),( 30, 70),( 31, 71) ,( 32, 72),( 33, 69),( 34, 67),( 35, 58) ,( 36, 66),( 37, 65),( 38, 51),( 39, 50) ,( 40, 49),( 41, 48),( 42, 47),( 43, 46) ,( 44, 45),( 45, 44),( 46, 43),( 47, 42) ,( 48, 41),( 49, 40),( 50, 39),(-1,-3000) -- state 138 ,(-1,-11) -- state 139 ,(-1,-10) -- state 140 ,( 2, 68),( 3, 132) ,( 4, 131),( 5, 99),( 6, 100),( 14, 130) ,( 16, 38),( 19, 16),( 20, 10),( 21, 21) ,( 22, 20),( 23, 117),( 25, 59),( 29, 84) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 141 ,( 2, 68),( 3, 132) ,( 4, 131),( 5, 99),( 6, 100),( 14, 130) ,( 16, 38),( 19, 16),( 20, 10),( 21, 21) ,( 22, 20),( 23, 117),( 25, 59),( 29, 84) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 142 ,(-1,-7) -- state 143 ,(-1,-9) -- state 144 ,(-1,-6) -- state 145 ,(-1,-8) -- state 146 ,( 2, 68),( 3, 132) ,( 4, 131),( 5, 99),( 6, 100),( 14, 130) ,( 16, 38),( 19, 16),( 20, 10),( 21, 21) ,( 22, 20),( 23, 117),( 25, 59),( 29, 84) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 147 ,( 2, 68),( 3, 132) ,( 4, 131),( 5, 99),( 6, 100),( 14, 130) ,( 16, 38),( 19, 16),( 20, 10),( 21, 21) ,( 22, 20),( 23, 117),( 25, 59),( 29, 84) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 148 ,( 2, 68),( 3, 132) ,( 4, 131),( 5, 99),( 6, 100),( 14, 130) ,( 16, 38),( 19, 16),( 20, 10),( 21, 21) ,( 22, 20),( 23, 117),( 25, 59),( 29, 84) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 149 ,( 2, 68),( 3, 132) ,( 4, 131),( 5, 99),( 6, 100),( 14, 130) ,( 16, 38),( 19, 16),( 20, 10),( 21, 21) ,( 22, 20),( 23, 117),( 25, 59),( 29, 84) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 150 ,(-1,-23) -- state 151 ,( 2, 68) ,( 3, 132),( 4, 131),( 5, 99),( 6, 100) ,( 14, 130),( 16, 38),( 19, 16),( 20, 10) ,( 21, 21),( 22, 20),( 23, 117),( 25, 59) ,( 29, 84),( 30, 70),( 31, 71),( 32, 72) ,( 33, 69),( 34, 67),( 35, 58),( 36, 66) ,( 37, 65),( 38, 51),( 39, 50),( 40, 49) ,( 41, 48),( 42, 47),( 43, 46),( 44, 45) ,( 45, 44),( 46, 43),( 47, 42),( 48, 41) ,( 49, 40),( 50, 39),(-1,-3000) -- state 152 ,( 2, 68) ,( 3, 132),( 4, 131),( 5, 99),( 6, 100) ,( 14, 130),( 16, 38),( 19, 16),( 20, 10) ,( 21, 21),( 22, 20),( 23, 117),( 25, 59) ,( 29, 84),( 30, 70),( 31, 71),( 32, 72) ,( 33, 69),( 34, 67),( 35, 58),( 36, 66) ,( 37, 65),( 38, 51),( 39, 50),( 40, 49) ,( 41, 48),( 42, 47),( 43, 46),( 44, 45) ,( 45, 44),( 46, 43),( 47, 42),( 48, 41) ,( 49, 40),( 50, 39),(-1,-3000) -- state 153 ,( 2, 68) ,( 3, 132),( 4, 131),( 5, 99),( 6, 100) ,( 14, 130),( 16, 38),( 19, 16),( 20, 10) ,( 21, 21),( 22, 20),( 23, 117),( 25, 59) ,( 29, 84),( 30, 70),( 31, 71),( 32, 72) ,( 33, 69),( 34, 67),( 35, 58),( 36, 66) ,( 37, 65),( 38, 51),( 39, 50),( 40, 49) ,( 41, 48),( 42, 47),( 43, 46),( 44, 45) ,( 45, 44),( 46, 43),( 47, 42),( 48, 41) ,( 49, 40),( 50, 39),(-1,-3000) -- state 154 ,( 2, 68) ,( 3, 132),( 4, 131),( 5, 99),( 6, 100) ,( 14, 130),( 16, 38),( 19, 16),( 20, 10) ,( 21, 21),( 22, 20),( 23, 117),( 25, 59) ,( 29, 84),( 30, 70),( 31, 71),( 32, 72) ,( 33, 69),( 34, 67),( 35, 58),( 36, 66) ,( 37, 65),( 38, 51),( 39, 50),( 40, 49) ,( 41, 48),( 42, 47),( 43, 46),( 44, 45) ,( 45, 44),( 46, 43),( 47, 42),( 48, 41) ,( 49, 40),( 50, 39),(-1,-3000) -- state 155 ,( 2, 68) ,( 3, 132),( 4, 131),( 5, 99),( 6, 100) ,( 14, 130),( 16, 38),( 19, 16),( 20, 10) ,( 21, 21),( 22, 20),( 23, 117),( 25, 59) ,( 29, 84),( 30, 70),( 31, 71),( 32, 72) ,( 33, 69),( 34, 67),( 35, 58),( 36, 66) ,( 37, 65),( 38, 51),( 39, 50),( 40, 49) ,( 41, 48),( 42, 47),( 43, 46),( 44, 45) ,( 45, 44),( 46, 43),( 47, 42),( 48, 41) ,( 49, 40),( 50, 39),(-1,-3000) -- state 156 ,(-1,-12) -- state 157 ,( 2, 68),( 3, 132),( 4, 131),( 5, 99) ,( 6, 100),( 14, 130),( 16, 38),( 19, 16) ,( 20, 10),( 21, 21),( 22, 20),( 25, 59) ,( 29, 84),( 30, 70),( 31, 71),( 32, 72) ,( 33, 69),( 34, 67),( 35, 58),( 36, 66) ,( 37, 65),( 38, 51),( 39, 50),( 40, 49) ,( 41, 48),( 42, 47),( 43, 46),( 44, 45) ,( 45, 44),( 46, 43),( 47, 42),( 48, 41) ,( 49, 40),( 50, 39),(-1,-3000) -- state 158 ,(-1,-147) -- state 159 ,( 2, 68),( 16, 38),( 21, 21),( 22, 20) ,( 25, 59),( 30, 70),( 31, 71),( 32, 72) ,( 33, 69),( 34, 67),( 35, 58),( 36, 66) ,( 37, 65),( 38, 51),( 39, 50),( 40, 49) ,( 41, 48),( 42, 47),( 43, 46),( 44, 45) ,( 45, 44),( 46, 43),( 47, 42),( 48, 41) ,( 49, 40),( 50, 39),(-1,-3000) -- state 160 ,( 2, 68) ,( 16, 38),( 21, 21),( 22, 20),( 25, 59) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 161 ,(-1,-126) -- state 162 ,( 28, 95) ,(-1,-3000) -- state 163 ,( 18, 87),(-1,-92) -- state 164 ,(-1,-112) -- state 165 ,( 2, 68),( 3, 132),( 4, 131),( 5, 99) ,( 6, 100),( 14, 130),( 16, 38),( 19, 16) ,( 20, 10),( 21, 21),( 22, 20),( 23, 117) ,( 25, 59),( 29, 84),( 30, 70),( 31, 71) ,( 32, 72),( 33, 69),( 34, 67),( 35, 58) ,( 36, 66),( 37, 65),( 38, 51),( 39, 50) ,( 40, 49),( 41, 48),( 42, 47),( 43, 46) ,( 44, 45),( 45, 44),( 46, 43),( 47, 42) ,( 48, 41),( 49, 40),( 50, 39),(-1,-114) -- state 166 ,(-1,-25) -- state 167 ,(-1,-67) -- state 168 ,( 33, 69),(-1,-128) -- state 169 ,( 11, 139),( 12, 138),(-1,-130) -- state 170 ,( 7, 144) ,( 8, 142),( 9, 145),( 10, 143),(-1,-132) -- state 171 ,( 7, 144),( 8, 142),( 9, 145),( 10, 143) ,(-1,-133) -- state 172 ,( 23, 117),( 24, 150),(-1,-135) -- state 173 ,( 23, 117),( 24, 150),(-1,-136) -- state 174 ,( 23, 117) ,( 24, 150),(-1,-137) -- state 175 ,( 23, 117),( 24, 150) ,(-1,-138) -- state 176 ,( 25, 59),( 31, 71),( 32, 72) ,(-1,-140) -- state 177 ,( 25, 59),( 31, 71),( 32, 72) ,(-1,-141) -- state 178 ,(-1,-143) -- state 179 ,(-1,-144) -- state 180 ,(-1,-145) -- state 181 ,(-1,-120) -- state 182 ,( 19, 16),( 20, 10),(-1,-123) -- state 183 ,( 19, 16),( 20, 10),(-1,-124) -- state 184 ,(-1,-108) -- state 185 ,( 2, 68),( 30, 70),( 31, 71),( 32, 72) ,( 33, 69),( 34, 67),( 35, 58),( 36, 66) ,( 37, 65),( 38, 51),( 39, 50),( 40, 49) ,( 41, 48),( 42, 47),( 43, 46),( 44, 45) ,( 45, 44),( 46, 43),( 47, 42),( 48, 41) ,( 49, 40),( 50, 39),(-1,-3000) -- state 186 ,(-1,-115) -- state 187 ,( 15, 189),( 28, 95),(-1,-3000) -- state 188 ,(-1,-117) -- state 189 ,(-1,-14) -- state 190 ,(-1,-113) -- state 191 ,( 2, 68),( 3, 132) ,( 4, 131),( 5, 99),( 6, 100),( 14, 130) ,( 16, 38),( 19, 16),( 20, 10),( 21, 21) ,( 22, 20),( 23, 117),( 25, 59),( 29, 84) ,( 30, 70),( 31, 71),( 32, 72),( 33, 69) ,( 34, 67),( 35, 58),( 36, 66),( 37, 65) ,( 38, 51),( 39, 50),( 40, 49),( 41, 48) ,( 42, 47),( 43, 46),( 44, 45),( 45, 44) ,( 46, 43),( 47, 42),( 48, 41),( 49, 40) ,( 50, 39),(-1,-3000) -- state 192 ,(-1,-116) ); -- The offset vector SHIFT_REDUCE_OFFSET : array (0.. 192) of Integer := ( 0, 29, 30, 33, 34, 35, 36, 63, 64, 65, 66, 67, 94, 118, 119, 120, 121, 122, 124, 125, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 167, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 207, 234, 261, 264, 266, 269, 270, 271, 272, 273, 274, 275, 277, 280, 281, 305, 306, 307, 308, 344, 345, 346, 347, 348, 349, 350, 351, 352, 354, 355, 356, 357, 358, 359, 361, 363, 366, 371, 374, 378, 379, 381, 417, 418, 419, 420, 424, 425, 426, 462, 463, 464, 465, 488, 489, 490, 492, 493, 494, 495, 497, 499, 500, 536, 572, 573, 574, 610, 646, 647, 648, 649, 650, 686, 722, 758, 794, 795, 831, 867, 903, 939, 975, 976, 1011, 1012, 1039, 1066, 1067, 1069, 1071, 1072, 1108, 1109, 1110, 1112, 1115, 1120, 1125, 1128, 1131, 1134, 1137, 1141, 1145, 1146, 1147, 1148, 1149, 1152, 1155, 1156, 1179, 1180, 1183, 1184, 1185, 1186, 1222); end Xia_Parser_Shift_Reduce; xia-1.00/doc/0040777000076600007670000000000010212334406011645 5ustar g315padadevxia-1.00/doc/bc-containers-collections.html0100644000076600007670000003124410212334402017567 0ustar g315padadev Generic package: BC.Containers.Collections

Generic package: BC.Containers.Collections

Description

$RCSfile: bc-containers-collections.ads,v $ $Revision: 1.9.2.1 $ $Date: 2002/12/29 12:22:31 $ $Author: simon $

Header

generic
package BC.Containers.Collections is

 
pragma Elaborate_Body;

Known child units

BC.Containers.Collections.Ordered(generic package)

Type Summary

Abstract_Collection (abstract type) derived from Container
New Operations:  Append, Append, Available, Clear, First, Insert, Insert, Is_Empty, Item_At, Last, Length, Location, Remove, Replace
Inherited Operations:  New_Iterator, Null_Container

Other Items:

type Abstract_Collection is abstract new Container with private;
function Are_Equal (Left, Right : Abstract_Collection'Class) return Boolean;
A collection denotes an indexed collection of items, drawn from some well-defined universe. A collection may contain duplicate items; a collection owns a copy of each item. 
procedure Copy (From : Abstract_Collection'Class;
                To : in out Abstract_Collection'Class);
Return True if and only if both collections have the same extent and the same items in the same order; return False otherwise. Can't call this "=" because of the standard one for Collection. 
procedure Clear (C : in out Abstract_Collection) is abstract;
This operation MUST be called for dissimilar Collections in place of assignment. 
procedure Insert (C : in out Abstract_Collection; Elem : Item) is abstract;
Empty the collection of all items. 
procedure Insert (C : in out Abstract_Collection;
                  Elem : Item; Before : Positive) is abstract;
Add the item to the front of the collection. 
procedure Append (C : in out Abstract_Collection; Elem : Item) is abstract;
Add the item before the given index item in the collection; if before is 1, the item is added to the front of the collection. 
procedure Append (C : in out Abstract_Collection;
                  Elem : Item;
                  After : Positive) is abstract;
Add the item at the end of the collection. 
procedure Remove (C : in out Abstract_Collection;
                  At_Index : Positive) is abstract;
Add the item after the given index item in the collection. 
procedure Replace (C : in out Abstract_Collection;
                   At_Index : Positive; Elem : Item) is abstract;
Remove the item at the given index in the collection. 
function Available (C : Abstract_Collection) return Natural;
Replace the item at the given index with the given item. 
function Length (C : Abstract_Collection) return Natural is abstract;
Indicated number of empty "Item slots" left in the collection. 
function Is_Empty (C : Abstract_Collection) return Boolean is abstract;
Return the number of items in the collection. 
function First (C : Abstract_Collection) return Item is abstract;
Return True if and only if there are no items in the collection. 
function Last (C : Abstract_Collection) return Item is abstract;
Return a copy of the item at the front of the collection. 
function Item_At (C : Abstract_Collection;
                  At_Index : Positive) return Item is abstract;
Return a copy of the item at the end of the collection. 
function Location (C : Abstract_Collection;
                   Elem : Item) return Natural is abstract;
Return a copy of the item at the indicated position in the collection. 
private

   --  Implementation-defined ...

end BC.Containers.Collections;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-containers-collections-ordered.html0100644000076600007670000001232310212334402021206 0ustar g315padadev Generic package: BC.Containers.Collections.Ordered

Generic package: BC.Containers.Collections.Ordered

Description

$RCSfile: bc-containers-collections-ordered.ads,v $ $Revision: 1.4.2.1 $ $Date: 2002/12/29 12:22:36 $ $Author: simon $

Header

generic
   with function "<" (L, R : Item) return Boolean is <>;
package BC.Containers.Collections.Ordered is

Known child units

BC.Containers.Collections.Ordered.Unbounded(generic package)

Type Summary

Abstract_Ordered_Collection (abstract type) derived from Abstract_Collection
Inherited Operations:  Append, Append, Available, Clear, First, Insert, Insert, Is_Empty, Item_At, Last, Length, Location, New_Iterator, Null_Container, Remove, Replace

Other Items:

type Abstract_Ordered_Collection
   is abstract new Abstract_Collection with private;
private

   --  Implementation-defined ...

end BC.Containers.Collections.Ordered;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-containers-collections-ordered-unbounded.html0100644000076600007670000002764310212334402023202 0ustar g315padadev Generic package: BC.Containers.Collections.Ordered.Unbounded

Generic package: BC.Containers.Collections.Ordered.Unbounded

Dependencies

with BC.Support.Unbounded;
with System.Storage_Pools;

Description

$RCSfile: bc-containers-collections-ordered-unbounded.ads,v $ $Revision: 1.8.2.1 $ $Date: 2002/12/29 12:22:42 $ $Author: simon $

Header

generic
   Storage : in out System.Storage_Pools.Root_Storage_Pool'Class;
package BC.Containers.Collections.Ordered.Unbounded is

 
pragma Elaborate_Body;

Type Summary

Collection derived from Abstract_Ordered_Collection
Overridden Operations:  Append, Append, Clear, First, Insert, Insert, Is_Empty, Item_At, Last, Length, Location, New_Iterator, Null_Container, Remove, Replace
New Operations:  "="
Inherited Operations:  Available

Other Items:

type Collection is new Abstract_Ordered_Collection with private;
function Null_Container return Collection;
function "=" (Left, Right : in Collection) return Boolean;
procedure Clear (C : in out Collection);
procedure Insert (C : in out Collection; Elem : Item);
Empty the collection of all items. 
procedure Insert (C : in out Collection;
                  Elem : Item;
                  Before : Positive);
Add the item to the collection, starting at the front. 
procedure Append (C : in out Collection; Elem : Item);
Add the item to the collection, starting at the front. 
procedure Append (C : in out Collection;
                  Elem : Item;
                  After : Positive);
Add the item to the collection, starting at the end. 
procedure Remove (C : in out Collection; At_Index : Positive);
Add the item to the collection, starting at the end. 
procedure Replace (C : in out Collection;
                   At_Index : Positive;
                   Elem : Item);
Remove the item at the given index in the collection. 
function Length (C : Collection) return Natural;
Replace the item at the given index with the given item. 
function Is_Empty (C : Collection) return Boolean;
Return the number of items in the collection. 
function First (C : Collection) return Item;
Return True if and only if there are no items in the collection. 
function Last (C : Collection) return Item;
Return a copy of the item at the front of the collection. 
function Item_At (C : Collection; At_Index : Positive) return Item;
Return a copy of the item at the end of the collection. 
function Location (C : Collection; Elem : Item) return Natural;
Return a copy of the item at the indicated position in the collection. 
function New_Iterator
  (For_The_Collection : Collection) return Iterator'Class;
Return the first index at which the item is found (0 if the item desn't exist in the collecton). 
private

   --  Implementation-defined ...

end BC.Containers.Collections.Ordered.Unbounded;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-containers-collections-unbounded.html0100644000076600007670000002745710212334403021564 0ustar g315padadev Generic package: BC.Containers.Collections.Unbounded

Generic package: BC.Containers.Collections.Unbounded

Dependencies

with BC.Support.Unbounded;
with System.Storage_Pools;

Description

$RCSfile: bc-containers-collections-unbounded.ads,v $ $Revision: 1.10.2.1 $ $Date: 2002/12/29 12:22:44 $ $Author: simon $

Header

generic
   Storage : in out System.Storage_Pools.Root_Storage_Pool'Class;
package BC.Containers.Collections.Unbounded is

 
pragma Elaborate_Body;

Type Summary

Collection derived from Abstract_Collection
Overridden Operations:  Append, Append, Clear, First, Insert, Insert, Is_Empty, Item_At, Last, Length, Location, New_Iterator, Null_Container, Remove, Replace
New Operations:  "="
Inherited Operations:  Available

Other Items:

type Collection is new Abstract_Collection with private;
function Null_Container return Collection;
function "=" (Left, Right : in Collection) return Boolean;
procedure Clear (C : in out Collection);
procedure Insert (C : in out Collection; Elem : Item);
Empty the collection of all items. 
procedure Insert (C : in out Collection;
                  Elem : Item;
                  Before : Positive);
Add the item to the front of the collection. 
procedure Append (C : in out Collection; Elem : Item);
Add the item before the given index item in the collection; if before is 1, the item is added to the front of the collection. 
procedure Append (C : in out Collection;
                  Elem : Item;
                  After : Positive);
Add the item at the end of the collection. 
procedure Remove (C : in out Collection; At_Index : Positive);
Add the item after the given index item in the collection. 
procedure Replace (C : in out Collection;
                   At_Index : Positive;
                   Elem : Item);
Remove the item at the given index in the collection. 
function Length (C : Collection) return Natural;
Replace the item at the given index with the given item. 
function Is_Empty (C : Collection) return Boolean;
Return the number of items in the collection. 
function First (C : Collection) return Item;
Return True if and only if there are no items in the collection. 
function Last (C : Collection) return Item;
Return a copy of the item at the front of the collection. 
function Item_At
  (C : Collection; At_Index : Positive) return Item;
Return a copy of the item at the end of the collection. 
function Location (C : Collection; Elem : Item) return Natural;
Return a copy of the item at the indicated position in the collection. 
function New_Iterator
  (For_The_Collection : Collection) return Iterator'Class;
Return the first index at which the item is found (0 if the item desn't exist in the collecton). 
private

   --  Implementation-defined ...

end BC.Containers.Collections.Unbounded;
Generated on 2005-03-05 at 07:49:55 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-containers.html0100644000076600007670000003452510212334402015260 0ustar g315padadev Generic package: BC.Containers

Generic package: BC.Containers

Dependencies

with Ada.Finalization;

Description

$RCSfile: bc-containers.ads,v $ $Revision: 1.17.2.2 $ $Date: 2002/12/26 11:43:52 $ $Author: simon $

Header

generic
   type Item is private;
   with function "=" (L, R : Item) return Boolean is <>;
package BC.Containers is

 
pragma Elaborate_Body;
This package specifies the common protocol of all Container classes. This common protocol consists of Iterators.

Known child units

BC.Containers.Collections(generic package)

Type Summary

Container (abstract type)
Primitive Operations:  New_Iterator, Null_Container
Iterator (abstract type)
Primitive Operations:  Current_Item, Delete_Item_At, Is_Done, Next, Reset

Other Items:

type Container is abstract tagged private;
function Null_Container return Container is abstract;
type Iterator (<>) is abstract tagged private;
Active iteration 
function New_Iterator (For_The_Container : Container) return Iterator'Class
   is abstract;
procedure Reset (It : in out Iterator) is abstract;
Return a reset Iterator bound to the specific Container. 
procedure Next (It : in out Iterator) is abstract;
Reset the Iterator to the beginning. 
function Is_Done (It : Iterator) return Boolean is abstract;
Advance the Iterator to the next Item in the Container. 
function Current_Item (It : Iterator) return Item is abstract;
Return True if there are no more Items in the Container. 
generic
   with procedure Apply (Elem : in out Item);
procedure Access_Current_Item (In_The_Iterator : Iterator'Class);
Return a copy of the current Item. 
procedure Delete_Item_At (It : in out Iterator) is abstract;
Call Apply for the Iterator's current Item. 
generic
   with procedure Apply (Elem : in Item; OK : out Boolean);
procedure Visit (Using : in out Iterator'Class);
Passive iteration 
generic
   type Param_Type is private;
   with procedure Apply (Elem : in Item;
                         Param : in Param_Type;
                         OK : out Boolean);
procedure Visit_With_In_Param (Using : in out Iterator'Class;
                               Param : in Param_Type);
Call Apply with a copy of each Item in the Container to which the iterator Using is bound. The iteration will terminate early if Apply sets OK to False. 
generic
   type Param_Type is private;
   with procedure Apply (Elem : in Item;
                         Param : in out Param_Type;
                         OK : out Boolean);
procedure Visit_With_In_Out_Param (Using : in out Iterator'Class;
                                   Param : in out Param_Type);
Call Apply with a Parameter for each Item in the Container to which the iterator Using is bound. The iteration will terminate early if Apply sets OK to False. 
generic
   with procedure Apply (Elem : in out Item; OK : out Boolean);
procedure Modify (Using : in out Iterator'Class);
Call Apply with a Parameter for each Item in the Container to which the iterator Using is bound. The iteration will terminate early if Apply sets OK to False. 
generic
   type Param_Type is private;
   with procedure Apply (Elem : in out Item;
                         Param : in Param_Type;
                         OK : out Boolean);
procedure Modify_With_In_Param (Using : in out Iterator'Class;
                                Param : in Param_Type);
Call Apply with a copy of each Item in the Container to which the iterator Using is bound. The iteration will terminate early if Apply sets OK to False. 
generic
   type Param_Type is private;
   with procedure Apply (Elem : in out Item;
                         Param : in out Param_Type;
                         OK : out Boolean);
procedure Modify_With_In_Out_Param (Using : in out Iterator'Class;
                                    Param : in out Param_Type);
Call Apply with a Parameter each Item in the Container to which the iterator Using is bound. The iteration will terminate early if Apply sets OK to False. 
private

   --  Implementation-defined ...

end BC.Containers;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-containers-sets.html0100644000076600007670000003051610212334403016231 0ustar g315padadev Generic package: BC.Containers.Sets

Generic package: BC.Containers.Sets

Description

$RCSfile: bc-containers-sets.ads,v $ $Revision: 1.11.2.3 $ $Date: 2002/12/29 16:41:46 $ $Author: simon $

Header

generic
package BC.Containers.Sets is

 
pragma Elaborate_Body;
A set denotes a collection of items, drawn from some well-defined universe. A set may not contain duplicate items.

Known child units

BC.Containers.Sets.Unbounded(generic package)

Type Summary

Abstract_Set (abstract type) derived from Container
New Operations:  Add, Add, Available, Clear, Extent, Is_Empty, Is_Member, Remove
Inherited Operations:  New_Iterator, Null_Container

Other Items:

type Abstract_Set is abstract new Container with private;
The parameter Item denotes the universe from which the set draws its items. Items may be a primitive type or user-defined. 
function Are_Equal (L, R : Abstract_Set'Class) return Boolean;
procedure Clear (S : in out Abstract_Set) is abstract;
Return True if and only if both sets have the same number of distinct items, and the same items themselves; return False otherwise. Can't call this "=" because of the standard one for Set. 
procedure Add (S : in out Abstract_Set;
               I : Item;
               Added : out Boolean) is abstract;
Empty the set of all items. 
procedure Add (S : in out Abstract_Set; I : Item) is abstract;
Add the item to the set. If the item is not already a distinct member of the set, copy the item and add it to the set and set Added to True. If the item already exists, then set Added to False. 
procedure Remove (S : in out Abstract_Set; I : Item) is abstract;
Add the item to the set. If the item is not already a distinct member of the set, copy the item and add it to the set. 
procedure Union (S : in out Abstract_Set'Class; O : Abstract_Set'Class);
If the item is not a member of the set, raise BC.Not_Found. Otherwise, remove the item from the set. 
procedure Intersection (S : in out Abstract_Set'Class;
                        O : Abstract_Set'Class);
Perform a logical set union; at the completion of this operation, the set S contains the items found in its original state combined with the set O (but without duplication). For each item in the set O, if the item is not already a distinct member of the set S, copy the item and add it to the set S. If the item already is a member, do nothing. 
procedure Difference (S : in out Abstract_Set'Class;
                      O : Abstract_Set'Class);
Perform a logical set intersection; at the completion of this operation, the set S contains the items found both in its original state and in the set O. For each item in the set O, if the item is not already a distinct member of the set S, do nothing. If the item already is a member of S, do nothing. Items in the set S but not in the set O are also removed. 
function Available (S : Abstract_Set) return Natural;
Perform a logical set difference; at the completion of this operation, the set S contains the items found in its original state, less those found in the set O. For each item in the set O, if the item is not already a distinct member of the set S, do nothing. If the item is a member, remove the item from the set S. 
function Extent (S : Abstract_Set) return Natural is abstract;
Return the number of unused slots in the set. 
function Is_Empty (S : Abstract_Set) return Boolean is abstract;
Return the number of distinct items in the set. 
function Is_Member (S : Abstract_Set; I : Item) return Boolean is abstract;
Return True if and only if there are no items in the set. 
function Is_Subset (S : Abstract_Set'Class;
                    O : Abstract_Set'Class) return Boolean;
Return True if and only if the item exists in the set. 
function Is_Proper_Subset (S : Abstract_Set'Class;
                           O : Abstract_Set'Class) return Boolean;
Return True if and only if all the items in the set S are also in the set O. 
private

   --  Implementation-defined ...

end BC.Containers.Sets;
Generated on 2005-03-05 at 07:49:55 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-containers-sets-unbounded.html0100644000076600007670000002365210212334403020215 0ustar g315padadev Generic package: BC.Containers.Sets.Unbounded

Generic package: BC.Containers.Sets.Unbounded

Dependencies

with BC.Support.Unbounded;
with BC.Support.Hash_Tables;
with System.Storage_Pools;

Description

$RCSfile: bc-containers-sets-unbounded.ads,v $ $Revision: 1.13.2.6 $ $Date: 2002/12/29 16:41:52 $ $Author: simon $

Header

generic
   with function Hash (V : Item) return Natural is <>;
   Buckets : Positive;
   Storage : in out System.Storage_Pools.Root_Storage_Pool'Class;
package BC.Containers.Sets.Unbounded is

 
pragma Elaborate_Body;
A set denotes a collection of items, drawn from some well-defined universe. A set may not contain duplicate items.

Type Summary

Unconstrained_Set derived from Abstract_Set
Overridden Operations:  Add, Add, Clear, Extent, Is_Empty, Is_Member, New_Iterator, Null_Container, Remove
Inherited Operations:  Available

Other Items:

type Unconstrained_Set
  (Number_Of_Buckets : Positive) is new Abstract_Set with private;
The hash function must satisfy the condition that, for objects A and B, if A = B, then Hash (A) must equal Hash (B). The hash function should attempt to spread the set of possible items uniformly across the number of buckets. The quality of the hash function has a significant impact upon performance. 
subtype Set is Unconstrained_Set (Number_Of_Buckets => Buckets);
function Null_Container return Unconstrained_Set;
procedure Clear (S : in out Unconstrained_Set);
Note, this function has to be provided but the object returned is in fact a Set (ie, it is constrained). 
procedure Add (S : in out Unconstrained_Set; I : Item; Added : out Boolean);
Empty the set of all items. 
procedure Add (S : in out Unconstrained_Set; I : Item);
Add the item to the set. If the item is not already a distinct member of the set, copy the item and add it to the set and set Added to True. If the item already exists, then set Added to False. 
procedure Remove (S : in out Unconstrained_Set; I : Item);
Add the item to the set. If the item is not already a distinct member of the set, copy the item and add it to the set. 
function Extent (S : Unconstrained_Set) return Natural;
If the item is not a member of the set, raise BC.Not_Found. Otherwise, remove the item from the set. 
function Is_Empty (S : Unconstrained_Set) return Boolean;
Return the number of items in the set. 
function Is_Member (S : Unconstrained_Set; I : Item) return Boolean;
Return True if and only if there are no items in the set. 
function New_Iterator
  (For_The_Set : Unconstrained_Set) return Iterator'Class;
Return True if and only if the item exists in the set. 
private

   --  Implementation-defined ...

end BC.Containers.Sets.Unbounded;
Generated on 2005-03-05 at 07:49:55 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-containers-trees-avl.html0100644000076600007670000002311110212334403017146 0ustar g315padadev Generic package: BC.Containers.Trees.AVL

Generic package: BC.Containers.Trees.AVL

Dependencies

with Ada.Finalization;
with System.Storage_Pools;

Description

$RCSfile: bc-containers-trees-avl.ads,v $ $Revision: 1.8.2.1 $ $Date: 2002/12/29 16:42:03 $ $Author: simon $

Header

generic
   with function "<" (L, R : Item) return Boolean is <>;
   Storage : in out System.Storage_Pools.Root_Storage_Pool'Class;
package BC.Containers.Trees.AVL is

 
pragma Elaborate_Body;

Type Summary

AVL_Tree
Primitive Operations:  "=", Clear, Delete, Extent, Insert, Is_Member, Is_Null

Other Items:

type AVL_Tree is private;
function "=" (L, R : AVL_Tree) return Boolean;
procedure Clear (T : in out AVL_Tree);
return True if both trees contain the same Elements. 
procedure Insert (T : in out AVL_Tree;
                  Element : Item;
                  Not_Found : out Boolean);
Make the tree null and reclaim the storage associated with its items. 
procedure Delete
  (T : in out AVL_Tree; Element : Item; Found : out Boolean);
Add the item to the tree, preserving the tree's balance. Not_Found is set to True if the item had not previously existed in the tree, and to False otherwise. 
function Extent (T : AVL_Tree) return Natural;
Remove the item from the tree, preserving the tree's balance. Found is set to True if the item was in fact found in the tree and removed, and to False otherwise. 
function Is_Null (T : AVL_Tree) return Boolean;
Return the number of items in the tree. 
function Is_Member (T : AVL_Tree; Element : Item) return Boolean;
Return True if and only if the tree has no items. 
generic
   with procedure Apply (Elem : in out Item);
procedure Access_Actual_Item (In_The_Tree : AVL_Tree;
                              Elem : Item;
                              Found : out Boolean);
Return True if and only if the item exists in the tree. 
generic
   with procedure Apply (Elem : in Item; OK : out Boolean);
procedure Visit (Over_The_Tree : AVL_Tree);
If an Item "=" to Elem is present in the Tree, call Apply for it and set Found to True; otherwise, set Found to False. Apply MUST NOT alter the result of the ordering operation "<". 
generic
   with procedure Apply (Elem : in out Item; OK : out Boolean);
procedure Modify (Over_The_Tree : AVL_Tree);
Call Apply with a copy of each Item in the Tree, in order. The iteration will terminate early if Apply sets OK to False. 
private

   --  Implementation-defined ...

end BC.Containers.Trees.AVL;
Generated on 2005-03-05 at 07:49:55 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-containers-trees.html0100644000076600007670000000613010212334403016370 0ustar g315padadev Generic (signature) package: BC.Containers.Trees

Generic (signature) package: BC.Containers.Trees

Description

$RCSfile: bc-containers-trees.ads,v $ $Revision: 1.9.2.1 $ $Date: 2002/12/29 16:42:01 $ $Author: simon $ A binary tree is a rooted collection of nodes and arcs, where each node has two children and where arcs may not have cycles or cross-references (as in graphs). A multiway tree is a rooted collection of nodes and arcs, where each node may have an arbitrary number of children and where arcs may not have cycles or cross-references. AVL trees are a form of balance tree (following the algorithm of Adelson-Velskii and Landis) whose behavior only exposes operations to insert, delete, and search for items.

Header

generic package BC.Containers.Trees is

Known child units

BC.Containers.Trees.AVL(generic package)
end BC.Containers.Trees;
Generated on 2005-03-05 at 07:49:55 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc.html0100644000076600007670000001243510212334402013111 0ustar g315padadev Package: BC

Package: BC

Description

$RCSfile: bc.ads,v $ $Revision: 1.8.2.3 $ $Date: 2002/12/24 11:42:44 $ $Author: simon $ This is the top level package in the Booch Component Hierarchy.

Header

package BC is

Known child units

BC.Containers(generic package)
BC.Support(package)

Exceptions

Duplicate
Attempt to insert an item in a Map under a duplicate key.
Is_Null
A Graph, List, or Tree isn't designating any actual Container.
Not_Found
Raised when a "done" Iterator is used.
Not_Root
Attempt to insert, append or join Lists or Trees other than at an "end".
Not_Yet_Implemented
Raised when a feature hasn't yet been implemented.
Overflow
Attempt to fill a bounded Container beyond its capacity.
Range_Error
Attempt to Insert or Append at an invalid position.
Referenced
Attempt to Remove a List element that's aliased by another List.
Should_Have_Been_Overridden
Raised if the Components have failed to override a primitive subprogram that should have been overridden for a derived type. Used only where the subprogram is private (and therefore can't be abstract).
Sort_Error
Attempt to sort an inappropriate Container (Bag, Map, Set).
Storage_Error
Raised by BC.Support.Managed_Storage when the requested size is too large or zero.
Underflow
Raised on attempts to access elements in an empty Container. 
end BC;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-support-hash_tables.html0100644000076600007670000005203410212334403017076 0ustar g315padadev Package: BC.Support.Hash_Tables

Package: BC.Support.Hash_Tables

Description

$RCSfile: bc-support-hash_tables.ads,v $ $Revision: 1.9.2.3 $ $Date: 2002/12/26 14:48:14 $ $Author: simon $

Header

package BC.Support.Hash_Tables is

 
pragma Elaborate_Body;

Other Items:

generic

   type Item is private;
   type Item_Ptr is access all Item;
   with function "=" (L, R : Item) return Boolean is <>;
   with function Hash (V : Item) return Natural is <>;

   type Item_Container is private;

   --  The <> subprograms for Items are provided by one of
   --  BC.Support.Bounded, Dynamic or Unbounded as appropriate.

   with procedure Clear (C : in out Item_Container) is <>;
   with procedure Insert (C : in out Item_Container; I : Item) is <>;
   with procedure Append (C : in out Item_Container; I : Item) is <>;
   with procedure Remove (C : in out Item_Container; From : Positive) is <>;
   with procedure Replace
     (C : in out Item_Container; Index : Positive; I : Item) is <>;
   with function Length (C : Item_Container) return Natural is <>;
   with function Item_At
     (C : Item_Container; Index : Positive) return Item is <>;
   with function Item_At
     (C : Item_Container; Index : Positive) return Item_Ptr is <>;
   with function Location
     (C : Item_Container; I : Item; Start : Positive) return Natural is <>;

package Item_Signature is
Item_Container and Value_Container provide the concrete container for each bucket. These types will normally be provided by instantiations of the bounded, dynamic, and unbounded support packages defined for this library. 
end Item_Signature;
generic

   type Value is private;
   type Value_Ptr is access all Value;
   with function "=" (L, R : Value) return Boolean is <>;

   type Value_Container is private;

   --  The <> subprograms for Values are provided by one of
   --  BC.Support.Bounded, Dynamic or Unbounded as appropriate.

   with procedure Clear (C : in out Value_Container) is <>;
   with procedure Insert (C : in out Value_Container; V : Value) is <>;
   with procedure Append (C : in out Value_Container; V : Value) is <>;
   with procedure Remove
     (C : in out Value_Container; From : Positive) is <>;
   with procedure Replace
     (C : in out Value_Container; Index : Positive; V : Value) is <>;
   with function Length (C : Value_Container) return Natural is <>;
   with function Item_At
     (C : Value_Container; Index : Positive) return Value is <>;
   with function Item_At
     (C : Value_Container; Index : Positive) return Value_Ptr is <>;
   with function Location
     (C : Value_Container;
      V : Value;
      Start : Positive) return Natural is <>;

package Value_Signature is

end Value_Signature;
generic

   with package Items is new Item_Signature (<>);
   with package Values is new Value_Signature (<>);

package Tables is
The type Table represents an open hash table whose buckets may be formed by bounded, dynamic, or unbounded containers. Each table contains n buckets, wherein each bucket is a container of item/value pairs. To insert, remove, or locate a pair in the table, the operation first generates a hash value upon the item to select a specific bucket, and then the given operation is performed upon the selected container.

Type Summary

Item_Array
Table
Primitive Operations:  "=", Bind, Clear, Current_Item_Ptr, Current_Value_Ptr, Delete_Item_At, Extent, Is_Bound, Is_Done, Next, Rebind, Reset, Unbind, Value_Of
Value_Array

Other Items:

type Item_Array is array (Positive range <>) of Items.Item_Container;
This is a low-level abstraction that specifies no policies for the order in which items may be added and removed from the container. This class is not intended to be subclassed. 
type Value_Array is array (Positive range <>) of Values.Value_Container;
type Table (Number_Of_Buckets : Positive) is record
   Items : Item_Array (1 .. Number_Of_Buckets);
   Values : Value_Array (1 .. Number_Of_Buckets);
   Size : Natural := 0;
end record;
function "=" (L, R : Table) return Boolean;
procedure Clear (T : in out Table);
procedure Bind (T : in out Table; I : Items.Item; V : Values.Value);
Empty the hash table of all item/value pairs. 
procedure Rebind (T : in out Table; I : Items.Item; V : Values.Value);
Generate a hash value for the item to select a bucket. If the item already exists in that bucket, raise BC.Duplicate; otherwise, insert the Item/value pair in the selected container. 
procedure Unbind (T : in out Table; I : Items.Item);
Generate a hash value for the item to select a bucket. If the item already exists in that bucket, change the item's corresponding value; otherwise, raise BC.Not_Found. 
function Extent (T : Table) return Natural;
Generate a hash value for the item to select a bucket. If the item already exists in that bucket, remove the item/value pair; otherwise, BC.Not_Found. 
function Is_Bound (T : Table; I : Items.Item) return Boolean;
Return the number of item/value pairs in the hash table. 
function Value_Of (T : Table; I : Items.Item) return Values.Value;
Return True if the item has a binding in the hash table; otherwise, return False. 
procedure Reset (T : Table;
                 Bucket : out Positive;
                 Index : out Positive);
Iterator support 
function Is_Done (T : Table;
                  Bucket : Positive;
                  Index : Positive) return Boolean;
function Current_Item_Ptr (T : Table;
                           Bucket : Positive;
                           Index : Positive) return Items.Item_Ptr;
function Current_Value_Ptr (T : Table;
                            Bucket : Positive;
                            Index : Positive) return Values.Value_Ptr;
procedure Delete_Item_At (T : in out Table;
                          Bucket : in out Positive;
                          Index : in out  Positive);
procedure Next (T : Table;
                Bucket : in out Positive;
                Index : in out  Positive);
end Tables;
end BC.Support.Hash_Tables;
Generated on 2005-03-05 at 07:49:55 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-support.html0100644000076600007670000000502410212334402014617 0ustar g315padadev Package: BC.Support

Package: BC.Support

Description

$RCSfile: bc-support.ads,v $ $Revision: 1.5.2.1 $ $Date: 2002/12/26 14:48:03 $ $Author: simon $

Header

package BC.Support is

Known child units

BC.Support.Standard_Storage(package)
BC.Support.Unbounded(generic package)
end BC.Support;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-support-standard_storage.html0100644000076600007670000000652710212334402020152 0ustar g315padadev Package: BC.Support.Standard_Storage

Package: BC.Support.Standard_Storage

Dependencies

with System.Storage_Pools;

Description

$RCSfile: bc-support-standard_storage.ads,v $ $Revision: 1.3.2.1 $ $Date: 2002/12/26 14:48:18 $ $Author: simon $

Header

package BC.Support.Standard_Storage is

Type Summary

T

Variables

Pool : System.Storage_Pools.Root_Storage_Pool'Class renames T'Storage_Pool;

Other Items:

type T is access Integer;
end BC.Support.Standard_Storage;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/bc-support-unbounded.html0100644000076600007670000002461710212334402016611 0ustar g315padadev Generic package: BC.Support.Unbounded

Generic package: BC.Support.Unbounded

Dependencies

with Ada.Finalization;
with Ada.Streams;
with System.Storage_Pools;

Description

$RCSfile: bc-support-unbounded.ads,v $ $Revision: 1.15.2.1 $ $Date: 2002/12/26 14:48:24 $ $Author: simon $

Header

generic
   type Item is private;
   with function "=" (L, R : Item) return Boolean is <>;
   type Item_Ptr is access all Item;
   Storage : in out System.Storage_Pools.Root_Storage_Pool'Class;
package BC.Support.Unbounded is

 
pragma Elaborate_Body;

Type Summary

Unb_Node
Primitive Operations:  "=", Append, Append, Clear, First, Insert, Insert, Item_At, Item_At, Last, Length, Location, Remove, Replace

Other Items:

type Unb_Node is private;
function "=" (Left, Right : Unb_Node) return Boolean;
An unpacked container whose items are stored on the heap. Items are effectively indexed from 1. 
procedure Clear (Obj : in out Unb_Node);
procedure Insert (Obj : in out Unb_Node; Elem : Item);
Empty the container of all Items 
procedure Insert (Obj : in out Unb_Node; Elem : Item; Before : Positive);
Add an item to the front of the container 
procedure Append (Obj : in out Unb_Node; Elem : Item);
Add an item to the container, before the given index 
procedure Append (Obj : in out Unb_Node; Elem : Item; After : Positive);
Add an item to the end of the container 
procedure Remove (Obj : in out Unb_Node; From : Positive);
Add an item to the container, after the given index 
procedure Replace (Obj : in out Unb_Node; Index : Positive; Elem : Item);
Remove the item at the given index 
function Length (Obj : Unb_Node) return Natural;
Replace the item at index with the new elem 
function First (Obj : Unb_Node) return Item;
Returns the number of items in the container 
function Last (Obj : Unb_Node) return Item;
Returns the item at the front of the container 
function Item_At (Obj : Unb_Node; Index : Positive) return Item;
Returns the item at the end of the container 
function Item_At (Obj : Unb_Node; Index : Positive) return Item_Ptr;
function Location (Obj : Unb_Node; Elem : Item; Start : Positive := 1)
                  return Natural;
Returns the item at the given index 
private

   --  Implementation-defined ...

end BC.Support.Unbounded;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/dom-core-append_node.html0100644000076600007670000000411010212334370016477 0ustar g315padadev Procedure: DOM.Core.Append_Node

Procedure: DOM.Core.Append_Node

Description

Append a node to an XMLAda DOM node list

Header

procedure DOM.Core.Append_Node
  (List : in out Node_List;
   -- list to which to append the node

   N : Node
   -- Node to append
  );
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/dom-core.html0100644000076600007670000004321010212334370014231 0ustar g315padadev Package: DOM.Core

Package: DOM.Core

Dependencies

with Unicode.CES;
with Unchecked_Deallocation;

Description

This package is the root hierarchy for the Core part of the DOM interface. It is in fact made of several subpackages, since DOM provides two views of the tree: Object-oriented throught the Element, Document,... types; and direct access through the Node interface.

Header

package DOM.Core is

Known child units

DOM.Core.Append_Node(procedure)

Exceptions

Domstring_Size_Err
If the specified range of text does not fit into a DomString.
Hierarchy_Request_Err
If a node is inserted somewhere it doesn't belong.
Index_Size_Err
If Index or size is invalid (negative or greated than max value).
Inuse_Attribute_Err
If an attempt is made to add an attribute that is already used.
Invalid_Access_Err
If a parameter or an operation is not supported by the underlying object.
Invalid_Character_Err
If an invalid character is used, for instance in a name.
Invalid_Modification_Err
If an attempt is made to modify the type of the underlying object.
Invalid_State_Err
If an attempt is made to use an object that is not or no longer available.
Namespace_Err
If an attempt is made to create or modify an object in a way incompatible with the namespace.
No_Data_Allowed_Err
If data is specified for a node that doesn't support data.
No_Modification_Allowed_Err
If an attempt is made to modify a read-only object.
Not_Found_Err
If an attempt is made to reference a node in a concept where it doesn't exist.
Not_Supported_Err
If the implementation does not support the type of object requested.
Syntax_Err
If an invalid string is specified.
Wrong_Document_Err
If a node is used with a document other than its own.

Type Summary

DOM_Implementation
Primitive Operations:  Create_Document, Has_Feature
Named_Node_Map
Node
Node_List
Primitive Operations:  Free
Node_Record
Node_Types

Other Items:

subtype DOM_String is Unicode.CES.Byte_Sequence;
subtype DOM_String_Access is Unicode.CES.Byte_Sequence_Access;
A simple redefinition of the strings, to be compatible with the standard DOM interface See the package Encodings for the exact encoding used for DOM_Strings 
type Node_Types is
  (Element_Node,
   Attribute_Node,
   Cdata_Section_Node,
   Entity_Reference_Node,
   Entity_Node,
   Processing_Instruction_Node,
   Text_Node,
   Comment_Node,
   Document_Node,
   Document_Type_Node,
   Document_Fragment_Node,
   Notation_Node);
Nodes

This is the base type for all DOM.Core types. It is declared in this package for visibility reasons, so that all DOM.Core.* packages have access to the components. 

subtype Character_Data_Types is Node_Types range Text_Node .. Comment_Node;
type Node_Record (Node_Type : Node_Types) is private;
type Node is access Node_Record;
subtype Character_Data is Node;
subtype Element is Node (Element_Node);
subtype Attr is Node (Attribute_Node);
subtype Cdata_Section is Character_Data (Cdata_Section_Node);
subtype Entity_Reference is Node (Entity_Reference_Node);
subtype Entity is Node (Entity_Node);
subtype Processing_Instruction is Node (Processing_Instruction_Node);
subtype Text is Character_Data (Text_Node);
subtype Comment is Character_Data (Comment_Node);
subtype Document is Node (Document_Node);
subtype Document_Type is Node (Document_Type_Node);
subtype Document_Fragment is Node (Document_Fragment_Node);
subtype Notation is Node (Notation_Node);
type Node_List is private;
type Named_Node_Map is private;
A simple ordered list of nodes 
procedure Free (List : in out Node_List);
A collection of nodes accessible by their names. This is unordered. 
type DOM_Implementation is private;
Dom implementation

This provides a number of methods for performing operations that are independent of any particular instance of the document object model. 

function Has_Feature
  (Implementation : DOM_Implementation;
   Feature        : DOM_String;
   Version        : String := "2.0") return Boolean;
There are multiple implementations of DOM. They can be specialized for some special cases (HTML, Stylesheets,...) 
function Create_Document
  (Implementation : DOM_Implementation;
   NameSpace_URI  : DOM_String := "";
   Qualified_Name : DOM_String := "";
   Doc_Type       : Node := null) return Node;
Return TRUE if this implementation of DOM has the Feature. 
private

   --  Implementation-defined ...

end DOM.Core;
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/dom.html0100644000076600007670000000546610212334370013316 0ustar g315padadev Package: DOM

Package: DOM

Description

This is the root hierarchy of the DOM packages. DOM is a standard API to interface to XML trees. It is divided into several main parts (Core, Events, ...). Note that to be fully compliant, strings must be UTF-16 encoded. However, you still have the choice in this implementation, so that you can use UTF-8 encoding for documents that only have ASCII characters (and thus save some space in memory). This encoding is in the file xml/encodings.ads

The comments in these packages are not meant as a tutorial, or even a reference documentation for DOM. Please see the official XML documentation.

Header

package DOM is

Known child units

DOM.Core(package)
end DOM;
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/index.html0100644000076600007670000001115110212334406013632 0ustar g315padadev Unit Index

Unit Index

B

BC
BC.Containers
BC.Containers.Collections
BC.Containers.Collections.Ordered
BC.Containers.Collections.Ordered.Unbounded
BC.Containers.Collections.Unbounded
BC.Containers.Sets
BC.Containers.Sets.Unbounded
BC.Containers.Trees
BC.Containers.Trees.AVL
BC.Support
BC.Support.Hash_Tables
BC.Support.Standard_Storage
BC.Support.Unbounded

D

DOM
DOM.Core
DOM.Core.Append_Node

M

McKae
McKae.Space
McKae.Space.Unbounded_String_Expandable
McKae.XML
McKae.XML.XPath
McKae.XML.XPath.Expressions
McKae.XML.XPath.Locations
McKae.XML.XPath.Node_Sets
McKae.XML.XPath.Predicates
McKae.XML.XPath.Predicates.Evaluation
McKae.XML.XPath.Query_Handling
McKae.XML.XPath.XIA

U

Unicode
Unicode.CES

X

Xia_Parser_Goto
Xia_Parser_Shift_Reduce

x

xia_parser
xia_parser_Model
xia_parser_Parser
xia_parser_dfa
xia_parser_io
xia_parser_tokens

Generated on 2005-03-05 at 07:49:58 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae.html0100644000076600007670000000677510212334370013623 0ustar g315padadev Package: McKae

Package: McKae

Description

McKae Software Utilities

Copyright (C) 2003 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package McKae is

 
pragma Pure;
end McKae;
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-space.html0100644000076600007670000000711010212334370014674 0ustar g315padadev Package: McKae.Space

Package: McKae.Space

Description

McKae Software Utilities

Copyright (C) 2003 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package McKae.Space is

 
pragma Pure;
end McKae.Space;
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-space-unbounded_string_expandable.html0100644000076600007670000003224510212334370022435 0ustar g315padadev Package: McKae.Space.Unbounded_String_Expandable

Package: McKae.Space.Unbounded_String_Expandable

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

An expandable string type that automatically adds to its length when the allocated space has been used up. More efficient that the standard Unbounded_Strings package because it will almost always allocate more space than is needed for whatever is being appended.

Header

package McKae.Space.Unbounded_String_Expandable is

Type Summary

Expandable_String
Primitive Operations:  "<", "<", "<=", "<=", "=", "=", ">", ">", ">=", ">=", Append, Append, Append, Clear, Copy, Destroy, Extract, Get, Length, Slice

Other Items:

type Expandable_String (Initial_Size : Positive := 2000;
                        Expansion    : Positive := 2000) is private;
The expandable string type 
procedure Copy(Target :    out Expandable_String;
               Source : in     Expandable_String);
Make a deep copy of the source string 
procedure Append(Es   : in out Expandable_String;
                 Char : in     Character);
procedure Append(Es  : in out Expandable_String;
                 Str : in     String);
procedure Append(Es      : in out Expandable_String;
                 More_ES : in     Expandable_String);
function Length(Es : Expandable_String) return Natural;
function Get(Es    : Expandable_String;
             Index : Positive) return Character;
function Slice(Es : Expandable_String;
               First : Positive;
               Last  : Natural) return String;
function Extract(Es : Expandable_String) return String;
Return the whole valid part of the expandable string as a string 
procedure Destroy(ES : in out Expandable_String);
procedure Clear (ES : in out Expandable_String);
Destroy the string and deallocate any storage 
function "=" (Left, Right : Expandable_String) return Boolean;
String comparisons 
function "<" (Left, Right : Expandable_String) return Boolean;
function "<="(Left, Right : Expandable_String) return Boolean;
function ">" (Left, Right : Expandable_String) return Boolean;
function ">="(Left, Right : Expandable_String) return Boolean;
function "=" (Left : Expandable_String; Right : String) return Boolean;
function "<" (Left : Expandable_String; Right : String) return Boolean;
function "<="(Left : Expandable_String; Right : String) return Boolean;
function ">" (Left : Expandable_String; Right : String) return Boolean;
function ">="(Left : Expandable_String; Right : String) return Boolean;
private

   --  Implementation-defined ...

end McKae.Space.Unbounded_String_Expandable;
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-xml.html0100644000076600007670000000710010212334370014400 0ustar g315padadev Package: McKae.XML

Package: McKae.XML

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package McKae.XML is

 
pragma Pure;
end McKae.XML;
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-xml-xpath-expressions.html0100644000076600007670000003764310212334371020122 0ustar g315padadev Package: McKae.XML.XPath.Expressions

Package: McKae.XML.XPath.Expressions

Dependencies

with Ada.Strings.Unbounded;
use  Ada.Strings.Unbounded;
with DOM.Core;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package McKae.XML.XPath.Expressions is

Exceptions

Invalid_Coercion
Raised when an expression cannot be coerced to the requested type
Invalid_Expression
Raised when there are problems evaluating an expression, such as wrong number of arguments, incorrect argument types, or simply an unrecognized function name.

Type Summary

Argument_List
Computations
Expression_Value_Types
Expression_Values
Primitive Operations:  Coerce, Compare, Compute, Evaluate_Function
Node_Items
Primitive Operations:  Evaluate_Function
Relational_Operators
Special_Number_Values
String_Ptr

Variables

No_Arguments : Argument_List(1..0);
Empty argument list

Other Items:

type String_Ptr is access all String;
type Node_Items is
   record
      N             : DOM.Core.Node;
      Node_Position : Natural := 0;
      Node_Set_Size : Natural := 0;
   end record;
type Expression_Value_Types is
  (As_String,
   As_Number,
   As_Boolean,
   As_Node_List,
   As_Expr_Text
  );
Types of expression values 
subtype Value_Types is Expression_Value_Types range As_String .. As_Node_List;
type Special_Number_Values is
  (NaN,
   Positive_Infinity,
   Negative_Infinity,
   Normal);
Special otherwise non-representable numeric values 
subtype Special_Numbers is Special_Number_Values range NaN .. Negative_Infinity;
type Expression_Values (Value_Type : Expression_Value_Types := As_String) is
   record
      case Value_Type is
         when As_String | As_Expr_Text =>
            S : Unbounded_String;
         when As_Number =>
            F : Long_Float                  := 0.0;
            Special : Special_Number_Values := Normal;
         when As_Boolean =>
            B : Boolean := False;
         when As_Node_List =>
            Ns: DOM.Core.Node_List;
      end case;
   end record;
Container for the value of an expression 
type Argument_List is array (Natural range <>) of Expression_Values;
List in which function call arguments values are stored 
procedure Coerce
  (Value   : in out Expression_Values;
   -- The value to coerce into a value consistent with the target type

   To_Type : in     Value_Types       := As_String
   -- Target type for the value
  );
Force the value to take on a value consistent with the specified target type. If there is no reasonable value for that type, raise the Invalid_Coercion exception. 
type Relational_Operators is
  (Less_Than,
   Less_Or_Equal,
   Equal,
   Not_Equal,
   Greater_Or_Equal,
   Greater_Than);
Relational operators between two expressions 
function Compare
  (Expr1 : Expression_Values;
   -- Comparison operand 1

   Expr2 : Expression_Values;
   -- Comparison operand 2

   Operator : Relational_Operators
   -- The relationship to evaluate between the two expressions
   ) return Boolean;
Relationally compare the two expressions, returning whether or not the two expressions have the specified relationship. 
type Computations is
  (Add, Subtract, Multiply, Divide, Modulo, Negate);
Basic math computations that can be performed on expressions 
function Compute
  (Expr1 : Expression_Values;
   -- Comparison operand 1

   Expr2 : Expression_Values;
   -- Comparison operand 2

   Computation : Computations
   -- The mathematical operation to perform
   ) return Expression_Values;
Perform the designated computations on the two expression operands. The operands will have their types harmonized, so if that cannot be accomplished, Invalid_Coercion will be raised. For unary minus (negation), Expr2 will be ignored. 
procedure Evaluate_Function (Function_Name : in     String_Ptr;
                             Context_Node  : in     Node_Items;
                             Args          : in out Argument_List;
                             Result        :    out Expression_Values);
Evaluate the core library function in the context of the given node. 
end McKae.XML.XPath.Expressions;
Generated on 2005-03-05 at 07:49:45 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-xml-xpath.html0100644000076600007670000000722210212334371015530 0ustar g315padadev Package: McKae.XML.XPath

Package: McKae.XML.XPath

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package McKae.XML.XPath is

 
pragma Pure;
end McKae.XML.XPath;
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-xml-xpath-locations.html0100644000076600007670000004004310212334371017517 0ustar g315padadev Package: McKae.XML.XPath.Locations

Package: McKae.XML.XPath.Locations

Dependencies

with Ada.Strings.Unbounded;
with McKae.XML.XPath.Predicates;
with Unicode.CES;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package McKae.XML.XPath.Locations is

Type Summary

Axes
Axes_Directionality
Location_Path_Steps
Location_Path_Steps_Handle
Location_Paths
Primitive Operations:  Free, Get_Path
Location_Steps
Primitive Operations:  Add
Node_Test_Specification
Node_Tests

Constants and Named Numbers

Forward_Axis : constant Axes_Directionality := not Reverse_Axis;
No_Axis : constant Axes := Child_Axis;
No explicit axis implies the child axis 
Reverse_Axis : constant Axes_Directionality :=
  (Ancestor_Axis | Ancestor_Or_Self_Axis | Preceding_Axis | Preceding_Sibling_Axis => True,
   others => False);

Other Items:

use Ada.Strings.Unbounded;
use McKae.XML.XPath;
type Axes is
  (Child_Axis,
   Parent_Axis,
   Self_Axis,
   Preceding_Sibling_Axis,
   Following_Sibling_Axis,
   Ancestor_Axis,
   Ancestor_Or_Self_Axis,
   Namespace_Axis,
   Attribute_Axis,

   Descendant_Or_Self_Axis,
   Descendant_Axis,
   Following_Axis,

   Preceding_Axis);
XPath axes 
subtype Immediate_Axes is Axes range Child_Axis .. Attribute_Axis;
Axes whose traversal consists of immediate, direct traversals 
subtype Branched_Axes is Axes range Descendant_Or_Self_Axis .. Preceding_Axis;
Axes whose traversal requires the traversal of branchings 
type Axes_Directionality is array (Axes) of Boolean;
type Node_Tests is
  (No_Node_Test,
   QName_Node_Test,
   NCName_Node_Test,
   Text_Node_Test,
   Comment_Node_Test,
   Processing_Instruction_Node_Test,
   Node_Node_Test);
Kinds of node tests 
type Node_Test_Specification
  (Node_Test : Node_Tests := No_Node_Test) is
   record
      Name : Unbounded_String;
      case Node_Test is
         when QName_Node_Test =>
            Prefix : Unbounded_String;
         when No_Node_Test   |
           NCName_Node_Test   |
           Text_Node_Test    |
           Comment_Node_Test |
           Processing_Instruction_Node_Test |
           Node_Node_Test =>
            null;
      end case;
   end record;
Specification of the node test portion of a location step 
type Location_Steps is record
   Axis                : Axes := No_Axis;
   Node_Test           : Node_Test_Specification;
   Location_Predicates : Predicates.Predicate_Handles;
   Output_Step         : Boolean := False;
end record;
Location step, the part in between '/'s 
type Location_Path_Steps is array (Natural range <>) of Location_Steps;
A sequence of location steps 
type Location_Path_Steps_Handle is access Location_Path_Steps;
type Location_Paths is
   record
      Absolute : Boolean;
      Steps    : Natural := 0;
      Path     : Location_Path_Steps_Handle := new Location_Path_Steps(1 .. 10);
   end record;
subtype Xpath_String is Unicode.CES.Byte_Sequence;
Redefinition of strings to be compatible with the DOM interface 
procedure Add (
               Location_Step : in     Location_Steps
               -- Newly defined location step
              );
Add a newly defined location step to the path 
function Get_Path return Location_Paths;
Return the location path structure generated by parsing the Xpath query. IMPORTANT! The Location_Path returned by this function must be subsequently freed using the corresponding Free procedure. 
procedure Free(Location_Path : in out Location_Paths);
Release the resources used by the construction of a location path 
procedure Reset_For_Parsing;
Reset the location path processing for a new query. This must be called before invoking the Xia_Parser_Model.Pathify procedure. 
end McKae.XML.XPath.Locations;
Generated on 2005-03-05 at 07:49:45 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-xml-xpath-node_sets.html0100644000076600007670000003726210212334403017514 0ustar g315padadev Package: McKae.XML.XPath.Node_Sets

Package: McKae.XML.XPath.Node_Sets

Dependencies

with BC.Containers.Collections.Unbounded;
with BC.Containers.Sets.Unbounded;
with BC.Containers.Trees.AVL;
with BC.Support.Standard_Storage;

with DOM.Core;
use  DOM.Core;

with McKae.XML.XPath.Locations;
use  McKae.XML.XPath.Locations;
with McKae.Space.Unbounded_String_Expandable;
use  McKae.Space.Unbounded_String_Expandable;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Record information about node-set member nodes

Header

package McKae.XML.XPath.Node_Sets is

Type Summary

Current_Matchings
Primitive Operations:  Append, Insert
Set derived from Collection
Overridden Operations:  Append, Clear, Insert, Null_Container
New Operations:  Union
Inherited Operations:  "=", Append, Available, First, Insert, Is_Empty, Item_At, Last, Length, Location, New_Iterator, Remove, Replace
Sortable_Matches
Primitive Operations:  "<"

Other Items:

type Current_Matchings (Axis : Axes := No_Axis) is record
   Matching_Node : Node;

   case Axis is
      when Attribute_Axis =>
         Owner_Node  : Node;    -- Work around bug in XMLAda wherein the
                                -- parent node of an attribute is always
                                -- set to Null, making it impossible to
                                -- get the owner element
         Attr_Index  : Natural;

      when Branched_Axes =>
         Branch_Step : Location_Steps;

      when others =>
         null;
   end case;
end record;
package Matchings_Containers is new BC.Containers (Item => Current_Matchings);
package Matchings_Collections is new Matchings_Containers.Collections;
package Matchings_Sets is new Matchings_Collections.Unbounded
  (Storage => BC.Support.Standard_Storage.Pool);
type Set is new Matchings_Sets.Collection with private;
function Null_Container return Set;
procedure Insert (C : in out Set; Elem : Current_Matchings);
procedure Append (C : in out Set; Elem : Current_Matchings);
Add the item to the front of the collection, if it is not already in the set 
procedure Clear (C : in out Set);
Add the item to the collection, starting at the end, if it is not already in the set 
procedure Union (S : in out Set; O : Set);
Empty the collection of all items. 
type Sortable_Matches is record
   Key          : Expandable_String;
   Matched_Node : Node;
end record;
function "<"(L, R : Sortable_Matches) return Boolean;
package Sorting_Containers is new BC.Containers (Item => Sortable_Matches);
package Match_Trees is new Sorting_Containers.Trees;
package Sortable_Matching_Tree is new Match_Trees.AVL
  (Storage => BC.Support.Standard_Storage.Pool);
private

   --  Implementation-defined ...

end McKae.XML.XPath.Node_Sets;
Generated on 2005-03-05 at 07:49:55 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-xml-xpath-predicates-evaluation.html0100644000076600007670000001300410212334403022005 0ustar g315padadev Package: McKae.XML.XPath.Predicates.Evaluation

Package: McKae.XML.XPath.Predicates.Evaluation

Dependencies

with McKae.XML.XPath.Node_Sets;
with McKae.XML.XPath.Locations;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package McKae.XML.XPath.Predicates.Evaluation is

Other Items:

procedure Evaluate_Predicate (Nodes            : in out Node_Sets.Set;
                              -- Node set to filter (these were attracted via the
                              -- axis and node test

                              Handle           : in     Predicate_Handles;
                              -- The list of predicate filters to run the node
                              -- set through

                              Originating_Axis : in     Locations.Axes
                              -- The axis via which the node set was selected
                             );
end McKae.XML.XPath.Predicates.Evaluation;
Generated on 2005-03-05 at 07:49:55 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-xml-xpath-predicates.html0100644000076600007670000001602510212334402017645 0ustar g315padadev Package: McKae.XML.XPath.Predicates

Package: McKae.XML.XPath.Predicates

Dependencies

with BC.Containers.Collections.Ordered.Unbounded;
with BC.Support.Standard_Storage;
with xia_parser_Model;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Handle to the predicate content

Header

package McKae.XML.XPath.Predicates is

Exceptions

Malformed_Predicate
Raised when a supplied query predicate does not conform to predicate syntax

Type Summary

Predicate_Handles
Primitive Operations:  Add_Predicate_Parse, Release

Constants and Named Numbers

Null_Predicate : constant Predicate_Handles;
Null instances of a predicate definition

Other Items:

type Predicate_Handles is private;
procedure Add_Predicate_Parse
  (Handle : in out Predicate_Handles;
   T      : in     xia_parser_Model.Parseable_Ptr);
Add the pointer to the root node of a parse subtree that was created for a predicate 
procedure Release(Handle : in out Predicate_Handles);
Release the contents of a predicate handle (which may consists of one or more individual predicate definitions). Not that this does _not_ release the associated parse subtree associated with each predicate instance. 
private

   --  Implementation-defined ...

end McKae.XML.XPath.Predicates;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-xml-xpath-query_handling.html0100644000076600007670000001326110212334403020533 0ustar g315padadev Package: McKae.XML.XPath.Query_Handling

Package: McKae.XML.XPath.Query_Handling

Dependencies

with McKae.XML.XPath.Locations;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package McKae.XML.XPath.Query_Handling is

Exceptions

Malformed_Query

Other Items:

use McKae.XML.XPath;
function Pathify(
                 Xpath_Query : Locations.Xpath_String
                 -- The XPath query to decode
                ) return Locations.Location_Paths;
Decode the string representation of the location path into its components parts 
procedure Free(Location_Path : in out Locations.Location_Paths);
Release the resources used by the construction of a location path 
end McKae.XML.XPath.Query_Handling;
Generated on 2005-03-05 at 07:49:55 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/mckae-xml-xpath-xia.html0100644000076600007670000001257310212334404016311 0ustar g315padadev Package: McKae.XML.XPath.XIA

Package: McKae.XML.XPath.XIA

Dependencies

with DOM.Core;

Description

XIA - XPath In Ada - An XPath Implementation for Ada 95

Copyright (C) 2004 McKae Technologies

This library is free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later ver- sion. DTraq is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License. DTraq is maintained by McKae Technologies (http://www.dtraq.com).

XIA (XPathInAda) is a native Ada implementation for querying XML documents using the XPath 1.0 query language.

Known limitations:

The core library function "id" is not yet implemented, as the XMLAda function Get_Element_By_ID is not yet implemented. Therfore invoking "id" will always result in an empty node-set.

Header

package McKae.XML.XPath.XIA is

Exceptions

Inappropriate_Node
Raised when the starting node does not correspond to the type of query
Malformed_XPath
Raised when the XPath query does not conform to XPath syntax.

Other Items:

function XPath_Query
  (N     : DOM.Core.Node;
   -- A node in the XML tree against which the XPath query is
   --  submitted.

   XPath : String
   -- The XPath query.
  ) return DOM.Core.Node_List;
end McKae.XML.XPath.XIA;
Generated on 2005-03-05 at 07:49:56 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/unicode-ces.html0100644000076600007670000003147110212334370014730 0ustar g315padadev Package: Unicode.CES

Package: Unicode.CES

Dependencies

with Unchecked_Deallocation;

Description

This is the root of the hierarchy that provides different encoding schemes. Each of the child package provides function to convert to and from Utf32-encoded string, which thus acts as the central encoding scheme. In some cases, the string can be preceded by a BOM (byte-order mark), that indicates the encoding used and the byte-order used for the encoding. This BOM is always optional, and can never be mixed up with other characters. Byte sequence

Header

package Unicode.CES is

Exceptions

Invalid_Encoding
Raised whener the byte sequence associated with a given encoding scheme is not valid.

Type Summary

Bom_Type
Byte_Order
Byte_Sequence_Access
Encode_Function
Encoding_Scheme
Primitive Operations:  Index_From_Offset
Length_Function
Read_Function
Width_Function

Constants and Named Numbers

Default_Byte_Order : constant Byte_Order := Low_Byte_First;
Order of bytes in word machines.

Other Items:

subtype Byte_Sequence is String;
type Byte_Sequence_Access is access all Byte_Sequence;
procedure Free is new Unchecked_Deallocation
  (Byte_Sequence, Byte_Sequence_Access);
A sequence of bytes. The encoding is unknown. 
type Byte_Order is (High_Byte_First, Low_Byte_First);
Byte order handling 
type Bom_Type is
  (Utf8_All,  --  Utf8-encoding
   Utf16_LE,  --  Utf16 little-endian encoding
   Utf16_BE,  --  Utf16 big-endian encoding
   Utf32_LE,  --  Utf32 little-endian encoding
   Utf32_BE,  --  Utf32 big-endian encoding
   Ucs4_BE,   --  UCS-4, big endian machine (1234 order)
   Ucs4_LE,   --  UCS-4, little endian machine (4321 order)
   Ucs4_2143, --  UCS-4, unusual byte order (2143 order)
   Ucs4_3412, --  UCS-4, unusual byte order (3412 order)
   Unknown);
Byte-order mark handling 
subtype Bom_Type_Utf16 is Bom_Type range Utf16_LE .. Utf16_BE;
the type of encoding used for a string, that can be deduced from the BOM. 
subtype Bom_Type_Utf32 is Bom_Type range Utf32_LE .. Utf32_BE;
procedure Read_Bom
  (Str : String;
   Len : out Natural;
   BOM : out Bom_Type;
   XML_Support : Boolean := True);
type Read_Function is access
  procedure (Str   : Byte_Sequence;
             Index : in out Positive;
             Char  : out Unicode_Char);
All the packages in this hierarchy must provide at least two functions to read from a string (whatever its encoding).

These can be used to completly parse a string. J := Str'First; while J <= Str'Last loop C := Read (Str, J); -- Read the character J := J + Width (C); -- Move to the next end loop; 

type Width_Function is access
  function (Char : Unicode.Unicode_Char) return Natural;
This function returns the character at position Index in the byte sequence Str, and moves Index to the start of the next character. 
type Encode_Function is access
  procedure (Char   : Unicode_Char;
             Output : in out Byte_Sequence;
             Index  : in out Natural);
This function returns the number of bytes that encode Char in the specific encoding scheme. 
type Length_Function is access
  function (Str : Byte_Sequence) return Natural;
This function converts Char to the appropriate byte sequence that represents it in the specific encoding. The byte sequence is stored in Output, starting at Index + 1. On exit, Index is left on the last character set in Output. 
type Encoding_Scheme is record
   Read            : Read_Function;
   Width           : Width_Function;
   Encode          : Encode_Function;
   Length          : Length_Function;
end record;
function Index_From_Offset
  (Str : Byte_Sequence; Offset : Natural; Encoding : Encoding_Scheme)
   return Integer;
Misc functions 
end Unicode.CES;
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/unicode.html0100644000076600007670000001520210212334370014152 0ustar g315padadev Package: Unicode

Package: Unicode

Description

In the package below, all the functions Is_* are based on values defined in the XML standard. Several child packages are provided, that support different encoding forms, and can all convert from and to Utf32, which thus behaves as the reference.

Header

package Unicode is

Known child units

Unicode.CES(package)

Type Summary

Unicode_Char

Other Items:

type Unicode_Char is mod 2**32;
function Is_White_Space (Char : Unicode_Char) return Boolean;
A code point associated with a given character, taken in the Unicode repertoire. Note that by design, the first 127 entries are taken in the ASCII set and are fully compatible. You can thus easily compare this with constant characters by using Character'Pos ('.') 
function Is_Letter (Char : Unicode_Char) return Boolean;
Return True if Char is a space character, ie a space, horizontal tab, line feed or carriage return. 
function Is_Base_Char (Char : Unicode_Char) return Boolean;
True if Char is a letter. 
function Is_Digit (Char : Unicode_Char) return Boolean;
True if Char is a base character. 
function Is_Combining_Char (Char : Unicode_Char) return Boolean;
True if Char is a digit. 
function Is_Extender (Char : Unicode_Char) return Boolean;
True if Char is a combining character (ie a character that applies to the preceding character to change its meaning, like accents in latin-1). 
function Is_Ideographic (Char : Unicode_Char) return Boolean;
True if Char is an extender character. 
function To_Unicode (C : Character) return Unicode_Char;
True if Char is an ideographic character (asian languages). 
private

   --  Implementation-defined ...

end Unicode;
Generated on 2005-03-05 at 07:49:44 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/xia_parser_dfa.html0100644000076600007670000001750010212334402015472 0ustar g315padadev Package: xia_parser_dfa

Package: xia_parser_dfa

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package xia_parser_dfa is

Type Summary

unbounded_character_array

Constants and Named Numbers

YY_BUF_SIZE : constant Integer := YY_READ_BUF_SIZE * 2;
YY_READ_BUF_SIZE : constant Integer := 8192;
yy_ch_buf has to be 2 characters longer than YY_BUF_SIZE because we need to put in 2 end-of-buffer characters (this is explained where it is done) at the end of yy_ch_buf

Variables

aflex_debug : Boolean := False;
yy_c_buf_p : Integer;
yy_ch_buf : ch_buf_type;
yy_cp, yy_bp : Integer;
yy_hold_char : Character;
yy_hold_char holds the character lost when yytext is formed
yy_init : Boolean := True;
These variables are needed between calls to YYLex.
yy_last_accepting_cpos : Integer;
yy_last_accepting_state : yy_state_type;
yy_start : Integer := 0;
yytext_ptr : Integer;

Other Items:

type unbounded_character_array is array(Integer range <>) of Character;
subtype ch_buf_type is unbounded_character_array(0..YY_BUF_SIZE + 1);
function YYText return String;
function YYLength return Integer;
procedure YY_DO_BEFORE_ACTION;
subtype yy_state_type is Integer;
end xia_parser_dfa;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/xia_parser_goto.html0100644000076600007670000011042710212334405015715 0ustar g315padadev Package: Xia_Parser_Goto

Package: Xia_Parser_Goto

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package Xia_Parser_Goto is

Type Summary

Goto_Entry
Goto_Parse_Table
Small_Integer

Constants and Named Numbers

Goto_Matrix : constant Goto_Parse_Table :=
   ((-1,-1)  -- Dummy Entry.
-- State  0
,(-71, 54),(-70, 53),(-68, 36),(-67, 35)
,(-66, 17),(-64, 13),(-63, 18),(-62, 12)
,(-60, 9),(-58, 8),(-57, 5),(-56, 4)
,(-55, 7),(-54, 3),(-53, 2),(-52, 1)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-26, 52),(-23, 14),(-22, 15)
,(-21, 6),(-20, 11),(-17, 19),(-3, 60)
,(-2, 73)
-- State  1

-- State  2
,(-21, 74),(-20, 75)
-- State  3

-- State  4

-- State  5

-- State  6
,(-71, 54)
,(-70, 53),(-68, 36),(-67, 35),(-66, 17)
,(-64, 13),(-63, 18),(-62, 12),(-60, 9)
,(-58, 8),(-57, 5),(-56, 4),(-53, 76)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-26, 52),(-23, 14),(-22, 15)
,(-17, 19),(-3, 60)
-- State  7

-- State  8
,(-59, 77)
-- State  9

-- State  10

-- State  11
,(-71, 54)
,(-70, 53),(-68, 36),(-67, 35),(-66, 17)
,(-64, 13),(-63, 18),(-62, 12),(-60, 9)
,(-58, 8),(-57, 5),(-56, 4),(-53, 78)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-26, 52),(-23, 14),(-22, 15)
,(-17, 19),(-3, 60)
-- State  12
,(-71, 54),(-70, 53)
,(-68, 36),(-67, 35),(-66, 79),(-63, 80)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-26, 52),(-3, 60)
-- State  13

-- State  14

-- State  15

-- State  16

-- State  17
,(-18, 82)

-- State  18

-- State  19
,(-71, 54),(-70, 53),(-68, 36),(-67, 35)
,(-66, 79),(-63, 83),(-51, 22),(-50, 23)
,(-49, 24),(-48, 25),(-47, 26),(-46, 27)
,(-45, 28),(-44, 29),(-43, 30),(-42, 31)
,(-41, 32),(-40, 33),(-39, 34),(-38, 55)
,(-37, 56),(-36, 37),(-35, 57),(-34, 61)
,(-33, 64),(-32, 63),(-31, 62),(-26, 52)
,(-3, 60)
-- State  20

-- State  21

-- State  22

-- State  23

-- State  24

-- State  25

-- State  26

-- State  27

-- State  28

-- State  29

-- State  30

-- State  31

-- State  32

-- State  33

-- State  34

-- State  35

-- State  36
,(-30, 85)
-- State  37
,(-30, 86)
-- State  38

-- State  39

-- State  40

-- State  41

-- State  42

-- State  43

-- State  44

-- State  45

-- State  46

-- State  47

-- State  48

-- State  49

-- State  50

-- State  51

-- State  52

-- State  53

-- State  54
,(-19, 88)

-- State  55

-- State  56

-- State  57

-- State  58

-- State  59

-- State  60

-- State  61

-- State  62

-- State  63

-- State  64

-- State  65

-- State  66

-- State  67

-- State  68

-- State  69

-- State  70

-- State  71

-- State  72

-- State  73

-- State  74
,(-71, 54),(-70, 53),(-68, 36),(-67, 35)
,(-66, 17),(-64, 13),(-63, 18),(-62, 12)
,(-60, 9),(-58, 8),(-56, 90),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 37),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-26, 52),(-23, 14),(-22, 15),(-17, 19)
,(-3, 60)
-- State  75
,(-71, 54),(-70, 53),(-68, 36)
,(-67, 35),(-66, 17),(-64, 13),(-63, 18)
,(-62, 12),(-60, 9),(-58, 8),(-56, 91)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-26, 52),(-23, 14),(-22, 15)
,(-17, 19),(-3, 60)
-- State  76
,(-21, 74),(-20, 75)

-- State  77
,(-61, 94),(-28, 92)
-- State  78
,(-21, 74),(-20, 75)

-- State  79

-- State  80

-- State  81

-- State  82

-- State  83

-- State  84

-- State  85
,(-29, 96)
-- State  86
,(-69, 101),(-7, 98),(-6, 97)

-- State  87

-- State  88
,(-71, 105),(-68, 102),(-66, 79),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 103),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-26, 104),(-3, 60)
-- State  89

-- State  90

-- State  91

-- State  92
,(-89, 113),(-88, 112)
,(-87, 111),(-86, 110),(-85, 109),(-84, 108)
,(-83, 119),(-82, 116),(-81, 114),(-78, 129)
,(-77, 125),(-76, 124),(-75, 121),(-74, 120)
,(-73, 107),(-72, 106),(-71, 54),(-70, 133)
,(-69, 123),(-68, 36),(-67, 35),(-66, 17)
,(-65, 134),(-64, 13),(-63, 18),(-62, 12)
,(-60, 9),(-58, 8),(-57, 5),(-56, 4)
,(-55, 7),(-54, 3),(-53, 2),(-52, 118)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-30, 122),(-26, 52),(-24, 115)
,(-23, 14),(-22, 15),(-21, 6),(-20, 11)
,(-17, 19),(-15, 126),(-7, 98),(-6, 97)
,(-5, 127),(-4, 128),(-3, 60)
-- State  93

-- State  94

-- State  95

-- State  96

-- State  97

-- State  98

-- State  99

-- State  100

-- State  101
,(-29, 135)

-- State  102

-- State  103

-- State  104

-- State  105

-- State  106

-- State  107
,(-31, 136)
-- State  108
,(-34, 137)
-- State  109
,(-13, 140),(-12, 141)

-- State  110
,(-11, 147),(-10, 149),(-9, 146),(-8, 148)

-- State  111
,(-25, 151),(-24, 152)
-- State  112
,(-33, 154),(-32, 155)
,(-26, 153)
-- State  113

-- State  114
,(-14, 157)
-- State  115
,(-89, 158),(-83, 119)
,(-82, 116),(-81, 114),(-78, 129),(-77, 125)
,(-76, 124),(-75, 121),(-74, 120),(-71, 54)
,(-70, 133),(-69, 123),(-68, 36),(-67, 35)
,(-66, 17),(-64, 13),(-63, 18),(-62, 12)
,(-60, 9),(-58, 8),(-57, 5),(-56, 4)
,(-55, 7),(-54, 3),(-53, 2),(-52, 118)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-30, 122),(-26, 52),(-24, 115)
,(-23, 14),(-22, 15),(-21, 6),(-20, 11)
,(-17, 19),(-15, 126),(-7, 98),(-6, 97)
,(-5, 127),(-4, 128),(-3, 60)
-- State  116

-- State  117

-- State  118

-- State  119
,(-61, 161)
,(-28, 92),(-21, 159),(-20, 160)
-- State  120

-- State  121

-- State  122
,(-89, 113)
,(-88, 112),(-87, 111),(-86, 110),(-85, 109)
,(-84, 108),(-83, 119),(-82, 116),(-81, 114)
,(-78, 129),(-77, 125),(-76, 124),(-75, 121)
,(-74, 120),(-73, 107),(-72, 162),(-71, 54)
,(-70, 133),(-69, 123),(-68, 36),(-67, 35)
,(-66, 17),(-64, 13),(-63, 18),(-62, 12)
,(-60, 9),(-58, 8),(-57, 5),(-56, 4)
,(-55, 7),(-54, 3),(-53, 2),(-52, 118)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-30, 122),(-26, 52),(-24, 115)
,(-23, 14),(-22, 15),(-21, 6),(-20, 11)
,(-17, 19),(-15, 126),(-7, 98),(-6, 97)
,(-5, 127),(-4, 128),(-3, 60)
-- State  123

-- State  124

-- State  125

-- State  126
,(-71, 163)
,(-70, 164),(-68, 102),(-66, 79),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 103),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-3, 60)
-- State  127

-- State  128

-- State  129
,(-30, 165)
-- State  130

-- State  131

-- State  132

-- State  133

-- State  134
,(-27, 167)
-- State  135

-- State  136
,(-89, 113)
,(-88, 112),(-87, 111),(-86, 110),(-85, 109)
,(-84, 168),(-83, 119),(-82, 116),(-81, 114)
,(-78, 129),(-77, 125),(-76, 124),(-75, 121)
,(-74, 120),(-71, 54),(-70, 133),(-69, 123)
,(-68, 36),(-67, 35),(-66, 17),(-64, 13)
,(-63, 18),(-62, 12),(-60, 9),(-58, 8)
,(-57, 5),(-56, 4),(-55, 7),(-54, 3)
,(-53, 2),(-52, 118),(-51, 22),(-50, 23)
,(-49, 24),(-48, 25),(-47, 26),(-46, 27)
,(-45, 28),(-44, 29),(-43, 30),(-42, 31)
,(-41, 32),(-40, 33),(-39, 34),(-38, 55)
,(-37, 56),(-36, 37),(-35, 57),(-34, 61)
,(-33, 64),(-32, 63),(-31, 62),(-30, 122)
,(-26, 52),(-24, 115),(-23, 14),(-22, 15)
,(-21, 6),(-20, 11),(-17, 19),(-15, 126)
,(-7, 98),(-6, 97),(-5, 127),(-4, 128)
,(-3, 60)
-- State  137
,(-89, 113),(-88, 112),(-87, 111)
,(-86, 110),(-85, 169),(-83, 119),(-82, 116)
,(-81, 114),(-78, 129),(-77, 125),(-76, 124)
,(-75, 121),(-74, 120),(-71, 54),(-70, 133)
,(-69, 123),(-68, 36),(-67, 35),(-66, 17)
,(-64, 13),(-63, 18),(-62, 12),(-60, 9)
,(-58, 8),(-57, 5),(-56, 4),(-55, 7)
,(-54, 3),(-53, 2),(-52, 118),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 37),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-30, 122),(-26, 52),(-24, 115),(-23, 14)
,(-22, 15),(-21, 6),(-20, 11),(-17, 19)
,(-15, 126),(-7, 98),(-6, 97),(-5, 127)
,(-4, 128),(-3, 60)
-- State  138

-- State  139

-- State  140
,(-89, 113),(-88, 112)
,(-87, 111),(-86, 170),(-83, 119),(-82, 116)
,(-81, 114),(-78, 129),(-77, 125),(-76, 124)
,(-75, 121),(-74, 120),(-71, 54),(-70, 133)
,(-69, 123),(-68, 36),(-67, 35),(-66, 17)
,(-64, 13),(-63, 18),(-62, 12),(-60, 9)
,(-58, 8),(-57, 5),(-56, 4),(-55, 7)
,(-54, 3),(-53, 2),(-52, 118),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 37),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-30, 122),(-26, 52),(-24, 115),(-23, 14)
,(-22, 15),(-21, 6),(-20, 11),(-17, 19)
,(-15, 126),(-7, 98),(-6, 97),(-5, 127)
,(-4, 128),(-3, 60)
-- State  141
,(-89, 113),(-88, 112)
,(-87, 111),(-86, 171),(-83, 119),(-82, 116)
,(-81, 114),(-78, 129),(-77, 125),(-76, 124)
,(-75, 121),(-74, 120),(-71, 54),(-70, 133)
,(-69, 123),(-68, 36),(-67, 35),(-66, 17)
,(-64, 13),(-63, 18),(-62, 12),(-60, 9)
,(-58, 8),(-57, 5),(-56, 4),(-55, 7)
,(-54, 3),(-53, 2),(-52, 118),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 37),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-30, 122),(-26, 52),(-24, 115),(-23, 14)
,(-22, 15),(-21, 6),(-20, 11),(-17, 19)
,(-15, 126),(-7, 98),(-6, 97),(-5, 127)
,(-4, 128),(-3, 60)
-- State  142

-- State  143

-- State  144

-- State  145

-- State  146
,(-89, 113),(-88, 112)
,(-87, 172),(-83, 119),(-82, 116),(-81, 114)
,(-78, 129),(-77, 125),(-76, 124),(-75, 121)
,(-74, 120),(-71, 54),(-70, 133),(-69, 123)
,(-68, 36),(-67, 35),(-66, 17),(-64, 13)
,(-63, 18),(-62, 12),(-60, 9),(-58, 8)
,(-57, 5),(-56, 4),(-55, 7),(-54, 3)
,(-53, 2),(-52, 118),(-51, 22),(-50, 23)
,(-49, 24),(-48, 25),(-47, 26),(-46, 27)
,(-45, 28),(-44, 29),(-43, 30),(-42, 31)
,(-41, 32),(-40, 33),(-39, 34),(-38, 55)
,(-37, 56),(-36, 37),(-35, 57),(-34, 61)
,(-33, 64),(-32, 63),(-31, 62),(-30, 122)
,(-26, 52),(-24, 115),(-23, 14),(-22, 15)
,(-21, 6),(-20, 11),(-17, 19),(-15, 126)
,(-7, 98),(-6, 97),(-5, 127),(-4, 128)
,(-3, 60)
-- State  147
,(-89, 113),(-88, 112),(-87, 173)
,(-83, 119),(-82, 116),(-81, 114),(-78, 129)
,(-77, 125),(-76, 124),(-75, 121),(-74, 120)
,(-71, 54),(-70, 133),(-69, 123),(-68, 36)
,(-67, 35),(-66, 17),(-64, 13),(-63, 18)
,(-62, 12),(-60, 9),(-58, 8),(-57, 5)
,(-56, 4),(-55, 7),(-54, 3),(-53, 2)
,(-52, 118),(-51, 22),(-50, 23),(-49, 24)
,(-48, 25),(-47, 26),(-46, 27),(-45, 28)
,(-44, 29),(-43, 30),(-42, 31),(-41, 32)
,(-40, 33),(-39, 34),(-38, 55),(-37, 56)
,(-36, 37),(-35, 57),(-34, 61),(-33, 64)
,(-32, 63),(-31, 62),(-30, 122),(-26, 52)
,(-24, 115),(-23, 14),(-22, 15),(-21, 6)
,(-20, 11),(-17, 19),(-15, 126),(-7, 98)
,(-6, 97),(-5, 127),(-4, 128),(-3, 60)

-- State  148
,(-89, 113),(-88, 112),(-87, 174),(-83, 119)
,(-82, 116),(-81, 114),(-78, 129),(-77, 125)
,(-76, 124),(-75, 121),(-74, 120),(-71, 54)
,(-70, 133),(-69, 123),(-68, 36),(-67, 35)
,(-66, 17),(-64, 13),(-63, 18),(-62, 12)
,(-60, 9),(-58, 8),(-57, 5),(-56, 4)
,(-55, 7),(-54, 3),(-53, 2),(-52, 118)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-30, 122),(-26, 52),(-24, 115)
,(-23, 14),(-22, 15),(-21, 6),(-20, 11)
,(-17, 19),(-15, 126),(-7, 98),(-6, 97)
,(-5, 127),(-4, 128),(-3, 60)
-- State  149
,(-89, 113)
,(-88, 112),(-87, 175),(-83, 119),(-82, 116)
,(-81, 114),(-78, 129),(-77, 125),(-76, 124)
,(-75, 121),(-74, 120),(-71, 54),(-70, 133)
,(-69, 123),(-68, 36),(-67, 35),(-66, 17)
,(-64, 13),(-63, 18),(-62, 12),(-60, 9)
,(-58, 8),(-57, 5),(-56, 4),(-55, 7)
,(-54, 3),(-53, 2),(-52, 118),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 37),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-30, 122),(-26, 52),(-24, 115),(-23, 14)
,(-22, 15),(-21, 6),(-20, 11),(-17, 19)
,(-15, 126),(-7, 98),(-6, 97),(-5, 127)
,(-4, 128),(-3, 60)
-- State  150

-- State  151
,(-89, 113),(-88, 176)
,(-83, 119),(-82, 116),(-81, 114),(-78, 129)
,(-77, 125),(-76, 124),(-75, 121),(-74, 120)
,(-71, 54),(-70, 133),(-69, 123),(-68, 36)
,(-67, 35),(-66, 17),(-64, 13),(-63, 18)
,(-62, 12),(-60, 9),(-58, 8),(-57, 5)
,(-56, 4),(-55, 7),(-54, 3),(-53, 2)
,(-52, 118),(-51, 22),(-50, 23),(-49, 24)
,(-48, 25),(-47, 26),(-46, 27),(-45, 28)
,(-44, 29),(-43, 30),(-42, 31),(-41, 32)
,(-40, 33),(-39, 34),(-38, 55),(-37, 56)
,(-36, 37),(-35, 57),(-34, 61),(-33, 64)
,(-32, 63),(-31, 62),(-30, 122),(-26, 52)
,(-24, 115),(-23, 14),(-22, 15),(-21, 6)
,(-20, 11),(-17, 19),(-15, 126),(-7, 98)
,(-6, 97),(-5, 127),(-4, 128),(-3, 60)

-- State  152
,(-89, 113),(-88, 177),(-83, 119),(-82, 116)
,(-81, 114),(-78, 129),(-77, 125),(-76, 124)
,(-75, 121),(-74, 120),(-71, 54),(-70, 133)
,(-69, 123),(-68, 36),(-67, 35),(-66, 17)
,(-64, 13),(-63, 18),(-62, 12),(-60, 9)
,(-58, 8),(-57, 5),(-56, 4),(-55, 7)
,(-54, 3),(-53, 2),(-52, 118),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 37),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-30, 122),(-26, 52),(-24, 115),(-23, 14)
,(-22, 15),(-21, 6),(-20, 11),(-17, 19)
,(-15, 126),(-7, 98),(-6, 97),(-5, 127)
,(-4, 128),(-3, 60)
-- State  153
,(-89, 178),(-83, 119)
,(-82, 116),(-81, 114),(-78, 129),(-77, 125)
,(-76, 124),(-75, 121),(-74, 120),(-71, 54)
,(-70, 133),(-69, 123),(-68, 36),(-67, 35)
,(-66, 17),(-64, 13),(-63, 18),(-62, 12)
,(-60, 9),(-58, 8),(-57, 5),(-56, 4)
,(-55, 7),(-54, 3),(-53, 2),(-52, 118)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-30, 122),(-26, 52),(-24, 115)
,(-23, 14),(-22, 15),(-21, 6),(-20, 11)
,(-17, 19),(-15, 126),(-7, 98),(-6, 97)
,(-5, 127),(-4, 128),(-3, 60)
-- State  154
,(-89, 179)
,(-83, 119),(-82, 116),(-81, 114),(-78, 129)
,(-77, 125),(-76, 124),(-75, 121),(-74, 120)
,(-71, 54),(-70, 133),(-69, 123),(-68, 36)
,(-67, 35),(-66, 17),(-64, 13),(-63, 18)
,(-62, 12),(-60, 9),(-58, 8),(-57, 5)
,(-56, 4),(-55, 7),(-54, 3),(-53, 2)
,(-52, 118),(-51, 22),(-50, 23),(-49, 24)
,(-48, 25),(-47, 26),(-46, 27),(-45, 28)
,(-44, 29),(-43, 30),(-42, 31),(-41, 32)
,(-40, 33),(-39, 34),(-38, 55),(-37, 56)
,(-36, 37),(-35, 57),(-34, 61),(-33, 64)
,(-32, 63),(-31, 62),(-30, 122),(-26, 52)
,(-24, 115),(-23, 14),(-22, 15),(-21, 6)
,(-20, 11),(-17, 19),(-15, 126),(-7, 98)
,(-6, 97),(-5, 127),(-4, 128),(-3, 60)

-- State  155
,(-89, 180),(-83, 119),(-82, 116),(-81, 114)
,(-78, 129),(-77, 125),(-76, 124),(-75, 121)
,(-74, 120),(-71, 54),(-70, 133),(-69, 123)
,(-68, 36),(-67, 35),(-66, 17),(-64, 13)
,(-63, 18),(-62, 12),(-60, 9),(-58, 8)
,(-57, 5),(-56, 4),(-55, 7),(-54, 3)
,(-53, 2),(-52, 118),(-51, 22),(-50, 23)
,(-49, 24),(-48, 25),(-47, 26),(-46, 27)
,(-45, 28),(-44, 29),(-43, 30),(-42, 31)
,(-41, 32),(-40, 33),(-39, 34),(-38, 55)
,(-37, 56),(-36, 37),(-35, 57),(-34, 61)
,(-33, 64),(-32, 63),(-31, 62),(-30, 122)
,(-26, 52),(-24, 115),(-23, 14),(-22, 15)
,(-21, 6),(-20, 11),(-17, 19),(-15, 126)
,(-7, 98),(-6, 97),(-5, 127),(-4, 128)
,(-3, 60)
-- State  156

-- State  157
,(-83, 119),(-82, 181),(-78, 129)
,(-77, 125),(-76, 124),(-75, 121),(-74, 120)
,(-71, 54),(-70, 133),(-69, 123),(-68, 36)
,(-67, 35),(-66, 17),(-64, 13),(-63, 18)
,(-62, 12),(-60, 9),(-58, 8),(-57, 5)
,(-56, 4),(-55, 7),(-54, 3),(-53, 2)
,(-52, 118),(-51, 22),(-50, 23),(-49, 24)
,(-48, 25),(-47, 26),(-46, 27),(-45, 28)
,(-44, 29),(-43, 30),(-42, 31),(-41, 32)
,(-40, 33),(-39, 34),(-38, 55),(-37, 56)
,(-36, 37),(-35, 57),(-34, 61),(-33, 64)
,(-32, 63),(-31, 62),(-30, 122),(-26, 52)
,(-23, 14),(-22, 15),(-21, 6),(-20, 11)
,(-17, 19),(-15, 126),(-7, 98),(-6, 97)
,(-5, 127),(-4, 128),(-3, 60)
-- State  158

-- State  159
,(-71, 54)
,(-70, 53),(-68, 36),(-67, 35),(-66, 17)
,(-64, 13),(-63, 18),(-62, 12),(-60, 9)
,(-58, 8),(-57, 5),(-56, 4),(-53, 182)
,(-51, 22),(-50, 23),(-49, 24),(-48, 25)
,(-47, 26),(-46, 27),(-45, 28),(-44, 29)
,(-43, 30),(-42, 31),(-41, 32),(-40, 33)
,(-39, 34),(-38, 55),(-37, 56),(-36, 37)
,(-35, 57),(-34, 61),(-33, 64),(-32, 63)
,(-31, 62),(-26, 52),(-23, 14),(-22, 15)
,(-17, 19),(-3, 60)
-- State  160
,(-71, 54),(-70, 53)
,(-68, 36),(-67, 35),(-66, 17),(-64, 13)
,(-63, 18),(-62, 12),(-60, 9),(-58, 8)
,(-57, 5),(-56, 4),(-53, 183),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 37),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-26, 52),(-23, 14),(-22, 15),(-17, 19)
,(-3, 60)
-- State  161

-- State  162
,(-29, 184)
-- State  163
,(-19, 185)
-- State  164

-- State  165
,(-89, 113)
,(-88, 112),(-87, 111),(-86, 110),(-85, 109)
,(-84, 108),(-83, 119),(-82, 116),(-81, 114)
,(-80, 186),(-79, 187),(-78, 129),(-77, 125)
,(-76, 124),(-75, 121),(-74, 120),(-73, 107)
,(-72, 188),(-71, 54),(-70, 133),(-69, 123)
,(-68, 36),(-67, 35),(-66, 17),(-64, 13)
,(-63, 18),(-62, 12),(-60, 9),(-58, 8)
,(-57, 5),(-56, 4),(-55, 7),(-54, 3)
,(-53, 2),(-52, 118),(-51, 22),(-50, 23)
,(-49, 24),(-48, 25),(-47, 26),(-46, 27)
,(-45, 28),(-44, 29),(-43, 30),(-42, 31)
,(-41, 32),(-40, 33),(-39, 34),(-38, 55)
,(-37, 56),(-36, 37),(-35, 57),(-34, 61)
,(-33, 64),(-32, 63),(-31, 62),(-30, 122)
,(-26, 52),(-24, 115),(-23, 14),(-22, 15)
,(-21, 6),(-20, 11),(-17, 19),(-15, 126)
,(-7, 98),(-6, 97),(-5, 127),(-4, 128)
,(-3, 60)
-- State  166

-- State  167

-- State  168
,(-34, 137)
-- State  169
,(-13, 140),(-12, 141)

-- State  170
,(-11, 147),(-10, 149),(-9, 146),(-8, 148)

-- State  171
,(-11, 147),(-10, 149),(-9, 146),(-8, 148)

-- State  172
,(-25, 151),(-24, 152)
-- State  173
,(-25, 151),(-24, 152)

-- State  174
,(-25, 151),(-24, 152)
-- State  175
,(-25, 151),(-24, 152)

-- State  176
,(-33, 154),(-32, 155),(-26, 153)
-- State  177
,(-33, 154)
,(-32, 155),(-26, 153)
-- State  178

-- State  179

-- State  180

-- State  181

-- State  182
,(-21, 74),(-20, 75)

-- State  183
,(-21, 74),(-20, 75)
-- State  184

-- State  185
,(-71, 105),(-68, 102)
,(-66, 79),(-51, 22),(-50, 23),(-49, 24)
,(-48, 25),(-47, 26),(-46, 27),(-45, 28)
,(-44, 29),(-43, 30),(-42, 31),(-41, 32)
,(-40, 33),(-39, 34),(-38, 55),(-37, 56)
,(-36, 103),(-35, 57),(-34, 61),(-33, 64)
,(-32, 63),(-31, 62),(-3, 60)
-- State  186

-- State  187
,(-29, 190)
,(-16, 191)
-- State  188

-- State  189

-- State  190

-- State  191
,(-89, 113),(-88, 112),(-87, 111)
,(-86, 110),(-85, 109),(-84, 108),(-83, 119)
,(-82, 116),(-81, 114),(-80, 192),(-78, 129)
,(-77, 125),(-76, 124),(-75, 121),(-74, 120)
,(-73, 107),(-72, 188),(-71, 54),(-70, 133)
,(-69, 123),(-68, 36),(-67, 35),(-66, 17)
,(-64, 13),(-63, 18),(-62, 12),(-60, 9)
,(-58, 8),(-57, 5),(-56, 4),(-55, 7)
,(-54, 3),(-53, 2),(-52, 118),(-51, 22)
,(-50, 23),(-49, 24),(-48, 25),(-47, 26)
,(-46, 27),(-45, 28),(-44, 29),(-43, 30)
,(-42, 31),(-41, 32),(-40, 33),(-39, 34)
,(-38, 55),(-37, 56),(-36, 37),(-35, 57)
,(-34, 61),(-33, 64),(-32, 63),(-31, 62)
,(-30, 122),(-26, 52),(-24, 115),(-23, 14)
,(-22, 15),(-21, 6),(-20, 11),(-17, 19)
,(-15, 126),(-7, 98),(-6, 97),(-5, 127)
,(-4, 128),(-3, 60)
-- State  192

);

Variables

Get_LHS_Rule: array (Rule range  0 ..  151) of Nonterminal := (-1,
-3,-4,-5,-6,-7,-8,-9,-10,
-11,-12,-13,-14,-15,-16,-17,-18,
-19,-20,-21,-22,-23,-24,-25,-26,
-27,-28,-29,-30,-31,-32,-33,-34,
-35,-36,-37,-38,-39,-40,-41,-42,
-43,-44,-45,-46,-47,-48,-49,-50,
-51,-2,-52,-52,-54,-54,-54,-53,
-53,-53,-56,-56,-59,-59,-58,-58,
-64,-64,-61,-62,-66,-66,-66,-66,
-66,-66,-66,-66,-66,-66,-66,-66,
-66,-63,-63,-63,-68,-68,-68,-68,
-67,-67,-67,-70,-70,-71,-71,-71,
-71,-71,-71,-71,-65,-55,-57,-60,
-60,-72,-74,-74,-74,-74,-74,-75,
-77,-79,-79,-79,-80,-78,-81,-81,
-82,-82,-82,-82,-83,-83,-73,-73,
-84,-84,-85,-85,-85,-86,-86,-86,
-86,-86,-87,-87,-87,-88,-88,-88,
-88,-89,-89,-76,-76,-69,-69);
GOTO_OFFSET : array (0.. 192) of Integer :=
( 0,
 45, 45, 47, 47, 47, 47, 86, 86, 87, 87,
 87, 126, 155, 155, 155, 155, 155, 156, 156, 185,
 185, 185, 185, 185, 185, 185, 185, 185, 185, 185,
 185, 185, 185, 185, 185, 185, 186, 187, 187, 187,
 187, 187, 187, 187, 187, 187, 187, 187, 187, 187,
 187, 187, 187, 187, 188, 188, 188, 188, 188, 188,
 188, 188, 188, 188, 188, 188, 188, 188, 188, 188,
 188, 188, 188, 188, 225, 262, 264, 266, 268, 268,
 268, 268, 268, 268, 268, 269, 272, 272, 298, 298,
 298, 298, 367, 367, 367, 367, 367, 367, 367, 367,
 367, 368, 368, 368, 368, 368, 368, 369, 370, 372,
 376, 378, 381, 381, 382, 443, 443, 443, 443, 447,
 447, 447, 515, 515, 515, 515, 541, 541, 541, 542,
 542, 542, 542, 542, 543, 543, 609, 674, 674, 674,
 738, 802, 802, 802, 802, 802, 865, 928, 991, 1054,
 1054, 1116, 1178, 1239, 1300, 1361, 1361, 1419, 1419, 1458,
 1497, 1497, 1498, 1499, 1499, 1569, 1569, 1569, 1570, 1572,
 1576, 1580, 1582, 1584, 1586, 1588, 1591, 1594, 1594, 1594,
 1594, 1594, 1596, 1598, 1598, 1623, 1623, 1625, 1625, 1625,
 1625, 1694);
The offset vector 
Rule_Length : array (Rule range  0 ..  151) of Natural := ( 2,
 1, 1, 1, 1, 1, 1, 1, 1,
 1, 1, 1, 1, 1, 1, 1, 1,
 1, 1, 1, 1, 1, 1, 1, 1,
 1, 1, 1, 1, 1, 1, 1, 1,
 1, 1, 1, 1, 1, 1, 1, 1,
 1, 1, 1, 1, 1, 1, 1, 1,
 1, 1, 1, 1, 1, 2, 1, 1,
 3, 1, 2, 1, 0, 2, 2, 1,
 1, 2, 3, 2, 1, 1, 1, 1,
 1, 1, 1, 1, 1, 1, 1, 1,
 1, 1, 3, 4, 1, 1, 1, 1,
 1, 1, 3, 1, 3, 1, 1, 1,
 1, 1, 1, 1, 1, 2, 3, 1,
 1, 1, 1, 3, 1, 1, 1, 2,
 4, 0, 1, 3, 1, 1, 1, 3,
 1, 1, 3, 3, 1, 2, 1, 3,
 1, 3, 1, 3, 3, 1, 3, 3,
 3, 3, 1, 3, 3, 1, 3, 3,
 3, 1, 2, 1, 1, 1, 1);

Other Items:

type Small_Integer is range -32_000 .. 32_000;
type Goto_Entry is record
    Nonterm  : Small_Integer;
    Newstate : Small_Integer;
end record;
subtype Row is Integer range -1 .. Integer'Last;
pragma suppress(index_check); 
type Goto_Parse_Table is array (Row range <>) of Goto_Entry;
subtype Rule        is Natural;
subtype Nonterminal is Integer;
end Xia_Parser_Goto;
Generated on 2005-03-05 at 07:49:57 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/xia_parser.html0100644000076600007670000002316010212334402014657 0ustar g315padadev Package: xia_parser

Package: xia_parser

Dependencies

with Text_IO; use Text_IO;
with xia_parser_dfa; use xia_parser_dfa;
with xia_parser_io; use xia_parser_io;
# line 1 "xia_parser.l" Automatically generated AFLEX input from AdaGOOP (by Martin C. Carlisle) Do not modify. # line 14 "xia_parser.l"

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

A lexical scanner generated by aflex

Header

package xia_parser is

Type Summary

Token

Other Items:

type Token is (
   End_Of_Input,
   Error,
   NCNAME_token,
   DECIMAL_LITERAL_token,
   INTEGER_token,
   DQ_LITERAL_token,
   SQ_LITERAL_token,
   LE_token,
   LT_token,
   GE_token,
   GT_token,
   NE_token,
   EQ_token,
   V_BAR_token,
   DOLLAR_token,
   COMMA_token,
   AT_SIGN_token,
   DOUBLE_COLON_token,
   COLON_token,
   DOUBLE_SLASH_token,
   SLASH_token,
   DOUBLE_DOT_token,
   DOT_token,
   MINUS_token,
   PLUS_token,
   STAR_token,
   R_BRACKET_token,
   L_BRACKET_token,
   R_PAREN_token,
   L_PAREN_token,
   OR_token,
   MOD_token,
   DIV_token,
   AND_token,
   NODE_token,
   PROCESSING_INSTRUCTION_token,
   TEXT_token,
   COMMENT_token,
   SELF_token,
   PRECEDING_SIBLING_token,
   PRECEDING_token,
   PARENT_token,
   NAMESPACE_token,
   FOLLOWING_SIBLING_token,
   FOLLOWING_token,
   DESCENDANT_OR_SELF_token,
   DESCENDANT_token,
   CHILD_token,
   ATTRIBUTE_token,
   ANCESTOR_OR_SELF_token,
   ANCESTOR_token,
   Dummy_Token);
procedure Reset(Set_String : in String);
function Get_Token return Token;
function Get_Token_String return String;
function Get_Current_Line return Natural;
function Get_Current_Column return Natural;
procedure Close_Files;
end xia_parser;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/xia_parser_io.html0100644000076600007670000002037710212334402015355 0ustar g315padadev Package: xia_parser_io

Package: xia_parser_io

Dependencies

with xia_parser_dfa; use xia_parser_dfa;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package xia_parser_io is

Exceptions

AFLEX_INTERNAL_ERROR
AFLEX_SCANNER_JAMMED
NULL_IN_INPUT
PUSHBACK_OVERFLOW
UNEXPECTED_LAST_MATCH

Type Summary

eob_action_type

Constants and Named Numbers

YY_END_OF_BUFFER_CHAR : constant Character:= ASCII.NUL;

Variables

yy_eof_has_been_seen : Boolean;
true when we've seen an EOF for the current input file
yy_n_chars : Integer;

Other Items:

type eob_action_type is ( EOB_ACT_RESTART_SCAN,
                          EOB_ACT_END_OF_FILE,
                          EOB_ACT_LAST_MATCH );
procedure YY_INPUT(buf: out unbounded_character_array; result: out Integer; max_size: in Integer);
function yy_get_next_buffer return eob_action_type;
procedure yyunput( c : Character; yy_bp: in out Integer );
procedure unput(c : Character);
function input return Character;
function yywrap return Boolean;
procedure output(c : character); 
procedure Open_Input(Set_String : in String);
procedure Close_Input;
end xia_parser_io;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/xia_parser_model.html0100644000076600007670000100720310212334402016040 0ustar g315padadev Package: xia_parser_Model

Package: xia_parser_Model

Dependencies

with xia_parser;
with McKae.XML.XPath.Expressions;
use  McKae.XML.XPath.Expressions;
with Ada.Strings.Unbounded;
use  Ada.Strings.Unbounded;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Automatically generated AdaGOOP output (by Martin C. Carlisle) If you modify, be careful about losing your work!

Header

package xia_parser_Model is

Type Summary

Abbreviated_Absolute_Location_Path_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Abbreviated_Absolute_Location_Path_nonterminal_ptr
Abbreviated_Relative_Location_Path_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Abbreviated_Relative_Location_Path_nonterminal_ptr
Abbreviated_Step_Base_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Abbreviated_Step_Base_nonterminal1 derived from Abbreviated_Step_Base_nonterminal
Overridden Operations:  Evaluate, Pathify
Abbreviated_Step_Base_nonterminal2 derived from Abbreviated_Step_Base_nonterminal
Overridden Operations:  Evaluate, Pathify
Abbreviated_Step_Base_nonterminal_ptr
Abbreviated_Step_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Abbreviated_Step_nonterminal1 derived from Abbreviated_Step_nonterminal
Overridden Operations:  Evaluate, Pathify
Abbreviated_Step_nonterminal2 derived from Abbreviated_Step_nonterminal
Overridden Operations:  Evaluate, Pathify
Abbreviated_Step_nonterminal_ptr
Absolute_Location_Path_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Absolute_Location_Path_nonterminal1 derived from Absolute_Location_Path_nonterminal
Overridden Operations:  Evaluate, Pathify
Absolute_Location_Path_nonterminal2 derived from Absolute_Location_Path_nonterminal
Overridden Operations:  Evaluate, Pathify
Absolute_Location_Path_nonterminal3 derived from Absolute_Location_Path_nonterminal
Overridden Operations:  Evaluate, Pathify
Absolute_Location_Path_nonterminal_ptr
Additive_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Additive_Expr_nonterminal1 derived from Additive_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Additive_Expr_nonterminal2 derived from Additive_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Additive_Expr_nonterminal3 derived from Additive_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Additive_Expr_nonterminal_ptr
And_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
And_Expr_nonterminal1 derived from And_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
And_Expr_nonterminal2 derived from And_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
And_Expr_nonterminal_ptr
Argument_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Argument_nonterminal_ptr
Arguments_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Arguments_nonterminal1 derived from Arguments_nonterminal
Overridden Operations:  Evaluate, Pathify
Arguments_nonterminal2 derived from Arguments_nonterminal
Overridden Operations:  Evaluate, Pathify
Arguments_nonterminal3 derived from Arguments_nonterminal
Overridden Operations:  Evaluate, Pathify
Arguments_nonterminal_ptr
Axis_Name_nonterminal derived from Parseable
New Operations:  Get_Axis_Name
Inherited Operations:  Evaluate, Pathify
Axis_Name_nonterminal1 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal10 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal11 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal12 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal13 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal2 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal3 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal4 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal5 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal6 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal7 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal8 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal9 derived from Axis_Name_nonterminal
Overridden Operations:  Evaluate, Get_Axis_Name, Pathify
Axis_Name_nonterminal_ptr
Axis_Specifier_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Axis_Specifier_nonterminal_ptr
Equality_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Equality_Expr_nonterminal1 derived from Equality_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Equality_Expr_nonterminal2 derived from Equality_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Equality_Expr_nonterminal3 derived from Equality_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Equality_Expr_nonterminal_ptr
Expr_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Expr_nonterminal_ptr
Filter_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Filter_Expr_nonterminal1 derived from Filter_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Filter_Expr_nonterminal2 derived from Filter_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Filter_Expr_nonterminal_ptr
Function_Call_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Function_Call_nonterminal_ptr
Function_Name_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Function_Name_nonterminal_ptr
Literal_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Literal_nonterminal1 derived from Literal_nonterminal
Overridden Operations:  Evaluate, Pathify
Literal_nonterminal2 derived from Literal_nonterminal
Overridden Operations:  Evaluate, Pathify
Literal_nonterminal_ptr
Location_Path_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Location_Path_nonterminal1 derived from Location_Path_nonterminal
Overridden Operations:  Evaluate, Pathify
Location_Path_nonterminal2 derived from Location_Path_nonterminal
Overridden Operations:  Evaluate, Pathify
Location_Path_nonterminal_ptr
Multiplicative_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Multiplicative_Expr_nonterminal1 derived from Multiplicative_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Multiplicative_Expr_nonterminal2 derived from Multiplicative_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Multiplicative_Expr_nonterminal3 derived from Multiplicative_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Multiplicative_Expr_nonterminal4 derived from Multiplicative_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Multiplicative_Expr_nonterminal_ptr
Name_Test_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Name_Test_nonterminal1 derived from Name_Test_nonterminal
Overridden Operations:  Evaluate, Pathify
Name_Test_nonterminal2 derived from Name_Test_nonterminal
Overridden Operations:  Evaluate, Pathify
Name_Test_nonterminal3 derived from Name_Test_nonterminal
Overridden Operations:  Evaluate, Pathify
Name_Test_nonterminal_ptr
NCNAME_Or_ID_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
NCNAME_Or_ID_nonterminal1 derived from NCNAME_Or_ID_nonterminal
Overridden Operations:  Evaluate, Pathify
NCNAME_Or_ID_nonterminal2 derived from NCNAME_Or_ID_nonterminal
Overridden Operations:  Evaluate, Pathify
NCNAME_Or_ID_nonterminal3 derived from NCNAME_Or_ID_nonterminal
Overridden Operations:  Evaluate, Pathify
NCNAME_Or_ID_nonterminal4 derived from NCNAME_Or_ID_nonterminal
Overridden Operations:  Evaluate, Pathify
NCNAME_Or_ID_nonterminal5 derived from NCNAME_Or_ID_nonterminal
Overridden Operations:  Evaluate, Pathify
NCNAME_Or_ID_nonterminal6 derived from NCNAME_Or_ID_nonterminal
Overridden Operations:  Evaluate, Pathify
NCNAME_Or_ID_nonterminal7 derived from NCNAME_Or_ID_nonterminal
Overridden Operations:  Evaluate, Pathify
NCNAME_Or_ID_nonterminal_ptr
Node_Test_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Node_Test_nonterminal1 derived from Node_Test_nonterminal
Overridden Operations:  Evaluate, Pathify
Node_Test_nonterminal2 derived from Node_Test_nonterminal
Overridden Operations:  Evaluate, Pathify
Node_Test_nonterminal3 derived from Node_Test_nonterminal
Overridden Operations:  Evaluate, Pathify
Node_Test_nonterminal_ptr
Node_Type_nonterminal derived from Parseable
New Operations:  Get_Node_Type_Name
Inherited Operations:  Evaluate, Pathify
Node_Type_nonterminal1 derived from Node_Type_nonterminal
Overridden Operations:  Evaluate, Get_Node_Type_Name, Pathify
Node_Type_nonterminal2 derived from Node_Type_nonterminal
Overridden Operations:  Evaluate, Get_Node_Type_Name, Pathify
Node_Type_nonterminal3 derived from Node_Type_nonterminal
Overridden Operations:  Evaluate, Get_Node_Type_Name, Pathify
Node_Type_nonterminal4 derived from Node_Type_nonterminal
Overridden Operations:  Evaluate, Get_Node_Type_Name, Pathify
Node_Type_nonterminal_ptr
Number_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Number_nonterminal1 derived from Number_nonterminal
Overridden Operations:  Evaluate, Pathify
Number_nonterminal2 derived from Number_nonterminal
Overridden Operations:  Evaluate, Pathify
Number_nonterminal_ptr
Or_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Or_Expr_nonterminal1 derived from Or_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Or_Expr_nonterminal2 derived from Or_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Or_Expr_nonterminal_ptr
Parseable
Primitive Operations:  Evaluate, Pathify
Parseable_Ptr
Parseable_Token derived from Parseable
Overridden Operations:  Evaluate, Pathify
Parseable_Token_Ptr
Path_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Path_Expr_nonterminal1 derived from Path_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Path_Expr_nonterminal2 derived from Path_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Path_Expr_nonterminal3 derived from Path_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Path_Expr_nonterminal4 derived from Path_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Path_Expr_nonterminal_ptr
Predicate_Expr_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Predicate_Expr_nonterminal_ptr
Predicate_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Predicate_nonterminal_ptr
Predicates_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Predicates_nonterminal1 derived from Predicates_nonterminal
Overridden Operations:  Evaluate, Pathify
Predicates_nonterminal2 derived from Predicates_nonterminal
Overridden Operations:  Evaluate, Pathify
Predicates_nonterminal_ptr
Primary_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Primary_Expr_nonterminal1 derived from Primary_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Primary_Expr_nonterminal2 derived from Primary_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Primary_Expr_nonterminal3 derived from Primary_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Primary_Expr_nonterminal4 derived from Primary_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Primary_Expr_nonterminal5 derived from Primary_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Primary_Expr_nonterminal_ptr
QName_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
QName_nonterminal1 derived from QName_nonterminal
Overridden Operations:  Evaluate, Pathify
QName_nonterminal2 derived from QName_nonterminal
Overridden Operations:  Evaluate, Pathify
QName_nonterminal_ptr
Relational_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Relational_Expr_nonterminal1 derived from Relational_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Relational_Expr_nonterminal2 derived from Relational_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Relational_Expr_nonterminal3 derived from Relational_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Relational_Expr_nonterminal4 derived from Relational_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Relational_Expr_nonterminal5 derived from Relational_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Relational_Expr_nonterminal_ptr
Relative_Location_Path_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Relative_Location_Path_nonterminal1 derived from Relative_Location_Path_nonterminal
Overridden Operations:  Evaluate, Pathify
Relative_Location_Path_nonterminal2 derived from Relative_Location_Path_nonterminal
Overridden Operations:  Evaluate, Pathify
Relative_Location_Path_nonterminal3 derived from Relative_Location_Path_nonterminal
Overridden Operations:  Evaluate, Pathify
Relative_Location_Path_nonterminal_ptr
Step_Base_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Step_Base_nonterminal1 derived from Step_Base_nonterminal
Overridden Operations:  Evaluate, Pathify
Step_Base_nonterminal2 derived from Step_Base_nonterminal
Overridden Operations:  Evaluate, Pathify
Step_Base_nonterminal_ptr
Step_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Step_nonterminal1 derived from Step_nonterminal
Overridden Operations:  Evaluate, Pathify
Step_nonterminal2 derived from Step_nonterminal
Overridden Operations:  Evaluate, Pathify
Step_nonterminal_ptr
Unary_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Unary_Expr_nonterminal1 derived from Unary_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Unary_Expr_nonterminal2 derived from Unary_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Unary_Expr_nonterminal_ptr
Union_Expr_nonterminal derived from Parseable
Inherited Operations:  Evaluate, Pathify
Union_Expr_nonterminal1 derived from Union_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Union_Expr_nonterminal2 derived from Union_Expr_nonterminal
Overridden Operations:  Evaluate, Pathify
Union_Expr_nonterminal_ptr
Variable_Reference_nonterminal derived from Parseable
Overridden Operations:  Evaluate, Pathify
Variable_Reference_nonterminal_ptr

Other Items:

subtype String_Ptr is McKae.XML.XPath.Expressions.String_Ptr;
type Parseable is abstract tagged null record;
procedure Pathify(This : in out Parseable) is abstract;
procedure Evaluate (This         : in     Parseable;
                    Context_Node : in     Node_Items;
                    Value        :    out Expression_Values) is abstract;
type Parseable_Ptr is access all Parseable'Class;
type Parseable_Token is new Parseable with record
   Line         : Natural;
   Column       : Natural;
   Token_String : String_Ptr;
   Token_Type   : xia_parser.Token;
end record;
procedure Pathify(This : in out Parseable_Token);
procedure Evaluate (This : in Parseable_Token;
                    Context_Node : in     Node_Items;
                    Value : out Expression_Values);
type Parseable_Token_Ptr is access all Parseable_Token'Class;
type Literal_nonterminal;
--  Full declaration: Literal_nonterminal
type Literal_nonterminal_ptr is access all Literal_nonterminal'Class;
type Number_nonterminal;
--  Full declaration: Number_nonterminal
type Number_nonterminal_ptr is access all Number_nonterminal'Class;
type Unary_Expr_nonterminal;
--  Full declaration: Unary_Expr_nonterminal
type Unary_Expr_nonterminal_ptr is access all Unary_Expr_nonterminal'Class;
type Multiplicative_Expr_nonterminal;
--  Full declaration: Multiplicative_Expr_nonterminal
type Multiplicative_Expr_nonterminal_ptr is access all Multiplicative_Expr_nonterminal'Class;
type Additive_Expr_nonterminal;
--  Full declaration: Additive_Expr_nonterminal
type Additive_Expr_nonterminal_ptr is access all Additive_Expr_nonterminal'Class;
type Relational_Expr_nonterminal;
--  Full declaration: Relational_Expr_nonterminal
type Relational_Expr_nonterminal_ptr is access all Relational_Expr_nonterminal'Class;
type Equality_Expr_nonterminal;
--  Full declaration: Equality_Expr_nonterminal
type Equality_Expr_nonterminal_ptr is access all Equality_Expr_nonterminal'Class;
type And_Expr_nonterminal;
--  Full declaration: And_Expr_nonterminal
type And_Expr_nonterminal_ptr is access all And_Expr_nonterminal'Class;
type Or_Expr_nonterminal;
--  Full declaration: Or_Expr_nonterminal
type Or_Expr_nonterminal_ptr is access all Or_Expr_nonterminal'Class;
type Filter_Expr_nonterminal;
--  Full declaration: Filter_Expr_nonterminal
type Filter_Expr_nonterminal_ptr is access all Filter_Expr_nonterminal'Class;
type Path_Expr_nonterminal;
--  Full declaration: Path_Expr_nonterminal
type Path_Expr_nonterminal_ptr is access all Path_Expr_nonterminal'Class;
type Union_Expr_nonterminal;
--  Full declaration: Union_Expr_nonterminal
type Union_Expr_nonterminal_ptr is access all Union_Expr_nonterminal'Class;
type Function_Name_nonterminal;
--  Full declaration: Function_Name_nonterminal
type Function_Name_nonterminal_ptr is access all Function_Name_nonterminal'Class;
type Argument_nonterminal;
--  Full declaration: Argument_nonterminal
type Argument_nonterminal_ptr is access all Argument_nonterminal'Class;
type Arguments_nonterminal;
--  Full declaration: Arguments_nonterminal
type Arguments_nonterminal_ptr is access all Arguments_nonterminal'Class;
type Function_Call_nonterminal;
--  Full declaration: Function_Call_nonterminal
type Function_Call_nonterminal_ptr is access all Function_Call_nonterminal'Class;
type Variable_Reference_nonterminal;
--  Full declaration: Variable_Reference_nonterminal
type Variable_Reference_nonterminal_ptr is access all Variable_Reference_nonterminal'Class;
type Primary_Expr_nonterminal;
--  Full declaration: Primary_Expr_nonterminal
type Primary_Expr_nonterminal_ptr is access all Primary_Expr_nonterminal'Class;
type Expr_nonterminal;
--  Full declaration: Expr_nonterminal
type Expr_nonterminal_ptr is access all Expr_nonterminal'Class;
type Abbreviated_Step_nonterminal;
--  Full declaration: Abbreviated_Step_nonterminal
type Abbreviated_Step_nonterminal_ptr is access all Abbreviated_Step_nonterminal'Class;
type Abbreviated_Relative_Location_Path_nonterminal;
--  Full declaration: Abbreviated_Relative_Location_Path_nonterminal
type Abbreviated_Relative_Location_Path_nonterminal_ptr is access all Abbreviated_Relative_Location_Path_nonterminal'Class;
type Abbreviated_Absolute_Location_Path_nonterminal;
--  Full declaration: Abbreviated_Absolute_Location_Path_nonterminal
type Abbreviated_Absolute_Location_Path_nonterminal_ptr is access all Abbreviated_Absolute_Location_Path_nonterminal'Class;
type Predicate_Expr_nonterminal;
--  Full declaration: Predicate_Expr_nonterminal
type Predicate_Expr_nonterminal_ptr is access all Predicate_Expr_nonterminal'Class;
type NCNAME_Or_ID_nonterminal;
--  Full declaration: NCNAME_Or_ID_nonterminal
type NCNAME_Or_ID_nonterminal_ptr is access all NCNAME_Or_ID_nonterminal'Class;
type QName_nonterminal;
--  Full declaration: QName_nonterminal
type QName_nonterminal_ptr is access all QName_nonterminal'Class;
type Name_Test_nonterminal;
--  Full declaration: Name_Test_nonterminal
type Name_Test_nonterminal_ptr is access all Name_Test_nonterminal'Class;
type Node_Type_nonterminal;
--  Full declaration: Node_Type_nonterminal
type Node_Type_nonterminal_ptr is access all Node_Type_nonterminal'Class;
type Node_Test_nonterminal;
--  Full declaration: Node_Test_nonterminal
type Node_Test_nonterminal_ptr is access all Node_Test_nonterminal'Class;
type Axis_Name_nonterminal;
--  Full declaration: Axis_Name_nonterminal
type Axis_Name_nonterminal_ptr is access all Axis_Name_nonterminal'Class;
type Axis_Specifier_nonterminal;
--  Full declaration: Axis_Specifier_nonterminal
type Axis_Specifier_nonterminal_ptr is access all Axis_Specifier_nonterminal'Class;
type Predicate_nonterminal;
--  Full declaration: Predicate_nonterminal
type Predicate_nonterminal_ptr is access all Predicate_nonterminal'Class;
type Abbreviated_Step_Base_nonterminal;
--  Full declaration: Abbreviated_Step_Base_nonterminal
type Abbreviated_Step_Base_nonterminal_ptr is access all Abbreviated_Step_Base_nonterminal'Class;
type Step_Base_nonterminal;
--  Full declaration: Step_Base_nonterminal
type Step_Base_nonterminal_ptr is access all Step_Base_nonterminal'Class;
type Predicates_nonterminal;
--  Full declaration: Predicates_nonterminal
type Predicates_nonterminal_ptr is access all Predicates_nonterminal'Class;
type Step_nonterminal;
--  Full declaration: Step_nonterminal
type Step_nonterminal_ptr is access all Step_nonterminal'Class;
type Relative_Location_Path_nonterminal;
--  Full declaration: Relative_Location_Path_nonterminal
type Relative_Location_Path_nonterminal_ptr is access all Relative_Location_Path_nonterminal'Class;
type Absolute_Location_Path_nonterminal;
--  Full declaration: Absolute_Location_Path_nonterminal
type Absolute_Location_Path_nonterminal_ptr is access all Absolute_Location_Path_nonterminal'Class;
type Location_Path_nonterminal;
--  Full declaration: Location_Path_nonterminal
type Location_Path_nonterminal_ptr is access all Location_Path_nonterminal'Class;
type Location_Path_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Location_Path_nonterminal
type Location_Path_nonterminal1 is new Location_Path_nonterminal with record
   Relative_Location_Path_part : Relative_Location_Path_nonterminal_ptr;
end record;
procedure Pathify(This : in out Location_Path_nonterminal1);
procedure Evaluate(This : in Location_Path_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Location_Path_nonterminal2 is new Location_Path_nonterminal with record
   Absolute_Location_Path_part : Absolute_Location_Path_nonterminal_ptr;
end record;
procedure Pathify(This : in out Location_Path_nonterminal2);
procedure Evaluate(This : in Location_Path_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Absolute_Location_Path_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Absolute_Location_Path_nonterminal
type Absolute_Location_Path_nonterminal1 is new Absolute_Location_Path_nonterminal with record
   SLASH_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Absolute_Location_Path_nonterminal1);
procedure Evaluate(This : in Absolute_Location_Path_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Absolute_Location_Path_nonterminal2 is new Absolute_Location_Path_nonterminal with record
   SLASH_part : Parseable_Token_Ptr;
   Relative_Location_Path_part : Relative_Location_Path_nonterminal_ptr;
end record;
procedure Pathify(This : in out Absolute_Location_Path_nonterminal2);
procedure Evaluate(This : in Absolute_Location_Path_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Absolute_Location_Path_nonterminal3 is new Absolute_Location_Path_nonterminal with record
   Abbreviated_Absolute_Location_Path_part : Abbreviated_Absolute_Location_Path_nonterminal_ptr;
end record;
procedure Pathify(This : in out Absolute_Location_Path_nonterminal3);
procedure Evaluate(This : in Absolute_Location_Path_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Relative_Location_Path_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Relative_Location_Path_nonterminal
type Relative_Location_Path_nonterminal1 is new Relative_Location_Path_nonterminal with record
   Step_part : Step_nonterminal_ptr;
end record;
procedure Pathify(This : in out Relative_Location_Path_nonterminal1);
procedure Evaluate(This : in Relative_Location_Path_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Relative_Location_Path_nonterminal2 is new Relative_Location_Path_nonterminal with record
   Relative_Location_Path_part : Relative_Location_Path_nonterminal_ptr;
   SLASH_part : Parseable_Token_Ptr;
   Step_part : Step_nonterminal_ptr;
end record;
procedure Pathify(This : in out Relative_Location_Path_nonterminal2);
procedure Evaluate(This : in Relative_Location_Path_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Relative_Location_Path_nonterminal3 is new Relative_Location_Path_nonterminal with record
   Abbreviated_Relative_Location_Path_part : Abbreviated_Relative_Location_Path_nonterminal_ptr;
end record;
procedure Pathify(This : in out Relative_Location_Path_nonterminal3);
procedure Evaluate(This : in Relative_Location_Path_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Step_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Step_nonterminal
type Step_nonterminal1 is new Step_nonterminal with record
   Step_Base_part : Step_Base_nonterminal_ptr;
   Predicates_part : Predicates_nonterminal_ptr;
end record;
procedure Pathify(This : in out Step_nonterminal1);
procedure Evaluate(This : in Step_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Step_nonterminal2 is new Step_nonterminal with record
   Abbreviated_Step_part : Abbreviated_Step_nonterminal_ptr;
end record;
procedure Pathify(This : in out Step_nonterminal2);
procedure Evaluate(This : in Step_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Predicates_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Predicates_nonterminal
type Predicates_nonterminal1 is new Predicates_nonterminal with record
   null;
end record;
procedure Pathify(This : in out Predicates_nonterminal1);
procedure Evaluate(This : in Predicates_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Predicates_nonterminal2 is new Predicates_nonterminal with record
   Predicates_part : Predicates_nonterminal_ptr;
   Predicate_part : Predicate_nonterminal_ptr;
end record;
procedure Pathify(This : in out Predicates_nonterminal2);
procedure Evaluate(This : in Predicates_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Step_Base_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Step_Base_nonterminal
type Step_Base_nonterminal1 is new Step_Base_nonterminal with record
   Axis_Specifier_part : Axis_Specifier_nonterminal_ptr;
   Node_Test_part : Node_Test_nonterminal_ptr;
end record;
procedure Pathify(This : in out Step_Base_nonterminal1);
procedure Evaluate(This : in Step_Base_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Step_Base_nonterminal2 is new Step_Base_nonterminal with record
   Abbreviated_Step_Base_part : Abbreviated_Step_Base_nonterminal_ptr;
end record;
procedure Pathify(This : in out Step_Base_nonterminal2);
procedure Evaluate(This : in Step_Base_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Abbreviated_Step_Base_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Abbreviated_Step_Base_nonterminal
type Abbreviated_Step_Base_nonterminal1 is new Abbreviated_Step_Base_nonterminal with record
   Node_Test_part : Node_Test_nonterminal_ptr;
end record;
procedure Pathify(This : in out Abbreviated_Step_Base_nonterminal1);
procedure Evaluate(This : in Abbreviated_Step_Base_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Abbreviated_Step_Base_nonterminal2 is new Abbreviated_Step_Base_nonterminal with record
   AT_SIGN_part : Parseable_Token_Ptr;
   Node_Test_part : Node_Test_nonterminal_ptr;
end record;
procedure Pathify(This : in out Abbreviated_Step_Base_nonterminal2);
procedure Evaluate(This : in Abbreviated_Step_Base_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Predicate_nonterminal is new Parseable with record
   L_BRACKET_part : Parseable_Token_Ptr;
   Predicate_Expr_part : Predicate_Expr_nonterminal_ptr;
   R_BRACKET_part : Parseable_Token_Ptr;
end record;
--  Incomplete declaration: Predicate_nonterminal
procedure Pathify(This : in out Predicate_nonterminal);
procedure Evaluate(This : in Predicate_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Specifier_nonterminal is new Parseable with record
   Axis_Name_part : Axis_Name_nonterminal_ptr;
   DOUBLE_COLON_part : Parseable_Token_Ptr;
end record;
--  Incomplete declaration: Axis_Specifier_nonterminal
procedure Pathify(This : in out Axis_Specifier_nonterminal);
procedure Evaluate(This : in Axis_Specifier_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Axis_Name_nonterminal
function Get_Axis_Name(This : in Axis_Name_nonterminal)
  return Unbounded_String is abstract;
type Axis_Name_nonterminal1 is new Axis_Name_nonterminal with record
   ANCESTOR_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal1) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal1);
procedure Evaluate(This : in Axis_Name_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal2 is new Axis_Name_nonterminal with record
   ANCESTOR_OR_SELF_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal2) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal2);
procedure Evaluate(This : in Axis_Name_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal3 is new Axis_Name_nonterminal with record
   ATTRIBUTE_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal3) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal3);
procedure Evaluate(This : in Axis_Name_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal4 is new Axis_Name_nonterminal with record
   CHILD_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal4) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal4);
procedure Evaluate(This : in Axis_Name_nonterminal4;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal5 is new Axis_Name_nonterminal with record
   DESCENDANT_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal5) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal5);
procedure Evaluate(This : in Axis_Name_nonterminal5;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal6 is new Axis_Name_nonterminal with record
   DESCENDANT_OR_SELF_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal6) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal6);
procedure Evaluate(This : in Axis_Name_nonterminal6;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal7 is new Axis_Name_nonterminal with record
   FOLLOWING_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal7) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal7);
procedure Evaluate(This : in Axis_Name_nonterminal7;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal8 is new Axis_Name_nonterminal with record
   FOLLOWING_SIBLING_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal8) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal8);
procedure Evaluate(This : in Axis_Name_nonterminal8;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal9 is new Axis_Name_nonterminal with record
   NAMESPACE_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal9) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal9);
procedure Evaluate(This : in Axis_Name_nonterminal9;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal10 is new Axis_Name_nonterminal with record
   PARENT_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal10) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal10);
procedure Evaluate(This : in Axis_Name_nonterminal10;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal11 is new Axis_Name_nonterminal with record
   PRECEDING_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal11) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal11);
procedure Evaluate(This : in Axis_Name_nonterminal11;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal12 is new Axis_Name_nonterminal with record
   PRECEDING_SIBLING_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal12) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal12);
procedure Evaluate(This : in Axis_Name_nonterminal12;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Axis_Name_nonterminal13 is new Axis_Name_nonterminal with record
   SELF_part : Parseable_Token_Ptr;
end record;
function Get_Axis_Name(This : in Axis_Name_nonterminal13) return Unbounded_String;
procedure Pathify(This : in out Axis_Name_nonterminal13);
procedure Evaluate(This : in Axis_Name_nonterminal13;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Node_Test_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Node_Test_nonterminal
type Node_Test_nonterminal1 is new Node_Test_nonterminal with record
   Name_Test_part : Name_Test_nonterminal_ptr;
end record;
procedure Pathify(This : in out Node_Test_nonterminal1);
procedure Evaluate(This : in Node_Test_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Node_Test_nonterminal2 is new Node_Test_nonterminal with record
   Node_Type_part : Node_Type_nonterminal_ptr;
   L_PAREN_part : Parseable_Token_Ptr;
   R_PAREN_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Node_Test_nonterminal2);
procedure Evaluate(This : in Node_Test_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Node_Test_nonterminal3 is new Node_Test_nonterminal with record
   PROCESSING_INSTRUCTION_part : Parseable_Token_Ptr;
   L_PAREN_part : Parseable_Token_Ptr;
   LITERAL_part : Literal_nonterminal_ptr;
   R_PAREN_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Node_Test_nonterminal3);
procedure Evaluate(This : in Node_Test_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Node_Type_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Node_Type_nonterminal
function Get_Node_Type_Name(This : in Node_Type_nonterminal)
  return Unbounded_String is abstract;
type Node_Type_nonterminal1 is new Node_Type_nonterminal with record
   COMMENT_part : Parseable_Token_Ptr;
end record;
function Get_Node_Type_Name(This : in Node_Type_nonterminal1) return Unbounded_String;
procedure Pathify(This : in out Node_Type_nonterminal1);
procedure Evaluate(This : in Node_Type_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Node_Type_nonterminal2 is new Node_Type_nonterminal with record
   TEXT_part : Parseable_Token_Ptr;
end record;
function Get_Node_Type_Name(This : in Node_Type_nonterminal2) return Unbounded_String;
procedure Pathify(This : in out Node_Type_nonterminal2);
procedure Evaluate(This : in Node_Type_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Node_Type_nonterminal3 is new Node_Type_nonterminal with record
   PROCESSING_INSTRUCTION_part : Parseable_Token_Ptr;
end record;
function Get_Node_Type_Name(This : in Node_Type_nonterminal3) return Unbounded_String;
procedure Pathify(This : in out Node_Type_nonterminal3);
procedure Evaluate(This : in Node_Type_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Node_Type_nonterminal4 is new Node_Type_nonterminal with record
   NODE_part : Parseable_Token_Ptr;
end record;
function Get_Node_Type_Name(This : in Node_Type_nonterminal4) return Unbounded_String;
procedure Pathify(This : in out Node_Type_nonterminal4);
procedure Evaluate(This : in Node_Type_nonterminal4;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Name_Test_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Name_Test_nonterminal
type Name_Test_nonterminal1 is new Name_Test_nonterminal with record
   STAR_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Name_Test_nonterminal1);
procedure Evaluate(This : in Name_Test_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Name_Test_nonterminal2 is new Name_Test_nonterminal with record
   QName_part : QName_nonterminal_ptr;
end record;
procedure Pathify(This : in out Name_Test_nonterminal2);
procedure Evaluate(This : in Name_Test_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Name_Test_nonterminal3 is new Name_Test_nonterminal with record
   NCNAME_Or_ID_part : NCNAME_Or_ID_nonterminal_ptr;
   COLON_part : Parseable_Token_Ptr;
   STAR_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Name_Test_nonterminal3);
procedure Evaluate(This : in Name_Test_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type QName_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: QName_nonterminal
type QName_nonterminal1 is new QName_nonterminal with record
   NCNAME_Or_ID_part : NCNAME_Or_ID_nonterminal_ptr;
end record;
procedure Pathify(This : in out QName_nonterminal1);
procedure Evaluate(This : in QName_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type QName_nonterminal2 is new QName_nonterminal with record
   NCNAME_Or_ID_part1 : NCNAME_Or_ID_nonterminal_ptr;
   COLON_part : Parseable_Token_Ptr;
   NCNAME_Or_ID_part2 : NCNAME_Or_ID_nonterminal_ptr;
end record;
procedure Pathify(This : in out QName_nonterminal2);
procedure Evaluate(This : in QName_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type NCNAME_Or_ID_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: NCNAME_Or_ID_nonterminal
type NCNAME_Or_ID_nonterminal1 is new NCNAME_Or_ID_nonterminal with record
   NCNAME_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out NCNAME_Or_ID_nonterminal1);
procedure Evaluate(This : in NCNAME_Or_ID_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type NCNAME_Or_ID_nonterminal2 is new NCNAME_Or_ID_nonterminal with record
   Axis_Name_part : Axis_Name_nonterminal_ptr;
end record;
procedure Pathify(This : in out NCNAME_Or_ID_nonterminal2);
procedure Evaluate(This : in NCNAME_Or_ID_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type NCNAME_Or_ID_nonterminal3 is new NCNAME_Or_ID_nonterminal with record
   Node_Type_part : Node_Type_nonterminal_ptr;
end record;
procedure Pathify(This : in out NCNAME_Or_ID_nonterminal3);
procedure Evaluate(This : in NCNAME_Or_ID_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type NCNAME_Or_ID_nonterminal4 is new NCNAME_Or_ID_nonterminal with record
   AND_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out NCNAME_Or_ID_nonterminal4);
procedure Evaluate(This : in NCNAME_Or_ID_nonterminal4;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type NCNAME_Or_ID_nonterminal5 is new NCNAME_Or_ID_nonterminal with record
   OR_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out NCNAME_Or_ID_nonterminal5);
procedure Evaluate(This : in NCNAME_Or_ID_nonterminal5;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type NCNAME_Or_ID_nonterminal6 is new NCNAME_Or_ID_nonterminal with record
   MOD_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out NCNAME_Or_ID_nonterminal6);
procedure Evaluate(This : in NCNAME_Or_ID_nonterminal6;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type NCNAME_Or_ID_nonterminal7 is new NCNAME_Or_ID_nonterminal with record
   DIV_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out NCNAME_Or_ID_nonterminal7);
procedure Evaluate(This : in NCNAME_Or_ID_nonterminal7;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Predicate_Expr_nonterminal is new Parseable with record
   Expr_part : Expr_nonterminal_ptr;
end record;
--  Incomplete declaration: Predicate_Expr_nonterminal
procedure Pathify(This : in out Predicate_Expr_nonterminal);
procedure Evaluate(This : in Predicate_Expr_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Abbreviated_Absolute_Location_Path_nonterminal is new Parseable with record
   DOUBLE_SLASH_part : Parseable_Token_Ptr;
   Relative_Location_Path_part : Relative_Location_Path_nonterminal_ptr;
end record;
--  Incomplete declaration: Abbreviated_Absolute_Location_Path_nonterminal
procedure Pathify(This : in out Abbreviated_Absolute_Location_Path_nonterminal);
procedure Evaluate(This : in Abbreviated_Absolute_Location_Path_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Abbreviated_Relative_Location_Path_nonterminal is new Parseable with record
   Relative_Location_Path_part : Relative_Location_Path_nonterminal_ptr;
   DOUBLE_SLASH_part : Parseable_Token_Ptr;
   Step_part : Step_nonterminal_ptr;
end record;
--  Incomplete declaration: Abbreviated_Relative_Location_Path_nonterminal
procedure Pathify(This : in out Abbreviated_Relative_Location_Path_nonterminal);
procedure Evaluate(This : in Abbreviated_Relative_Location_Path_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Abbreviated_Step_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Abbreviated_Step_nonterminal
type Abbreviated_Step_nonterminal1 is new Abbreviated_Step_nonterminal with record
   DOT_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Abbreviated_Step_nonterminal1);
procedure Evaluate(This : in Abbreviated_Step_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Abbreviated_Step_nonterminal2 is new Abbreviated_Step_nonterminal with record
   DOUBLE_DOT_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Abbreviated_Step_nonterminal2);
procedure Evaluate(This : in Abbreviated_Step_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Expr_nonterminal is new Parseable with record
   Or_Expr_part : Or_Expr_nonterminal_ptr;
end record;
--  Incomplete declaration: Expr_nonterminal
procedure Pathify(This : in out Expr_nonterminal);
procedure Evaluate(This : in Expr_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Primary_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Primary_Expr_nonterminal
procedure Evaluate (This : in Expr_Nonterminal; Context_Node : in Node_Items; Value : out Expression_Values); 
type Primary_Expr_nonterminal1 is new Primary_Expr_nonterminal with record
   Variable_Reference_part : Variable_Reference_nonterminal_ptr;
end record;
procedure Pathify(This : in out Primary_Expr_nonterminal1);
procedure Evaluate(This : in Primary_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Primary_Expr_nonterminal2 is new Primary_Expr_nonterminal with record
   L_PAREN_part : Parseable_Token_Ptr;
   Expr_part : Expr_nonterminal_ptr;
   R_PAREN_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Primary_Expr_nonterminal2);
procedure Evaluate(This : in Primary_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Primary_Expr_nonterminal3 is new Primary_Expr_nonterminal with record
   LITERAL_part : Literal_nonterminal_ptr;
end record;
procedure Pathify(This : in out Primary_Expr_nonterminal3);
procedure Evaluate(This : in Primary_Expr_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Primary_Expr_nonterminal4 is new Primary_Expr_nonterminal with record
   Number_part : Number_nonterminal_ptr;
end record;
procedure Pathify(This : in out Primary_Expr_nonterminal4);
procedure Evaluate(This : in Primary_Expr_nonterminal4;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Primary_Expr_nonterminal5 is new Primary_Expr_nonterminal with record
   Function_Call_part : Function_Call_nonterminal_ptr;
end record;
procedure Pathify(This : in out Primary_Expr_nonterminal5);
procedure Evaluate(This : in Primary_Expr_nonterminal5;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Variable_Reference_nonterminal is new Parseable with record
   DOLLAR_part : Parseable_Token_Ptr;
   QName_part : QName_nonterminal_ptr;
end record;
--  Incomplete declaration: Variable_Reference_nonterminal
procedure Pathify(This : in out Variable_Reference_nonterminal);
procedure Evaluate(This : in Variable_Reference_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Function_Call_nonterminal is new Parseable with record
   Function_Name_part : Function_Name_nonterminal_ptr;
   L_PAREN_part : Parseable_Token_Ptr;
   Arguments_part : Arguments_nonterminal_ptr;
   R_PAREN_part : Parseable_Token_Ptr;
end record;
--  Incomplete declaration: Function_Call_nonterminal
procedure Pathify(This : in out Function_Call_nonterminal);
procedure Evaluate(This : in Function_Call_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Arguments_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Arguments_nonterminal
type Arguments_nonterminal1 is new Arguments_nonterminal with record
   null;
end record;
procedure Pathify(This : in out Arguments_nonterminal1);
procedure Evaluate(This : in Arguments_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Arguments_nonterminal2 is new Arguments_nonterminal with record
   Argument_part : Argument_nonterminal_ptr;
end record;
procedure Pathify(This : in out Arguments_nonterminal2);
procedure Evaluate(This : in Arguments_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Arguments_nonterminal3 is new Arguments_nonterminal with record
   Arguments_part : Arguments_nonterminal_ptr;
   COMMA_part : Parseable_Token_Ptr;
   Argument_part : Argument_nonterminal_ptr;
end record;
procedure Pathify(This : in out Arguments_nonterminal3);
procedure Evaluate(This : in Arguments_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Argument_nonterminal is new Parseable with record
   Expr_part : Expr_nonterminal_ptr;
end record;
--  Incomplete declaration: Argument_nonterminal
procedure Pathify(This : in out Argument_nonterminal);
procedure Evaluate(This : in Argument_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Function_Name_nonterminal is new Parseable with record
   QName_part : QName_nonterminal_ptr;
end record;
--  Incomplete declaration: Function_Name_nonterminal
procedure Pathify(This : in out Function_Name_nonterminal);
procedure Evaluate(This : in Function_Name_nonterminal;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Union_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Union_Expr_nonterminal
type Union_Expr_nonterminal1 is new Union_Expr_nonterminal with record
   Path_Expr_part : Path_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Union_Expr_nonterminal1);
procedure Evaluate(This : in Union_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Union_Expr_nonterminal2 is new Union_Expr_nonterminal with record
   Union_Expr_part : Union_Expr_nonterminal_ptr;
   V_BAR_part : Parseable_Token_Ptr;
   Path_Expr_part : Path_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Union_Expr_nonterminal2);
procedure Evaluate(This : in Union_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Path_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Path_Expr_nonterminal
type Path_Expr_nonterminal1 is new Path_Expr_nonterminal with record
   Location_Path_part : Location_Path_nonterminal_ptr;
end record;
procedure Pathify(This : in out Path_Expr_nonterminal1);
procedure Evaluate(This : in Path_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Path_Expr_nonterminal2 is new Path_Expr_nonterminal with record
   Filter_Expr_part : Filter_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Path_Expr_nonterminal2);
procedure Evaluate(This : in Path_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Path_Expr_nonterminal3 is new Path_Expr_nonterminal with record
   Filter_Expr_part : Filter_Expr_nonterminal_ptr;
   SLASH_part : Parseable_Token_Ptr;
   Relative_Location_Path_part : Relative_Location_Path_nonterminal_ptr;
end record;
procedure Pathify(This : in out Path_Expr_nonterminal3);
procedure Evaluate(This : in Path_Expr_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Path_Expr_nonterminal4 is new Path_Expr_nonterminal with record
   Filter_Expr_part : Filter_Expr_nonterminal_ptr;
   DOUBLE_SLASH_part : Parseable_Token_Ptr;
   Relative_Location_Path_part : Relative_Location_Path_nonterminal_ptr;
end record;
procedure Pathify(This : in out Path_Expr_nonterminal4);
procedure Evaluate(This : in Path_Expr_nonterminal4;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Filter_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Filter_Expr_nonterminal
type Filter_Expr_nonterminal1 is new Filter_Expr_nonterminal with record
   Primary_Expr_part : Primary_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Filter_Expr_nonterminal1);
procedure Evaluate(This : in Filter_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Filter_Expr_nonterminal2 is new Filter_Expr_nonterminal with record
   Filter_Expr_part : Filter_Expr_nonterminal_ptr;
   Predicate_part : Predicate_nonterminal_ptr;
end record;
procedure Pathify(This : in out Filter_Expr_nonterminal2);
procedure Evaluate(This : in Filter_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Or_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Or_Expr_nonterminal
type Or_Expr_nonterminal1 is new Or_Expr_nonterminal with record
   And_Expr_part : And_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Or_Expr_nonterminal1);
procedure Evaluate(This : in Or_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Or_Expr_nonterminal2 is new Or_Expr_nonterminal with record
   Or_Expr_part : Or_Expr_nonterminal_ptr;
   OR_part : Parseable_Token_Ptr;
   And_Expr_part : And_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Or_Expr_nonterminal2);
procedure Evaluate(This : in Or_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type And_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: And_Expr_nonterminal
type And_Expr_nonterminal1 is new And_Expr_nonterminal with record
   Equality_Expr_part : Equality_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out And_Expr_nonterminal1);
procedure Evaluate(This : in And_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type And_Expr_nonterminal2 is new And_Expr_nonterminal with record
   And_Expr_part : And_Expr_nonterminal_ptr;
   AND_part : Parseable_Token_Ptr;
   Equality_Expr_part : Equality_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out And_Expr_nonterminal2);
procedure Evaluate(This : in And_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Equality_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Equality_Expr_nonterminal
type Equality_Expr_nonterminal1 is new Equality_Expr_nonterminal with record
   Relational_Expr_part : Relational_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Equality_Expr_nonterminal1);
procedure Evaluate(This : in Equality_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Equality_Expr_nonterminal2 is new Equality_Expr_nonterminal with record
   Equality_Expr_part : Equality_Expr_nonterminal_ptr;
   EQ_part : Parseable_Token_Ptr;
   Relational_Expr_part : Relational_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Equality_Expr_nonterminal2);
procedure Evaluate(This : in Equality_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Equality_Expr_nonterminal3 is new Equality_Expr_nonterminal with record
   Equality_Expr_part : Equality_Expr_nonterminal_ptr;
   NE_part : Parseable_Token_Ptr;
   Relational_Expr_part : Relational_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Equality_Expr_nonterminal3);
procedure Evaluate(This : in Equality_Expr_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Relational_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Relational_Expr_nonterminal
type Relational_Expr_nonterminal1 is new Relational_Expr_nonterminal with record
   Additive_Expr_part : Additive_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Relational_Expr_nonterminal1);
procedure Evaluate(This : in Relational_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Relational_Expr_nonterminal2 is new Relational_Expr_nonterminal with record
   Relational_Expr_part : Relational_Expr_nonterminal_ptr;
   LT_part : Parseable_Token_Ptr;
   Additive_Expr_part : Additive_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Relational_Expr_nonterminal2);
procedure Evaluate(This : in Relational_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Relational_Expr_nonterminal3 is new Relational_Expr_nonterminal with record
   Relational_Expr_part : Relational_Expr_nonterminal_ptr;
   GT_part : Parseable_Token_Ptr;
   Additive_Expr_part : Additive_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Relational_Expr_nonterminal3);
procedure Evaluate(This : in Relational_Expr_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Relational_Expr_nonterminal4 is new Relational_Expr_nonterminal with record
   Relational_Expr_part : Relational_Expr_nonterminal_ptr;
   LE_part : Parseable_Token_Ptr;
   Additive_Expr_part : Additive_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Relational_Expr_nonterminal4);
procedure Evaluate(This : in Relational_Expr_nonterminal4;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Relational_Expr_nonterminal5 is new Relational_Expr_nonterminal with record
   Relational_Expr_part : Relational_Expr_nonterminal_ptr;
   GE_part : Parseable_Token_Ptr;
   Additive_Expr_part : Additive_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Relational_Expr_nonterminal5);
procedure Evaluate(This : in Relational_Expr_nonterminal5;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Additive_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Additive_Expr_nonterminal
type Additive_Expr_nonterminal1 is new Additive_Expr_nonterminal with record
   Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Additive_Expr_nonterminal1);
procedure Evaluate(This : in Additive_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Additive_Expr_nonterminal2 is new Additive_Expr_nonterminal with record
   Additive_Expr_part : Additive_Expr_nonterminal_ptr;
   PLUS_part : Parseable_Token_Ptr;
   Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Additive_Expr_nonterminal2);
procedure Evaluate(This : in Additive_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Additive_Expr_nonterminal3 is new Additive_Expr_nonterminal with record
   Additive_Expr_part : Additive_Expr_nonterminal_ptr;
   MINUS_part : Parseable_Token_Ptr;
   Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Additive_Expr_nonterminal3);
procedure Evaluate(This : in Additive_Expr_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Multiplicative_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Multiplicative_Expr_nonterminal
type Multiplicative_Expr_nonterminal1 is new Multiplicative_Expr_nonterminal with record
   Unary_Expr_part : Unary_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Multiplicative_Expr_nonterminal1);
procedure Evaluate(This : in Multiplicative_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Multiplicative_Expr_nonterminal2 is new Multiplicative_Expr_nonterminal with record
   Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_ptr;
   STAR_part : Parseable_Token_Ptr;
   Unary_Expr_part : Unary_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Multiplicative_Expr_nonterminal2);
procedure Evaluate(This : in Multiplicative_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Multiplicative_Expr_nonterminal3 is new Multiplicative_Expr_nonterminal with record
   Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_ptr;
   DIV_part : Parseable_Token_Ptr;
   Unary_Expr_part : Unary_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Multiplicative_Expr_nonterminal3);
procedure Evaluate(This : in Multiplicative_Expr_nonterminal3;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Multiplicative_Expr_nonterminal4 is new Multiplicative_Expr_nonterminal with record
   Multiplicative_Expr_part : Multiplicative_Expr_nonterminal_ptr;
   MOD_part : Parseable_Token_Ptr;
   Unary_Expr_part : Unary_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Multiplicative_Expr_nonterminal4);
procedure Evaluate(This : in Multiplicative_Expr_nonterminal4;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Unary_Expr_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Unary_Expr_nonterminal
type Unary_Expr_nonterminal1 is new Unary_Expr_nonterminal with record
   Union_Expr_part : Union_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Unary_Expr_nonterminal1);
procedure Evaluate(This : in Unary_Expr_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Unary_Expr_nonterminal2 is new Unary_Expr_nonterminal with record
   MINUS_part : Parseable_Token_Ptr;
   Unary_Expr_part : Unary_Expr_nonterminal_ptr;
end record;
procedure Pathify(This : in out Unary_Expr_nonterminal2);
procedure Evaluate(This : in Unary_Expr_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Number_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Number_nonterminal
type Number_nonterminal1 is new Number_nonterminal with record
   INTEGER_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Number_nonterminal1);
procedure Evaluate(This : in Number_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Number_nonterminal2 is new Number_nonterminal with record
   DECIMAL_LITERAL_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Number_nonterminal2);
procedure Evaluate(This : in Number_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Literal_nonterminal is abstract new Parseable with null record;
--  Incomplete declaration: Literal_nonterminal
type Literal_nonterminal1 is new Literal_nonterminal with record
   DQ_LITERAL_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Literal_nonterminal1);
procedure Evaluate(This : in Literal_nonterminal1;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
type Literal_nonterminal2 is new Literal_nonterminal with record
   SQ_LITERAL_part : Parseable_Token_Ptr;
end record;
procedure Pathify(This : in out Literal_nonterminal2);
procedure Evaluate(This : in Literal_nonterminal2;
                   Context_Node : in     Node_Items;
                   Value : out Expression_Values);
procedure Reset;
end xia_parser_Model;
Generated on 2005-03-05 at 07:49:54 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/xia_parser_parser.html0100644000076600007670000001076710212334405016247 0ustar g315padadev Package: xia_parser_Parser

Package: xia_parser_Parser

Dependencies

with xia_parser_Model;
use xia_parser_Model;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package xia_parser_Parser is

Exceptions

Syntax_Error

Other Items:

procedure Run(Set_String : in String);
function Get_Parse_Tree return Parseable_Ptr;
end xia_parser_Parser;
Generated on 2005-03-05 at 07:49:57 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/xia_parser_shift_reduce.html0100644000076600007670000007265610212334406017425 0ustar g315padadev Package: Xia_Parser_Shift_Reduce

Package: Xia_Parser_Shift_Reduce

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package Xia_Parser_Shift_Reduce is

Type Summary

Shift_Reduce_Array
Shift_Reduce_Entry
Small_Integer

Constants and Named Numbers

Shift_Reduce_Matrix : constant Shift_Reduce_Array :=
    ( (-1,-1) -- Dummy Entry

-- state  0
,( 2, 68),( 16, 38),( 19, 16),( 20, 10)
,( 21, 21),( 22, 20),( 25, 59),( 30, 70)
,( 31, 71),( 32, 72),( 33, 69),( 34, 67)
,( 35, 58),( 36, 66),( 37, 65),( 38, 51)
,( 39, 50),( 40, 49),( 41, 48),( 42, 47)
,( 43, 46),( 44, 45),( 45, 44),( 46, 43)
,( 47, 42),( 48, 41),( 49, 40),( 50, 39)
,(-1,-3000)
-- state  1
,(-1,-50)
-- state  2
,( 19, 16),( 20, 10)
,(-1,-51)
-- state  3
,(-1,-52)
-- state  4
,(-1,-56)
-- state  5
,(-1,-58)

-- state  6
,( 2, 68),( 16, 38),( 21, 21),( 22, 20)
,( 25, 59),( 30, 70),( 31, 71),( 32, 72)
,( 33, 69),( 34, 67),( 35, 58),( 36, 66)
,( 37, 65),( 38, 51),( 39, 50),( 40, 49)
,( 41, 48),( 42, 47),( 43, 46),( 44, 45)
,( 45, 44),( 46, 43),( 47, 42),( 48, 41)
,( 49, 40),( 50, 39),(-1,-53)
-- state  7
,(-1,-55)

-- state  8
,(-1,-61)
-- state  9
,(-1,-60)
-- state  10
,(-1,-19)
-- state  11
,( 2, 68)
,( 16, 38),( 21, 21),( 22, 20),( 25, 59)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  12
,( 2, 68),( 25, 59)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  13
,(-1,-64)
-- state  14
,(-1,-104)

-- state  15
,(-1,-105)
-- state  16
,(-1,-18)
-- state  17
,( 17, 81),(-1,-95)

-- state  18
,(-1,-65)
-- state  19
,( 2, 68),( 25, 59),( 30, 70)
,( 31, 71),( 32, 72),( 33, 69),( 34, 67)
,( 35, 58),( 36, 66),( 37, 65),( 38, 51)
,( 39, 50),( 40, 49),( 41, 48),( 42, 47)
,( 43, 46),( 44, 45),( 45, 44),( 46, 43)
,( 47, 42),( 48, 41),( 49, 40),( 50, 39)
,(-1,-3000)
-- state  20
,(-1,-21)
-- state  21
,(-1,-20)
-- state  22
,(-1,-69)

-- state  23
,(-1,-70)
-- state  24
,(-1,-71)
-- state  25
,(-1,-72)
-- state  26
,(-1,-73)

-- state  27
,(-1,-74)
-- state  28
,(-1,-75)
-- state  29
,(-1,-76)
-- state  30
,(-1,-77)

-- state  31
,(-1,-78)
-- state  32
,(-1,-79)
-- state  33
,(-1,-80)
-- state  34
,(-1,-81)

-- state  35
,(-1,-82)
-- state  36
,( 29, 84),(-1,-96)
-- state  37
,( 29, 84)
,(-1,-87)
-- state  38
,(-1,-15)
-- state  39
,(-1,-49)
-- state  40
,(-1,-48)

-- state  41
,(-1,-47)
-- state  42
,(-1,-46)
-- state  43
,(-1,-45)
-- state  44
,(-1,-44)

-- state  45
,(-1,-43)
-- state  46
,(-1,-42)
-- state  47
,(-1,-41)
-- state  48
,(-1,-40)

-- state  49
,(-1,-39)
-- state  50
,(-1,-38)
-- state  51
,(-1,-37)
-- state  52
,(-1,-89)

-- state  53
,(-1,-90)
-- state  54
,( 18, 87),(-1,-92)
-- state  55
,(-1,-85)

-- state  56
,(-1,-86)
-- state  57
,(-1,-88)
-- state  58
,(-1,-34)
-- state  59
,(-1,-24)

-- state  60
,(-1,-94)
-- state  61
,(-1,-97)
-- state  62
,(-1,-98)
-- state  63
,(-1,-99)

-- state  64
,(-1,-100)
-- state  65
,(-1,-36)
-- state  66
,(-1,-35)
-- state  67
,(-1,-33)

-- state  68
,(-1,-1)
-- state  69
,(-1,-32)
-- state  70
,(-1,-29)
-- state  71
,(-1,-30)

-- state  72
,(-1,-31)
-- state  73
,( 0,-3001),(-1,-3000)
-- state  74
,( 2, 68)
,( 16, 38),( 21, 21),( 22, 20),( 25, 59)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  75
,( 2, 68),( 16, 38)
,( 21, 21),( 22, 20),( 25, 59),( 30, 70)
,( 31, 71),( 32, 72),( 33, 69),( 34, 67)
,( 35, 58),( 36, 66),( 37, 65),( 38, 51)
,( 39, 50),( 40, 49),( 41, 48),( 42, 47)
,( 43, 46),( 44, 45),( 45, 44),( 46, 43)
,( 47, 42),( 48, 41),( 49, 40),( 50, 39)
,(-1,-3000)
-- state  76
,( 19, 16),( 20, 10),(-1,-54)

-- state  77
,( 27, 93),(-1,-59)
-- state  78
,( 19, 16),( 20, 10)
,(-1,-102)
-- state  79
,(-1,-95)
-- state  80
,(-1,-63)
-- state  81
,(-1,-16)

-- state  82
,(-1,-68)
-- state  83
,(-1,-66)
-- state  84
,(-1,-28)
-- state  85
,( 28, 95)
,(-1,-3000)
-- state  86
,( 5, 99),( 6, 100),(-1,-3000)

-- state  87
,(-1,-17)
-- state  88
,( 2, 68),( 25, 59),( 30, 70)
,( 31, 71),( 32, 72),( 33, 69),( 34, 67)
,( 35, 58),( 36, 66),( 37, 65),( 38, 51)
,( 39, 50),( 40, 49),( 41, 48),( 42, 47)
,( 43, 46),( 44, 45),( 45, 44),( 46, 43)
,( 47, 42),( 48, 41),( 49, 40),( 50, 39)
,(-1,-3000)
-- state  89
,(-1,-3000)
-- state  90
,(-1,-57)
-- state  91
,(-1,-103)

-- state  92
,( 2, 68),( 3, 132),( 4, 131),( 5, 99)
,( 6, 100),( 14, 130),( 16, 38),( 19, 16)
,( 20, 10),( 21, 21),( 22, 20),( 23, 117)
,( 25, 59),( 29, 84),( 30, 70),( 31, 71)
,( 32, 72),( 33, 69),( 34, 67),( 35, 58)
,( 36, 66),( 37, 65),( 38, 51),( 39, 50)
,( 40, 49),( 41, 48),( 42, 47),( 43, 46)
,( 44, 45),( 45, 44),( 46, 43),( 47, 42)
,( 48, 41),( 49, 40),( 50, 39),(-1,-3000)

-- state  93
,(-1,-26)
-- state  94
,(-1,-62)
-- state  95
,(-1,-27)
-- state  96
,(-1,-83)

-- state  97
,(-1,-150)
-- state  98
,(-1,-151)
-- state  99
,(-1,-4)
-- state  100
,(-1,-5)

-- state  101
,( 28, 95),(-1,-3000)
-- state  102
,(-1,-96)
-- state  103
,(-1,-87)

-- state  104
,(-1,-91)
-- state  105
,(-1,-93)
-- state  106
,(-1,-101)
-- state  107
,( 30, 70)
,(-1,-106)
-- state  108
,( 33, 69),(-1,-127)
-- state  109
,( 11, 139)
,( 12, 138),(-1,-129)
-- state  110
,( 7, 144),( 8, 142)
,( 9, 145),( 10, 143),(-1,-131)
-- state  111
,( 23, 117)
,( 24, 150),(-1,-134)
-- state  112
,( 25, 59),( 31, 71)
,( 32, 72),(-1,-139)
-- state  113
,(-1,-142)
-- state  114
,( 13, 156)
,(-1,-146)
-- state  115
,( 2, 68),( 3, 132),( 4, 131)
,( 5, 99),( 6, 100),( 14, 130),( 16, 38)
,( 19, 16),( 20, 10),( 21, 21),( 22, 20)
,( 23, 117),( 25, 59),( 29, 84),( 30, 70)
,( 31, 71),( 32, 72),( 33, 69),( 34, 67)
,( 35, 58),( 36, 66),( 37, 65),( 38, 51)
,( 39, 50),( 40, 49),( 41, 48),( 42, 47)
,( 43, 46),( 44, 45),( 45, 44),( 46, 43)
,( 47, 42),( 48, 41),( 49, 40),( 50, 39)
,(-1,-3000)
-- state  116
,(-1,-119)
-- state  117
,(-1,-22)
-- state  118
,(-1,-121)

-- state  119
,( 19, 16),( 20, 10),( 27, 93),(-1,-122)

-- state  120
,(-1,-125)
-- state  121
,(-1,-107)
-- state  122
,( 2, 68),( 3, 132)
,( 4, 131),( 5, 99),( 6, 100),( 14, 130)
,( 16, 38),( 19, 16),( 20, 10),( 21, 21)
,( 22, 20),( 23, 117),( 25, 59),( 29, 84)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  123
,(-1,-109)
-- state  124
,(-1,-110)

-- state  125
,(-1,-111)
-- state  126
,( 2, 68),( 30, 70),( 31, 71)
,( 32, 72),( 33, 69),( 34, 67),( 35, 58)
,( 36, 66),( 37, 65),( 38, 51),( 39, 50)
,( 40, 49),( 41, 48),( 42, 47),( 43, 46)
,( 44, 45),( 45, 44),( 46, 43),( 47, 42)
,( 48, 41),( 49, 40),( 50, 39),(-1,-3000)

-- state  127
,(-1,-148)
-- state  128
,(-1,-149)
-- state  129
,( 29, 84),(-1,-3000)

-- state  130
,(-1,-13)
-- state  131
,(-1,-3)
-- state  132
,(-1,-2)
-- state  133
,( 29,-118)
,(-1,-90)
-- state  134
,( 26, 166),(-1,-3000)
-- state  135
,(-1,-84)

-- state  136
,( 2, 68),( 3, 132),( 4, 131),( 5, 99)
,( 6, 100),( 14, 130),( 16, 38),( 19, 16)
,( 20, 10),( 21, 21),( 22, 20),( 23, 117)
,( 25, 59),( 29, 84),( 30, 70),( 31, 71)
,( 32, 72),( 33, 69),( 34, 67),( 35, 58)
,( 36, 66),( 37, 65),( 38, 51),( 39, 50)
,( 40, 49),( 41, 48),( 42, 47),( 43, 46)
,( 44, 45),( 45, 44),( 46, 43),( 47, 42)
,( 48, 41),( 49, 40),( 50, 39),(-1,-3000)

-- state  137
,( 2, 68),( 3, 132),( 4, 131),( 5, 99)
,( 6, 100),( 14, 130),( 16, 38),( 19, 16)
,( 20, 10),( 21, 21),( 22, 20),( 23, 117)
,( 25, 59),( 29, 84),( 30, 70),( 31, 71)
,( 32, 72),( 33, 69),( 34, 67),( 35, 58)
,( 36, 66),( 37, 65),( 38, 51),( 39, 50)
,( 40, 49),( 41, 48),( 42, 47),( 43, 46)
,( 44, 45),( 45, 44),( 46, 43),( 47, 42)
,( 48, 41),( 49, 40),( 50, 39),(-1,-3000)

-- state  138
,(-1,-11)
-- state  139
,(-1,-10)
-- state  140
,( 2, 68),( 3, 132)
,( 4, 131),( 5, 99),( 6, 100),( 14, 130)
,( 16, 38),( 19, 16),( 20, 10),( 21, 21)
,( 22, 20),( 23, 117),( 25, 59),( 29, 84)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  141
,( 2, 68),( 3, 132)
,( 4, 131),( 5, 99),( 6, 100),( 14, 130)
,( 16, 38),( 19, 16),( 20, 10),( 21, 21)
,( 22, 20),( 23, 117),( 25, 59),( 29, 84)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  142
,(-1,-7)
-- state  143
,(-1,-9)

-- state  144
,(-1,-6)
-- state  145
,(-1,-8)
-- state  146
,( 2, 68),( 3, 132)
,( 4, 131),( 5, 99),( 6, 100),( 14, 130)
,( 16, 38),( 19, 16),( 20, 10),( 21, 21)
,( 22, 20),( 23, 117),( 25, 59),( 29, 84)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  147
,( 2, 68),( 3, 132)
,( 4, 131),( 5, 99),( 6, 100),( 14, 130)
,( 16, 38),( 19, 16),( 20, 10),( 21, 21)
,( 22, 20),( 23, 117),( 25, 59),( 29, 84)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  148
,( 2, 68),( 3, 132)
,( 4, 131),( 5, 99),( 6, 100),( 14, 130)
,( 16, 38),( 19, 16),( 20, 10),( 21, 21)
,( 22, 20),( 23, 117),( 25, 59),( 29, 84)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  149
,( 2, 68),( 3, 132)
,( 4, 131),( 5, 99),( 6, 100),( 14, 130)
,( 16, 38),( 19, 16),( 20, 10),( 21, 21)
,( 22, 20),( 23, 117),( 25, 59),( 29, 84)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  150
,(-1,-23)
-- state  151
,( 2, 68)
,( 3, 132),( 4, 131),( 5, 99),( 6, 100)
,( 14, 130),( 16, 38),( 19, 16),( 20, 10)
,( 21, 21),( 22, 20),( 23, 117),( 25, 59)
,( 29, 84),( 30, 70),( 31, 71),( 32, 72)
,( 33, 69),( 34, 67),( 35, 58),( 36, 66)
,( 37, 65),( 38, 51),( 39, 50),( 40, 49)
,( 41, 48),( 42, 47),( 43, 46),( 44, 45)
,( 45, 44),( 46, 43),( 47, 42),( 48, 41)
,( 49, 40),( 50, 39),(-1,-3000)
-- state  152
,( 2, 68)
,( 3, 132),( 4, 131),( 5, 99),( 6, 100)
,( 14, 130),( 16, 38),( 19, 16),( 20, 10)
,( 21, 21),( 22, 20),( 23, 117),( 25, 59)
,( 29, 84),( 30, 70),( 31, 71),( 32, 72)
,( 33, 69),( 34, 67),( 35, 58),( 36, 66)
,( 37, 65),( 38, 51),( 39, 50),( 40, 49)
,( 41, 48),( 42, 47),( 43, 46),( 44, 45)
,( 45, 44),( 46, 43),( 47, 42),( 48, 41)
,( 49, 40),( 50, 39),(-1,-3000)
-- state  153
,( 2, 68)
,( 3, 132),( 4, 131),( 5, 99),( 6, 100)
,( 14, 130),( 16, 38),( 19, 16),( 20, 10)
,( 21, 21),( 22, 20),( 23, 117),( 25, 59)
,( 29, 84),( 30, 70),( 31, 71),( 32, 72)
,( 33, 69),( 34, 67),( 35, 58),( 36, 66)
,( 37, 65),( 38, 51),( 39, 50),( 40, 49)
,( 41, 48),( 42, 47),( 43, 46),( 44, 45)
,( 45, 44),( 46, 43),( 47, 42),( 48, 41)
,( 49, 40),( 50, 39),(-1,-3000)
-- state  154
,( 2, 68)
,( 3, 132),( 4, 131),( 5, 99),( 6, 100)
,( 14, 130),( 16, 38),( 19, 16),( 20, 10)
,( 21, 21),( 22, 20),( 23, 117),( 25, 59)
,( 29, 84),( 30, 70),( 31, 71),( 32, 72)
,( 33, 69),( 34, 67),( 35, 58),( 36, 66)
,( 37, 65),( 38, 51),( 39, 50),( 40, 49)
,( 41, 48),( 42, 47),( 43, 46),( 44, 45)
,( 45, 44),( 46, 43),( 47, 42),( 48, 41)
,( 49, 40),( 50, 39),(-1,-3000)
-- state  155
,( 2, 68)
,( 3, 132),( 4, 131),( 5, 99),( 6, 100)
,( 14, 130),( 16, 38),( 19, 16),( 20, 10)
,( 21, 21),( 22, 20),( 23, 117),( 25, 59)
,( 29, 84),( 30, 70),( 31, 71),( 32, 72)
,( 33, 69),( 34, 67),( 35, 58),( 36, 66)
,( 37, 65),( 38, 51),( 39, 50),( 40, 49)
,( 41, 48),( 42, 47),( 43, 46),( 44, 45)
,( 45, 44),( 46, 43),( 47, 42),( 48, 41)
,( 49, 40),( 50, 39),(-1,-3000)
-- state  156
,(-1,-12)

-- state  157
,( 2, 68),( 3, 132),( 4, 131),( 5, 99)
,( 6, 100),( 14, 130),( 16, 38),( 19, 16)
,( 20, 10),( 21, 21),( 22, 20),( 25, 59)
,( 29, 84),( 30, 70),( 31, 71),( 32, 72)
,( 33, 69),( 34, 67),( 35, 58),( 36, 66)
,( 37, 65),( 38, 51),( 39, 50),( 40, 49)
,( 41, 48),( 42, 47),( 43, 46),( 44, 45)
,( 45, 44),( 46, 43),( 47, 42),( 48, 41)
,( 49, 40),( 50, 39),(-1,-3000)
-- state  158
,(-1,-147)

-- state  159
,( 2, 68),( 16, 38),( 21, 21),( 22, 20)
,( 25, 59),( 30, 70),( 31, 71),( 32, 72)
,( 33, 69),( 34, 67),( 35, 58),( 36, 66)
,( 37, 65),( 38, 51),( 39, 50),( 40, 49)
,( 41, 48),( 42, 47),( 43, 46),( 44, 45)
,( 45, 44),( 46, 43),( 47, 42),( 48, 41)
,( 49, 40),( 50, 39),(-1,-3000)
-- state  160
,( 2, 68)
,( 16, 38),( 21, 21),( 22, 20),( 25, 59)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  161
,(-1,-126)
-- state  162
,( 28, 95)
,(-1,-3000)
-- state  163
,( 18, 87),(-1,-92)
-- state  164
,(-1,-112)

-- state  165
,( 2, 68),( 3, 132),( 4, 131),( 5, 99)
,( 6, 100),( 14, 130),( 16, 38),( 19, 16)
,( 20, 10),( 21, 21),( 22, 20),( 23, 117)
,( 25, 59),( 29, 84),( 30, 70),( 31, 71)
,( 32, 72),( 33, 69),( 34, 67),( 35, 58)
,( 36, 66),( 37, 65),( 38, 51),( 39, 50)
,( 40, 49),( 41, 48),( 42, 47),( 43, 46)
,( 44, 45),( 45, 44),( 46, 43),( 47, 42)
,( 48, 41),( 49, 40),( 50, 39),(-1,-114)

-- state  166
,(-1,-25)
-- state  167
,(-1,-67)
-- state  168
,( 33, 69),(-1,-128)

-- state  169
,( 11, 139),( 12, 138),(-1,-130)
-- state  170
,( 7, 144)
,( 8, 142),( 9, 145),( 10, 143),(-1,-132)

-- state  171
,( 7, 144),( 8, 142),( 9, 145),( 10, 143)
,(-1,-133)
-- state  172
,( 23, 117),( 24, 150),(-1,-135)

-- state  173
,( 23, 117),( 24, 150),(-1,-136)
-- state  174
,( 23, 117)
,( 24, 150),(-1,-137)
-- state  175
,( 23, 117),( 24, 150)
,(-1,-138)
-- state  176
,( 25, 59),( 31, 71),( 32, 72)
,(-1,-140)
-- state  177
,( 25, 59),( 31, 71),( 32, 72)
,(-1,-141)
-- state  178
,(-1,-143)
-- state  179
,(-1,-144)
-- state  180
,(-1,-145)

-- state  181
,(-1,-120)
-- state  182
,( 19, 16),( 20, 10),(-1,-123)

-- state  183
,( 19, 16),( 20, 10),(-1,-124)
-- state  184
,(-1,-108)

-- state  185
,( 2, 68),( 30, 70),( 31, 71),( 32, 72)
,( 33, 69),( 34, 67),( 35, 58),( 36, 66)
,( 37, 65),( 38, 51),( 39, 50),( 40, 49)
,( 41, 48),( 42, 47),( 43, 46),( 44, 45)
,( 45, 44),( 46, 43),( 47, 42),( 48, 41)
,( 49, 40),( 50, 39),(-1,-3000)
-- state  186
,(-1,-115)

-- state  187
,( 15, 189),( 28, 95),(-1,-3000)
-- state  188
,(-1,-117)

-- state  189
,(-1,-14)
-- state  190
,(-1,-113)
-- state  191
,( 2, 68),( 3, 132)
,( 4, 131),( 5, 99),( 6, 100),( 14, 130)
,( 16, 38),( 19, 16),( 20, 10),( 21, 21)
,( 22, 20),( 23, 117),( 25, 59),( 29, 84)
,( 30, 70),( 31, 71),( 32, 72),( 33, 69)
,( 34, 67),( 35, 58),( 36, 66),( 37, 65)
,( 38, 51),( 39, 50),( 40, 49),( 41, 48)
,( 42, 47),( 43, 46),( 44, 45),( 45, 44)
,( 46, 43),( 47, 42),( 48, 41),( 49, 40)
,( 50, 39),(-1,-3000)
-- state  192
,(-1,-116)
);

Variables

SHIFT_REDUCE_OFFSET : array (0.. 192) of Integer :=
( 0,
 29, 30, 33, 34, 35, 36, 63, 64, 65, 66,
 67, 94, 118, 119, 120, 121, 122, 124, 125, 149,
 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,
 160, 161, 162, 163, 164, 165, 167, 169, 170, 171,
 172, 173, 174, 175, 176, 177, 178, 179, 180, 181,
 182, 183, 184, 185, 187, 188, 189, 190, 191, 192,
 193, 194, 195, 196, 197, 198, 199, 200, 201, 202,
 203, 204, 205, 207, 234, 261, 264, 266, 269, 270,
 271, 272, 273, 274, 275, 277, 280, 281, 305, 306,
 307, 308, 344, 345, 346, 347, 348, 349, 350, 351,
 352, 354, 355, 356, 357, 358, 359, 361, 363, 366,
 371, 374, 378, 379, 381, 417, 418, 419, 420, 424,
 425, 426, 462, 463, 464, 465, 488, 489, 490, 492,
 493, 494, 495, 497, 499, 500, 536, 572, 573, 574,
 610, 646, 647, 648, 649, 650, 686, 722, 758, 794,
 795, 831, 867, 903, 939, 975, 976, 1011, 1012, 1039,
 1066, 1067, 1069, 1071, 1072, 1108, 1109, 1110, 1112, 1115,
 1120, 1125, 1128, 1131, 1134, 1137, 1141, 1145, 1146, 1147,
 1148, 1149, 1152, 1155, 1156, 1179, 1180, 1183, 1184, 1185,
 1186, 1222);
The offset vector

Other Items:

type Small_Integer is range -32_000 .. 32_000;
type Shift_Reduce_Entry is record
    T   : Small_Integer;
    Act : Small_Integer;
end record;
pragma Pack(Shift_Reduce_Entry);
subtype Row is Integer range -1 .. Integer'Last;
type Shift_Reduce_Array is array (Row  range <>) of Shift_Reduce_Entry;
pragma suppress(index_check); 
end Xia_Parser_Shift_Reduce;
Generated on 2005-03-05 at 07:49:57 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/xia_parser_tokens.html0100644000076600007670000002072310212334406016250 0ustar g315padadev Package: xia_parser_tokens

Package: xia_parser_tokens

Dependencies

with xia_parser_Model;
use xia_parser_Model;

Description

McKae Software Utilities

Copyright (C) 2004 McKae Technologies

The McKae software utilities are free software; you can redistribute it and/or modify it under terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. McKae Software Utilities are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License distributed with DTraq; see file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.

As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. This exception does not however invalidate any other reasons why the executable file might be covered by the GNU Public License.

The McKae Software Utilities are maintained by McKae Technologies (http://www.mckae.com).

Header

package xia_parser_tokens is

Exceptions

Syntax_Error

Type Summary

Token

Variables

YYLVal, YYVal : YYSTYPE;

Other Items:

subtype YYSTYPE is xia_parser_Model.Parseable_Ptr;
type Token is
    (End_Of_Input, Error, Ncname_Token, Decimal_Literal_Token,
     Integer_Token, Dq_Literal_Token, Sq_Literal_Token,
     Le_Token, Lt_Token, Ge_Token,
     Gt_Token, Ne_Token, Eq_Token,
     V_Bar_Token, Dollar_Token, Comma_Token,
     At_Sign_Token, Double_Colon_Token, Colon_Token,
     Double_Slash_Token, Slash_Token, Double_Dot_Token,
     Dot_Token, Minus_Token, Plus_Token,
     Star_Token, R_Bracket_Token, L_Bracket_Token,
     R_Paren_Token, L_Paren_Token, Or_Token,
     Mod_Token, Div_Token, And_Token,
     Node_Token, Processing_Instruction_Token, Text_Token,
     Comment_Token, Self_Token, Preceding_Sibling_Token,
     Preceding_Token, Parent_Token, Namespace_Token,
     Following_Sibling_Token, Following_Token, Descendant_Or_Self_Token,
     Descendant_Token, Child_Token, Attribute_Token,
     Ancestor_Or_Self_Token, Ancestor_Token );
end xia_parser_tokens;
Generated on 2005-03-05 at 07:49:58 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/doc/ada_main.html0100644000076600007670000032633610212334143014270 0ustar g315padadev Package: ada_main

Package: ada_main

Dependencies

with System;

Header

package ada_main is

Type Summary

Version_32

Constants and Named Numbers

Ada_Main_Program_Name : constant String := "_ada_bench_xpath" & ASCII.NUL;
pragma Export (C, Ada_Main_Program_Name, "__gnat_ada_main_program_name");
GNAT_Version : constant String :=
                 "GNAT Version: 3.15p  (20020523)";
pragma Export (C, GNAT_Version, "__gnat_version");
u00001 : constant Version_32 := 16#b773cd9a#;
pragma Export (C, u00001, "bench_xpathB");
u00002 : constant Version_32 := 16#612a2371#;
pragma Export (C, u00002, "system__standard_libraryB");
u00003 : constant Version_32 := 16#6d0b25e7#;
pragma Export (C, u00003, "system__standard_libraryS");
u00004 : constant Version_32 := 16#a0108083#;
pragma Export (C, u00004, "adaS");
u00005 : constant Version_32 := 16#b5ef5a33#;
pragma Export (C, u00005, "ada__calendarB");
u00006 : constant Version_32 := 16#2311df51#;
pragma Export (C, u00006, "ada__calendarS");
u00007 : constant Version_32 := 16#235ade03#;
pragma Export (C, u00007, "ada__exceptionsB");
u00008 : constant Version_32 := 16#11b999eb#;
pragma Export (C, u00008, "ada__exceptionsS");
u00009 : constant Version_32 := 16#6380ea48#;
pragma Export (C, u00009, "gnatS");
u00010 : constant Version_32 := 16#c5fbb2c4#;
pragma Export (C, u00010, "gnat__heap_sort_aB");
u00011 : constant Version_32 := 16#dc301c49#;
pragma Export (C, u00011, "gnat__heap_sort_aS");
u00012 : constant Version_32 := 16#6e13833c#;
pragma Export (C, u00012, "systemS");
u00013 : constant Version_32 := 16#58c090c8#;
pragma Export (C, u00013, "system__exception_tableB");
u00014 : constant Version_32 := 16#4a904dde#;
pragma Export (C, u00014, "system__exception_tableS");
u00015 : constant Version_32 := 16#2c01a59d#;
pragma Export (C, u00015, "gnat__htableB");
u00016 : constant Version_32 := 16#eb251ef2#;
pragma Export (C, u00016, "gnat__htableS");
u00017 : constant Version_32 := 16#bbfe2e15#;
pragma Export (C, u00017, "system__exceptionsS");
u00018 : constant Version_32 := 16#aafe6ddd#;
pragma Export (C, u00018, "system__machine_state_operationsB");
u00019 : constant Version_32 := 16#54c27942#;
pragma Export (C, u00019, "system__machine_state_operationsS");
u00020 : constant Version_32 := 16#9f9be1af#;
pragma Export (C, u00020, "system__machine_codeS");
u00021 : constant Version_32 := 16#4b0fa71c#;
pragma Export (C, u00021, "system__memoryB");
u00022 : constant Version_32 := 16#63e1558c#;
pragma Export (C, u00022, "system__memoryS");
u00023 : constant Version_32 := 16#85d0fac3#;
pragma Export (C, u00023, "system__soft_linksB");
u00024 : constant Version_32 := 16#5c183864#;
pragma Export (C, u00024, "system__soft_linksS");
u00025 : constant Version_32 := 16#e1ec3288#;
pragma Export (C, u00025, "system__parametersB");
u00026 : constant Version_32 := 16#5f4efe2a#;
pragma Export (C, u00026, "system__parametersS");
u00027 : constant Version_32 := 16#7e6eaca1#;
pragma Export (C, u00027, "system__secondary_stackB");
u00028 : constant Version_32 := 16#4b29acb2#;
pragma Export (C, u00028, "system__secondary_stackS");
u00029 : constant Version_32 := 16#a4e49d90#;
pragma Export (C, u00029, "system__storage_elementsB");
u00030 : constant Version_32 := 16#a8ad7391#;
pragma Export (C, u00030, "system__storage_elementsS");
u00031 : constant Version_32 := 16#9a0b3df4#;
pragma Export (C, u00031, "system__stack_checkingB");
u00032 : constant Version_32 := 16#2768fd3b#;
pragma Export (C, u00032, "system__stack_checkingS");
u00033 : constant Version_32 := 16#4d4e8ee2#;
pragma Export (C, u00033, "system__tracebackB");
u00034 : constant Version_32 := 16#585eb6a3#;
pragma Export (C, u00034, "system__tracebackS");
u00035 : constant Version_32 := 16#6e859da6#;
pragma Export (C, u00035, "interfacesS");
u00036 : constant Version_32 := 16#e101275d#;
pragma Export (C, u00036, "system__arith_64B");
u00037 : constant Version_32 := 16#bef275a6#;
pragma Export (C, u00037, "system__arith_64S");
u00038 : constant Version_32 := 16#350327a4#;
pragma Export (C, u00038, "gnat__exceptionsS");
u00039 : constant Version_32 := 16#6b2fb776#;
pragma Export (C, u00039, "system__os_primitivesB");
u00040 : constant Version_32 := 16#7908bba4#;
pragma Export (C, u00040, "system__os_primitivesS");
u00041 : constant Version_32 := 16#c4504387#;
pragma Export (C, u00041, "ada__stringsS");
u00042 : constant Version_32 := 16#a757981e#;
pragma Export (C, u00042, "ada__strings__fixedB");
u00043 : constant Version_32 := 16#a09484f4#;
pragma Export (C, u00043, "ada__strings__fixedS");
u00044 : constant Version_32 := 16#7f70d6fb#;
pragma Export (C, u00044, "ada__strings__mapsB");
u00045 : constant Version_32 := 16#841ddc3f#;
pragma Export (C, u00045, "ada__strings__mapsS");
u00046 : constant Version_32 := 16#86556232#;
pragma Export (C, u00046, "system__bit_opsB");
u00047 : constant Version_32 := 16#0c033dfd#;
pragma Export (C, u00047, "system__bit_opsS");
u00048 : constant Version_32 := 16#6bbeb40e#;
pragma Export (C, u00048, "system__unsigned_typesS");
u00049 : constant Version_32 := 16#060f352a#;
pragma Export (C, u00049, "ada__charactersS");
u00050 : constant Version_32 := 16#a0be30a8#;
pragma Export (C, u00050, "ada__characters__latin_1S");
u00051 : constant Version_32 := 16#6b03b68b#;
pragma Export (C, u00051, "ada__strings__searchB");
u00052 : constant Version_32 := 16#ebae4dd3#;
pragma Export (C, u00052, "ada__strings__searchS");
u00053 : constant Version_32 := 16#186746af#;
pragma Export (C, u00053, "domS");
u00054 : constant Version_32 := 16#7898d649#;
pragma Export (C, u00054, "dom__coreB");
u00055 : constant Version_32 := 16#4c0a327e#;
pragma Export (C, u00055, "dom__coreS");
u00056 : constant Version_32 := 16#ffad3e68#;
pragma Export (C, u00056, "ada__finalization__list_controllerB");
u00057 : constant Version_32 := 16#29e5afbc#;
pragma Export (C, u00057, "ada__finalization__list_controllerS");
u00058 : constant Version_32 := 16#dec8b4cc#;
pragma Export (C, u00058, "ada__finalizationB");
u00059 : constant Version_32 := 16#0af0a97f#;
pragma Export (C, u00059, "ada__finalizationS");
u00060 : constant Version_32 := 16#2707dc21#;
pragma Export (C, u00060, "system__finalization_rootB");
u00061 : constant Version_32 := 16#cbab28f3#;
pragma Export (C, u00061, "system__finalization_rootS");
u00062 : constant Version_32 := 16#7bf62c37#;
pragma Export (C, u00062, "ada__streamsS");
u00063 : constant Version_32 := 16#4475095f#;
pragma Export (C, u00063, "ada__tagsB");
u00064 : constant Version_32 := 16#b4c4d87b#;
pragma Export (C, u00064, "ada__tagsS");
u00065 : constant Version_32 := 16#b2e77bbf#;
pragma Export (C, u00065, "system__finalization_implementationB");
u00066 : constant Version_32 := 16#ff282f59#;
pragma Export (C, u00066, "system__finalization_implementationS");
u00067 : constant Version_32 := 16#9d5e2b8a#;
pragma Export (C, u00067, "system__string_ops_concat_3B");
u00068 : constant Version_32 := 16#954fba58#;
pragma Export (C, u00068, "system__string_ops_concat_3S");
u00069 : constant Version_32 := 16#cf0ab27e#;
pragma Export (C, u00069, "system__string_opsB");
u00070 : constant Version_32 := 16#7324ea3c#;
pragma Export (C, u00070, "system__string_opsS");
u00071 : constant Version_32 := 16#de189fd2#;
pragma Export (C, u00071, "system__stream_attributesB");
u00072 : constant Version_32 := 16#41941407#;
pragma Export (C, u00072, "system__stream_attributesS");
u00073 : constant Version_32 := 16#753e9209#;
pragma Export (C, u00073, "ada__io_exceptionsS");
u00074 : constant Version_32 := 16#d17f6019#;
pragma Export (C, u00074, "unicodeB");
u00075 : constant Version_32 := 16#21bfefe0#;
pragma Export (C, u00075, "unicodeS");
u00076 : constant Version_32 := 16#c157e241#;
pragma Export (C, u00076, "unicode__namesS");
u00077 : constant Version_32 := 16#af92dafb#;
pragma Export (C, u00077, "unicode__names__basic_latinS");
u00078 : constant Version_32 := 16#4218d6e0#;
pragma Export (C, u00078, "unicode__names__latin_extended_aS");
u00079 : constant Version_32 := 16#6b8c0508#;
pragma Export (C, u00079, "unicode__cesB");
u00080 : constant Version_32 := 16#074eaa2a#;
pragma Export (C, u00080, "unicode__cesS");
u00081 : constant Version_32 := 16#37511451#;
pragma Export (C, u00081, "dom__core__nodesB");
u00082 : constant Version_32 := 16#d8b6bc4b#;
pragma Export (C, u00082, "dom__core__nodesS");
u00083 : constant Version_32 := 16#10bf32a4#;
pragma Export (C, u00083, "ada__text_ioB");
u00084 : constant Version_32 := 16#4c5d7ff9#;
pragma Export (C, u00084, "ada__text_ioS");
u00085 : constant Version_32 := 16#83609014#;
pragma Export (C, u00085, "interfaces__c_streamsB");
u00086 : constant Version_32 := 16#139120f0#;
pragma Export (C, u00086, "interfaces__c_streamsS");
u00087 : constant Version_32 := 16#67de7468#;
pragma Export (C, u00087, "system__file_ioB");
u00088 : constant Version_32 := 16#24457ec0#;
pragma Export (C, u00088, "system__file_ioS");
u00089 : constant Version_32 := 16#edfd8ecc#;
pragma Export (C, u00089, "system__file_control_blockS");
u00090 : constant Version_32 := 16#03f3874e#;
pragma Export (C, u00090, "saxS");
u00091 : constant Version_32 := 16#aadb18bf#;
pragma Export (C, u00091, "sax__encodingsS");
u00092 : constant Version_32 := 16#d0851c82#;
pragma Export (C, u00092, "unicode__ces__utf32B");
u00093 : constant Version_32 := 16#fc8d0a9b#;
pragma Export (C, u00093, "unicode__ces__utf32S");
u00094 : constant Version_32 := 16#0aeb35ef#;
pragma Export (C, u00094, "unicode__ccsB");
u00095 : constant Version_32 := 16#93e76649#;
pragma Export (C, u00095, "unicode__ccsS");
u00096 : constant Version_32 := 16#01b51578#;
pragma Export (C, u00096, "unicode__ccs__iso_8859_1B");
u00097 : constant Version_32 := 16#f82acd4d#;
pragma Export (C, u00097, "unicode__ccs__iso_8859_1S");
u00098 : constant Version_32 := 16#675bc9eb#;
pragma Export (C, u00098, "system__img_unsB");
u00099 : constant Version_32 := 16#8e8dd794#;
pragma Export (C, u00099, "system__img_unsS");
u00100 : constant Version_32 := 16#fb1356ff#;
pragma Export (C, u00100, "unicode__ccs__iso_8859_2B");
u00101 : constant Version_32 := 16#75b6deaf#;
pragma Export (C, u00101, "unicode__ccs__iso_8859_2S");
u00102 : constant Version_32 := 16#2b289f68#;
pragma Export (C, u00102, "unicode__names__latin_1_supplementS");
u00103 : constant Version_32 := 16#980a9359#;
pragma Export (C, u00103, "unicode__names__spacing_modifier_lettersS");
u00104 : constant Version_32 := 16#c84693a3#;
pragma Export (C, u00104, "unicode__ccs__iso_8859_3B");
u00105 : constant Version_32 := 16#99d08b1f#;
pragma Export (C, u00105, "unicode__ccs__iso_8859_3S");
u00106 : constant Version_32 := 16#056fcb29#;
pragma Export (C, u00106, "unicode__ccs__iso_8859_4B");
u00107 : constant Version_32 := 16#c493af13#;
pragma Export (C, u00107, "unicode__ccs__iso_8859_4S");
u00108 : constant Version_32 := 16#081ab016#;
pragma Export (C, u00108, "unicode__ces__utf8B");
u00109 : constant Version_32 := 16#9dc34e39#;
pragma Export (C, u00109, "unicode__ces__utf8S");
u00110 : constant Version_32 := 16#2f260ced#;
pragma Export (C, u00110, "dom__readersB");
u00111 : constant Version_32 := 16#301bcb4f#;
pragma Export (C, u00111, "dom__readersS");
u00112 : constant Version_32 := 16#c844251b#;
pragma Export (C, u00112, "dom__core__documentsB");
u00113 : constant Version_32 := 16#19aa58e4#;
pragma Export (C, u00113, "dom__core__documentsS");
u00114 : constant Version_32 := 16#a1a789a4#;
pragma Export (C, u00114, "dom__core__elementsB");
u00115 : constant Version_32 := 16#8b5010d6#;
pragma Export (C, u00115, "dom__core__elementsS");
u00116 : constant Version_32 := 16#c163ab76#;
pragma Export (C, u00116, "dom__core__attrsB");
u00117 : constant Version_32 := 16#ab19c0b5#;
pragma Export (C, u00117, "dom__core__attrsS");
u00118 : constant Version_32 := 16#4a428245#;
pragma Export (C, u00118, "sax__attributesB");
u00119 : constant Version_32 := 16#7595c132#;
pragma Export (C, u00119, "sax__attributesS");
u00120 : constant Version_32 := 16#be2c01ec#;
pragma Export (C, u00120, "sax__modelsB");
u00121 : constant Version_32 := 16#82f8a2c0#;
pragma Export (C, u00121, "sax__modelsS");
u00122 : constant Version_32 := 16#c6d83e9e#;
pragma Export (C, u00122, "ada__strings__unboundedB");
u00123 : constant Version_32 := 16#83fe2908#;
pragma Export (C, u00123, "ada__strings__unboundedS");
u00124 : constant Version_32 := 16#6eabb7eb#;
pragma Export (C, u00124, "sax__exceptionsB");
u00125 : constant Version_32 := 16#f163e59d#;
pragma Export (C, u00125, "sax__exceptionsS");
u00126 : constant Version_32 := 16#698440e0#;
pragma Export (C, u00126, "sax__locatorsB");
u00127 : constant Version_32 := 16#c24d42a5#;
pragma Export (C, u00127, "sax__locatorsS");
u00128 : constant Version_32 := 16#70f6a786#;
pragma Export (C, u00128, "system__img_intB");
u00129 : constant Version_32 := 16#9fa9075f#;
pragma Export (C, u00129, "system__img_intS");
u00130 : constant Version_32 := 16#ec185bba#;
pragma Export (C, u00130, "system__string_ops_concat_5B");
u00131 : constant Version_32 := 16#39231fdf#;
pragma Export (C, u00131, "system__string_ops_concat_5S");
u00132 : constant Version_32 := 16#cfb745b6#;
pragma Export (C, u00132, "system__string_ops_concat_4B");
u00133 : constant Version_32 := 16#52d7af9a#;
pragma Export (C, u00133, "system__string_ops_concat_4S");
u00134 : constant Version_32 := 16#cb09c5ed#;
pragma Export (C, u00134, "sax__readersB");
u00135 : constant Version_32 := 16#b60cdbf4#;
pragma Export (C, u00135, "sax__readersS");
u00136 : constant Version_32 := 16#a34d3e23#;
pragma Export (C, u00136, "input_sourcesB");
u00137 : constant Version_32 := 16#55accbbb#;
pragma Export (C, u00137, "input_sourcesS");
u00138 : constant Version_32 := 16#f6447ab9#;
pragma Export (C, u00138, "ada__characters__handlingB");
u00139 : constant Version_32 := 16#46d230ec#;
pragma Export (C, u00139, "ada__characters__handlingS");
u00140 : constant Version_32 := 16#6b21310c#;
pragma Export (C, u00140, "ada__strings__maps__constantsS");
u00141 : constant Version_32 := 16#32531087#;
pragma Export (C, u00141, "unicode__ces__basic_8bitB");
u00142 : constant Version_32 := 16#71728af9#;
pragma Export (C, u00142, "unicode__ces__basic_8bitS");
u00143 : constant Version_32 := 16#47b22ecb#;
pragma Export (C, u00143, "input_sources__fileB");
u00144 : constant Version_32 := 16#5f1d3024#;
pragma Export (C, u00144, "input_sources__fileS");
u00145 : constant Version_32 := 16#4756b107#;
pragma Export (C, u00145, "system__direct_ioB");
u00146 : constant Version_32 := 16#c8497aaf#;
pragma Export (C, u00146, "system__direct_ioS");
u00147 : constant Version_32 := 16#ec951784#;
pragma Export (C, u00147, "unicode__ces__utf16B");
u00148 : constant Version_32 := 16#6d6bdc53#;
pragma Export (C, u00148, "unicode__ces__utf16S");
u00149 : constant Version_32 := 16#9a87120b#;
pragma Export (C, u00149, "input_sources__stringsB");
u00150 : constant Version_32 := 16#3a956cfe#;
pragma Export (C, u00150, "input_sources__stringsS");
u00151 : constant Version_32 := 16#0d4a8bcc#;
pragma Export (C, u00151, "system__img_enumB");
u00152 : constant Version_32 := 16#4e709ef2#;
pragma Export (C, u00152, "system__img_enumS");
u00153 : constant Version_32 := 16#a1434930#;
pragma Export (C, u00153, "sax__htableB");
u00154 : constant Version_32 := 16#ca44f9cd#;
pragma Export (C, u00154, "sax__htableS");
u00155 : constant Version_32 := 16#47e407af#;
pragma Export (C, u00155, "mckaeS");
u00156 : constant Version_32 := 16#55823e23#;
pragma Export (C, u00156, "mckae__xmlS");
u00157 : constant Version_32 := 16#9ff2e03a#;
pragma Export (C, u00157, "mckae__xml__xpathS");
u00158 : constant Version_32 := 16#c9376709#;
pragma Export (C, u00158, "mckae__xml__xpath__locationsB");
u00159 : constant Version_32 := 16#6f5bef81#;
pragma Export (C, u00159, "mckae__xml__xpath__locationsS");
u00160 : constant Version_32 := 16#b380ca7b#;
pragma Export (C, u00160, "text_ioS");
u00161 : constant Version_32 := 16#1d607d3e#;
pragma Export (C, u00161, "mckae__xml__xpath__predicatesB");
u00162 : constant Version_32 := 16#13b39b6b#;
pragma Export (C, u00162, "mckae__xml__xpath__predicatesS");
u00163 : constant Version_32 := 16#939b4e18#;
pragma Export (C, u00163, "bcS");
u00164 : constant Version_32 := 16#0f979b10#;
pragma Export (C, u00164, "bc__containersB");
u00165 : constant Version_32 := 16#e54b50c4#;
pragma Export (C, u00165, "bc__containersS");
u00166 : constant Version_32 := 16#0e0f6826#;
pragma Export (C, u00166, "bc__containers__collectionsB");
u00167 : constant Version_32 := 16#862e0a5c#;
pragma Export (C, u00167, "bc__containers__collectionsS");
u00168 : constant Version_32 := 16#bf8007b9#;
pragma Export (C, u00168, "bc__containers__collections__orderedS");
u00169 : constant Version_32 := 16#4e7cb333#;
pragma Export (C, u00169, "bc__containers__collections__ordered__unboundedB");
u00170 : constant Version_32 := 16#7cce921d#;
pragma Export (C, u00170, "bc__containers__collections__ordered__unboundedS");
u00171 : constant Version_32 := 16#1fb3c3c2#;
pragma Export (C, u00171, "bc__supportS");
u00172 : constant Version_32 := 16#bda46f47#;
pragma Export (C, u00172, "bc__support__unboundedB");
u00173 : constant Version_32 := 16#17286401#;
pragma Export (C, u00173, "bc__support__unboundedS");
u00174 : constant Version_32 := 16#5ce81d63#;
pragma Export (C, u00174, "bc__support__exceptionsB");
u00175 : constant Version_32 := 16#6145f3db#;
pragma Export (C, u00175, "bc__support__exceptionsS");
u00176 : constant Version_32 := 16#49c36939#;
pragma Export (C, u00176, "system__pool_localB");
u00177 : constant Version_32 := 16#7fadfb77#;
pragma Export (C, u00177, "system__pool_localS");
u00178 : constant Version_32 := 16#eccea43e#;
pragma Export (C, u00178, "system__pool_globalB");
u00179 : constant Version_32 := 16#17627801#;
pragma Export (C, u00179, "system__pool_globalS");
u00180 : constant Version_32 := 16#9371c92b#;
pragma Export (C, u00180, "system__storage_poolsS");
u00181 : constant Version_32 := 16#80cdc701#;
pragma Export (C, u00181, "system__pool_sizeB");
u00182 : constant Version_32 := 16#83a887d0#;
pragma Export (C, u00182, "system__pool_sizeS");
u00183 : constant Version_32 := 16#1e8272bb#;
pragma Export (C, u00183, "bc__support__standard_storageS");
u00184 : constant Version_32 := 16#5013a36f#;
pragma Export (C, u00184, "xia_parser_modelB");
u00185 : constant Version_32 := 16#1144c4bc#;
pragma Export (C, u00185, "xia_parser_modelS");
u00186 : constant Version_32 := 16#e9966bed#;
pragma Export (C, u00186, "dom__core__append_nodeB");
u00187 : constant Version_32 := 16#92cb7700#;
pragma Export (C, u00187, "dom__core__append_nodeS");
u00188 : constant Version_32 := 16#bcea7524#;
pragma Export (C, u00188, "mckae__xml__xpath__expressionsB");
u00189 : constant Version_32 := 16#aa0a6938#;
pragma Export (C, u00189, "mckae__xml__xpath__expressionsS");
u00190 : constant Version_32 := 16#a0b17356#;
pragma Export (C, u00190, "ada__long_float_text_ioB");
u00191 : constant Version_32 := 16#987650a9#;
pragma Export (C, u00191, "ada__long_float_text_ioS");
u00192 : constant Version_32 := 16#502c314b#;
pragma Export (C, u00192, "ada__text_io__float_auxB");
u00193 : constant Version_32 := 16#225b124c#;
pragma Export (C, u00193, "ada__text_io__float_auxS");
u00194 : constant Version_32 := 16#ae3d0e1f#;
pragma Export (C, u00194, "ada__text_io__generic_auxB");
u00195 : constant Version_32 := 16#9ae01713#;
pragma Export (C, u00195, "ada__text_io__generic_auxS");
u00196 : constant Version_32 := 16#7278d14c#;
pragma Export (C, u00196, "system__img_realB");
u00197 : constant Version_32 := 16#a9871027#;
pragma Export (C, u00197, "system__img_realS");
u00198 : constant Version_32 := 16#49620182#;
pragma Export (C, u00198, "system__fat_llfS");
u00199 : constant Version_32 := 16#f2d52f0b#;
pragma Export (C, u00199, "system__img_lluB");
u00200 : constant Version_32 := 16#a3f47b18#;
pragma Export (C, u00200, "system__img_lluS");
u00201 : constant Version_32 := 16#eaadbb65#;
pragma Export (C, u00201, "system__powten_tableS");
u00202 : constant Version_32 := 16#e5d7f7d8#;
pragma Export (C, u00202, "system__val_realB");
u00203 : constant Version_32 := 16#ee2ed57e#;
pragma Export (C, u00203, "system__val_realS");
u00204 : constant Version_32 := 16#7e0c56d6#;
pragma Export (C, u00204, "system__exn_llfS");
u00205 : constant Version_32 := 16#15aa9939#;
pragma Export (C, u00205, "system__exn_genB");
u00206 : constant Version_32 := 16#ed352789#;
pragma Export (C, u00206, "system__exn_genS");
u00207 : constant Version_32 := 16#47a468aa#;
pragma Export (C, u00207, "system__val_utilB");
u00208 : constant Version_32 := 16#9edfc99c#;
pragma Export (C, u00208, "system__val_utilS");
u00209 : constant Version_32 := 16#1e439027#;
pragma Export (C, u00209, "gnat__case_utilB");
u00210 : constant Version_32 := 16#f3d435e7#;
pragma Export (C, u00210, "gnat__case_utilS");
u00211 : constant Version_32 := 16#aee2575e#;
pragma Export (C, u00211, "mckae__xml__xpath__xiaB");
u00212 : constant Version_32 := 16#67df865f#;
pragma Export (C, u00212, "mckae__xml__xpath__xiaS");
u00213 : constant Version_32 := 16#27133be1#;
pragma Export (C, u00213, "mckae__spaceS");
u00214 : constant Version_32 := 16#294c107a#;
pragma Export (C, u00214, "mckae__space__unbounded_string_expandableB");
u00215 : constant Version_32 := 16#a818b76a#;
pragma Export (C, u00215, "mckae__space__unbounded_string_expandableS");
u00216 : constant Version_32 := 16#db17c635#;
pragma Export (C, u00216, "mckae__xml__xpath__node_setsB");
u00217 : constant Version_32 := 16#2629b993#;
pragma Export (C, u00217, "mckae__xml__xpath__node_setsS");
u00218 : constant Version_32 := 16#bf527645#;
pragma Export (C, u00218, "bc__containers__collections__unboundedB");
u00219 : constant Version_32 := 16#ca4a7569#;
pragma Export (C, u00219, "bc__containers__collections__unboundedS");
u00220 : constant Version_32 := 16#a4586215#;
pragma Export (C, u00220, "bc__containers__setsB");
u00221 : constant Version_32 := 16#c19f977f#;
pragma Export (C, u00221, "bc__containers__setsS");
u00222 : constant Version_32 := 16#a10b306e#;
pragma Export (C, u00222, "bc__containers__sets__unboundedB");
u00223 : constant Version_32 := 16#ff56b51c#;
pragma Export (C, u00223, "bc__containers__sets__unboundedS");
u00224 : constant Version_32 := 16#c33dca81#;
pragma Export (C, u00224, "bc__support__hash_tablesB");
u00225 : constant Version_32 := 16#674df1b1#;
pragma Export (C, u00225, "bc__support__hash_tablesS");
u00226 : constant Version_32 := 16#751493a8#;
pragma Export (C, u00226, "bc__containers__treesS");
u00227 : constant Version_32 := 16#605c93ad#;
pragma Export (C, u00227, "bc__containers__trees__avlB");
u00228 : constant Version_32 := 16#f5dea229#;
pragma Export (C, u00228, "bc__containers__trees__avlS");
u00229 : constant Version_32 := 16#e4534d81#;
pragma Export (C, u00229, "mckae__xml__xpath__predicates__evaluationB");
u00230 : constant Version_32 := 16#790ad67c#;
pragma Export (C, u00230, "mckae__xml__xpath__predicates__evaluationS");
u00231 : constant Version_32 := 16#26242d0a#;
pragma Export (C, u00231, "system__assertionsB");
u00232 : constant Version_32 := 16#e136e445#;
pragma Export (C, u00232, "system__assertionsS");
u00233 : constant Version_32 := 16#9ec80eaa#;
pragma Export (C, u00233, "mckae__xml__xpath__query_handlingB");
u00234 : constant Version_32 := 16#063fdced#;
pragma Export (C, u00234, "mckae__xml__xpath__query_handlingS");
u00235 : constant Version_32 := 16#46073890#;
pragma Export (C, u00235, "xia_parser_parserB");
u00236 : constant Version_32 := 16#b28de2b0#;
pragma Export (C, u00236, "xia_parser_parserS");
u00237 : constant Version_32 := 16#065f5f8a#;
pragma Export (C, u00237, "xia_parserB");
u00238 : constant Version_32 := 16#980e0032#;
pragma Export (C, u00238, "xia_parserS");
u00239 : constant Version_32 := 16#1b92a8d3#;
pragma Export (C, u00239, "xia_parser_ioB");
u00240 : constant Version_32 := 16#d9f6371c#;
pragma Export (C, u00240, "xia_parser_ioS");
u00241 : constant Version_32 := 16#c7ee8d97#;
pragma Export (C, u00241, "xia_parser_dfaB");
u00242 : constant Version_32 := 16#ae53017d#;
pragma Export (C, u00242, "xia_parser_dfaS");
u00243 : constant Version_32 := 16#b2c63a6d#;
pragma Export (C, u00243, "xia_parser_gotoS");
u00244 : constant Version_32 := 16#b6a09e8b#;
pragma Export (C, u00244, "xia_parser_shift_reduceS");
u00245 : constant Version_32 := 16#efae03fe#;
pragma Export (C, u00245, "xia_parser_tokensS");
u00246 : constant Version_32 := 16#1cc6e8b2#;
pragma Export (C, u00246, "system__fat_lfltS");
u00247 : constant Version_32 := 16#5fde144c#;
pragma Export (C, u00247, "system__val_intB");
u00248 : constant Version_32 := 16#b976df8b#;
pragma Export (C, u00248, "system__val_intS");
u00249 : constant Version_32 := 16#9eef795c#;
pragma Export (C, u00249, "system__val_unsB");
u00250 : constant Version_32 := 16#7632ebb5#;
pragma Export (C, u00250, "system__val_unsS");
BEGIN ELABORATION ORDER ada (spec) ada.characters (spec) ada.characters.handling (spec) ada.characters.latin_1 (spec) gnat (spec) gnat.case_util (spec) gnat.case_util (body) gnat.exceptions (spec) gnat.heap_sort_a (spec) gnat.heap_sort_a (body) gnat.htable (spec) gnat.htable (body) interfaces (spec) system (spec) system.arith_64 (spec) system.arith_64 (body) system.bit_ops (spec) system.exn_gen (spec) system.exn_gen (body) system.img_enum (spec) system.img_int (spec) system.img_real (spec) system.machine_code (spec) system.os_primitives (spec) system.os_primitives (body) system.parameters (spec) system.parameters (body) interfaces.c_streams (spec) interfaces.c_streams (body) system.powten_table (spec) system.standard_library (spec) ada.exceptions (spec) system.exception_table (spec) system.exception_table (body) ada.calendar (spec) ada.io_exceptions (spec) ada.strings (spec) system.assertions (spec) system.assertions (body) system.exceptions (spec) system.storage_elements (spec) system.storage_elements (body) system.machine_state_operations (spec) system.secondary_stack (spec) system.img_int (body) system.img_enum (body) ada.tags (spec) ada.tags (body) ada.streams (spec) system.stack_checking (spec) system.soft_links (spec) system.soft_links (body) system.stack_checking (body) system.secondary_stack (body) ada.calendar (body) system.exn_llf (spec) system.finalization_root (spec) system.finalization_root (body) system.memory (spec) system.memory (body) system.machine_state_operations (body) system.standard_library (body) system.string_ops (spec) system.string_ops (body) system.string_ops_concat_3 (spec) system.string_ops_concat_3 (body) system.string_ops_concat_4 (spec) system.string_ops_concat_4 (body) system.string_ops_concat_5 (spec) system.string_ops_concat_5 (body) system.traceback (spec) system.traceback (body) ada.exceptions (body) system.unsigned_types (spec) system.bit_ops (body) ada.strings.maps (spec) ada.strings.maps (body) ada.strings.fixed (spec) ada.strings.maps.constants (spec) ada.characters.handling (body) ada.strings.search (spec) ada.strings.search (body) ada.strings.fixed (body) system.fat_lflt (spec) system.fat_llf (spec) system.img_llu (spec) system.img_llu (body) system.img_uns (spec) system.img_uns (body) system.img_real (body) system.stream_attributes (spec) system.stream_attributes (body) system.finalization_implementation (spec) system.finalization_implementation (body) ada.finalization (spec) ada.finalization (body) ada.finalization.list_controller (spec) ada.finalization.list_controller (body) ada.strings.unbounded (spec) ada.strings.unbounded (body) system.file_control_block (spec) system.direct_io (spec) system.file_io (spec) system.file_io (body) system.direct_io (body) ada.text_io (spec) ada.text_io (body) ada.text_io.float_aux (spec) ada.long_float_text_io (spec) ada.long_float_text_io (body) ada.text_io.generic_aux (spec) ada.text_io.generic_aux (body) system.storage_pools (spec) system.pool_global (spec) system.pool_global (body) system.pool_local (spec) system.pool_local (body) system.pool_size (spec) system.pool_size (body) system.val_int (spec) system.val_real (spec) ada.text_io.float_aux (body) system.val_uns (spec) system.val_util (spec) system.val_util (body) system.val_uns (body) system.val_real (body) system.val_int (body) text_io (spec) bc (spec) bc.containers (spec) bc.containers (body) bc.containers.collections (spec) bc.containers.collections (body) bc.containers.collections.ordered (spec) bc.containers.sets (spec) bc.containers.sets (body) bc.containers.trees (spec) bc.containers.trees.avl (spec) bc.containers.trees.avl (body) bc.support (spec) bc.support.exceptions (spec) bc.support.exceptions (body) bc.support.hash_tables (spec) bc.support.hash_tables (body) bc.support.standard_storage (spec) bc.support.unbounded (spec) bc.support.unbounded (body) bc.containers.collections.ordered.unbounded (spec) bc.containers.collections.ordered.unbounded (body) bc.containers.collections.unbounded (spec) bc.containers.collections.unbounded (body) bc.containers.sets.unbounded (spec) bc.containers.sets.unbounded (body) dom (spec) mckae (spec) mckae.space (spec) mckae.space.unbounded_string_expandable (spec) mckae.space.unbounded_string_expandable (body) mckae.xml (spec) mckae.xml.xpath (spec) sax (spec) sax.htable (spec) sax.htable (body) unicode (spec) unicode.ccs (spec) unicode.ccs.iso_8859_1 (spec) unicode.ccs.iso_8859_1 (body) unicode.ccs.iso_8859_2 (spec) unicode.ccs.iso_8859_3 (spec) unicode.ccs.iso_8859_4 (spec) unicode.ccs (body) unicode.ces (spec) unicode.ces (body) dom.core (spec) dom.core (body) dom.core.append_node (spec) dom.core.append_node (body) dom.core.documents (spec) dom.core.nodes (spec) dom.core.attrs (spec) dom.core.attrs (body) dom.core.elements (spec) dom.core.elements (body) mckae.xml.xpath.expressions (spec) mckae.xml.xpath.xia (spec) mckae.xml.xpath.expressions (body) sax.locators (spec) sax.locators (body) sax.exceptions (spec) sax.exceptions (body) sax.models (spec) sax.attributes (spec) sax.attributes (body) unicode.ces.utf32 (spec) unicode.ces.basic_8bit (spec) unicode.ces.basic_8bit (body) input_sources (spec) input_sources.file (spec) input_sources.strings (spec) sax.readers (spec) dom.readers (spec) dom.readers (body) unicode.ces.utf16 (spec) unicode.ces.utf16 (body) unicode.ces.utf8 (spec) unicode.ces.utf8 (body) input_sources.strings (body) input_sources.file (body) input_sources (body) sax.encodings (spec) sax.models (body) unicode.names (spec) unicode.names.basic_latin (spec) sax.readers (body) unicode.ces.utf32 (body) dom.core.nodes (body) dom.core.documents (body) unicode.names.latin_1_supplement (spec) unicode.names.latin_extended_a (spec) unicode (body) unicode.names.spacing_modifier_letters (spec) unicode.ccs.iso_8859_4 (body) unicode.ccs.iso_8859_3 (body) unicode.ccs.iso_8859_2 (body) xia_parser_dfa (spec) xia_parser_dfa (body) xia_parser_goto (spec) xia_parser_io (spec) xia_parser_io (body) xia_parser (spec) xia_parser (body) xia_parser_model (spec) mckae.xml.xpath.predicates (spec) mckae.xml.xpath.predicates (body) mckae.xml.xpath.locations (spec) mckae.xml.xpath.locations (body) xia_parser_model (body) bench_xpath (body) mckae.xml.xpath.node_sets (spec) mckae.xml.xpath.node_sets (body) mckae.xml.xpath.predicates.evaluation (spec) mckae.xml.xpath.predicates.evaluation (body) mckae.xml.xpath.query_handling (spec) xia_parser_parser (spec) mckae.xml.xpath.query_handling (body) mckae.xml.xpath.xia (body) xia_parser_shift_reduce (spec) xia_parser_tokens (spec) xia_parser_parser (body) END ELABORATION ORDER

Variables

gnat_argc : Integer;
pragma Import (C, gnat_argc);
gnat_argv : System.Address;
pragma Import (C, gnat_argv);
gnat_envp : System.Address;
pragma Import (C, gnat_envp);
gnat_exit_status : Integer;
pragma Import (C, gnat_exit_status);

Other Items:

procedure adafinal;
pragma Export (C, adafinal, "adafinal");
procedure adainit;
pragma Export (C, adainit, "adainit");
procedure Break_Start;
pragma Import (C, Break_Start, "__gnat_break_start");
function main
  (argc : Integer;
   argv : System.Address;
   envp : System.Address)
   return Integer;
pragma Export (C, main, "main");
type Version_32 is mod 2 ** 32;
end ada_main;
Generated on 2005-03-05 at 07:47:14 by AdaBrowse 4.0.1 using configuration file ../../xtoq-docs.cfg.
xia-1.00/xia_parser_tokens.ads0100666000076600007670000000631510212334121015305 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with xia_parser_Model; use xia_parser_Model; package xia_parser_tokens is subtype YYSTYPE is xia_parser_Model.Parseable_Ptr; YYLVal, YYVal : YYSType; type Token is (End_Of_Input, Error, Ncname_Token, Decimal_Literal_Token, Integer_Token, Dq_Literal_Token, Sq_Literal_Token, Le_Token, Lt_Token, Ge_Token, Gt_Token, Ne_Token, Eq_Token, V_Bar_Token, Dollar_Token, Comma_Token, At_Sign_Token, Double_Colon_Token, Colon_Token, Double_Slash_Token, Slash_Token, Double_Dot_Token, Dot_Token, Minus_Token, Plus_Token, Star_Token, R_Bracket_Token, L_Bracket_Token, R_Paren_Token, L_Paren_Token, Or_Token, Mod_Token, Div_Token, And_Token, Node_Token, Processing_Instruction_Token, Text_Token, Comment_Token, Self_Token, Preceding_Sibling_Token, Preceding_Token, Parent_Token, Namespace_Token, Following_Sibling_Token, Following_Token, Descendant_Or_Self_Token, Descendant_Token, Child_Token, Attribute_Token, Ancestor_Or_Self_Token, Ancestor_Token ); Syntax_Error : exception; end Xia_Parser_Tokens; xia-1.00/mckae-space-unbounded_string_expandable.adb0100666000076600007670000001725310212334323021456 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ with Unchecked_Deallocation; package body McKae.Space.Unbounded_String_Expandable is -- An expandable string type that automatically adds to its length -- when the allocated space has been used up. More efficient than -- the standard Unbounded_Strings package because it will almost -- always allocate more space than is needed for whatever is being -- appended, so appending can continue for awhile before needing -- to allocate more space. -- Services provided are general string manipulation and extraction -- ones. ------------------------------------------------------------------------ procedure Free is new Unchecked_Deallocation(String, String_Access); ------------------------------------------------------------------------ procedure Copy (Target : out Expandable_String; Source : in Expandable_String) is begin Target := Source; Target.S := new String(1 .. Target.Allocated); Target.S(1 .. Target.Length) := Source.S(1 .. Source.Length); end Copy; ------------------------------------------------------------------------ procedure Append(Es : in out Expandable_String; Char : in Character) is begin Append(Es, String'(1 => Char)); end Append; ------------------------------------------------------------------------ procedure Append(Es : in out Expandable_String; Str : in String) is New_Size : constant Natural := Es.Length + Str'Length; Prev : String_Access := Es.S; begin if New_Size > Es.Allocated then -- Don't just add in a new allocation size, add in the size -- of the extension PLUS the size of the appended string. Es.Allocated := New_Size + Es.Expansion; Es.S := new String(1 .. Es.Allocated); -- Copy over the contents to the new allocation Es.S(1 .. Es.Length) := Prev(1 .. Es.Length); Free(Prev); end if; -- Append the new part Es.S(Es.Length + 1 .. New_Size) := Str; Es.Length := New_Size; end Append; ------------------------------------------------------------------------ procedure Append(Es : in out Expandable_String; More_ES : in Expandable_String) is begin Append(Es, Extract(More_Es)); end Append; ------------------------------------------------------------------------ function Length(Es : Expandable_String) return Natural is begin return Es.Length; end Length; ------------------------------------------------------------------------ function Get(Es : Expandable_String; Index : Positive) return Character is begin if Index <= Es.Length then return Es.S(Index); else raise Constraint_Error; end if; end Get; ------------------------------------------------------------------------ function Slice(Es : Expandable_String; First : Positive; Last : Natural) return String is begin if First > Last then return ""; elsif Last <= Es.Length then return Es.S(First .. Last); else raise Constraint_Error; end if; end Slice; ------------------------------------------------------------------------ -- Return the whole valid part of the expandable string as a string function Extract(Es : Expandable_String) return String is begin return Es.S(1 .. Es.Length); end Extract; ------------------------------------------------------------------------ -- Destroy the string and deallocate any storage procedure Destroy(ES : in out Expandable_String) is begin Es.Length := 0; Free(Es.S); Es.Allocated := 0; Es.S := null; end Destroy; ------------------------------------------------------------------------ -- Clear the string; does not release any space. procedure Clear (ES : in out Expandable_String) is begin Es.Length := 0; end Clear; ------------------------------------------------------------------------ function "=" (Left, Right : Expandable_String) return Boolean is begin return Left.S(1 .. Left.Length) = Right.S(1 .. Right.Length); end "="; function "<" (Left, Right : Expandable_String) return Boolean is begin return Left.S(1 .. Left.Length) < Right.S(1 .. Right.Length); end "<"; function "<="(Left, Right : Expandable_String) return Boolean is begin return Left.S(1 .. Left.Length) < Right.S(1 .. Right.Length); end "<="; function ">" (Left, Right : Expandable_String) return Boolean is begin return Right <= Left; end ">"; function ">="(Left, Right : Expandable_String) return Boolean is begin return Right < Left; end ">="; function "=" (Left : Expandable_String; Right : String) return Boolean is begin return Left.S(1 .. Left.Length) = Right; end "="; function "<" (Left : Expandable_String; Right : String) return Boolean is begin return Left.S(1 .. Left.Length) < Right; end "<"; function "<="(Left : Expandable_String; Right : String) return Boolean is begin return Left.S(1 .. Left.Length) <= Right; end "<="; function ">" (Left : Expandable_String; Right : String) return Boolean is begin return Left.S(1 .. Left.Length) > Right; end ">"; function ">="(Left : Expandable_String; Right : String) return Boolean is begin return Left.S(1 .. Left.Length) >= Right; end ">="; ------------------------------------------------------------------------ end McKae.Space.Unbounded_String_Expandable; xia-1.00/mckae-space-unbounded_string_expandable.ads0100666000076600007670000001203010212334323021463 0ustar g315padadev------------------------------------------------------------------------ -- -- -- McKae Software Utilities -- -- -- -- Copyright (C) 2004 McKae Technologies -- -- -- -- The McKae software utilities are free software; you can -- -- redistribute it and/or modify it under terms of the GNU General -- -- Public License as published by the Free Software Foundation; -- -- either version 2, or (at your option) any later version. McKae -- -- Software Utilities are distributed in the hope that they will be -- -- useful, but WITHOUT ANY WARRANTY; without even the implied -- -- warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. -- -- See the GNU General Public License for more details. You should -- -- have received a copy of the GNU General Public License distributed -- -- with DTraq; see file COPYING. If not, write to the Free Software -- -- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, -- -- USA. -- -- -- -- As a special exception, if other files instantiate generics from -- -- this unit, or you link this unit with other files to produce an -- -- executable, this unit does not by itself cause the resulting -- -- executable to be covered by the GNU General Public License. This -- -- exception does not however invalidate any other reasons why the -- -- executable file might be covered by the GNU Public License. -- -- -- -- The McKae Software Utilities are maintained by McKae Technologies -- -- (http://www.mckae.com). -- ------------------------------------------------------------------------ package McKae.Space.Unbounded_String_Expandable is -- An expandable string type that automatically adds to its length -- when the allocated space has been used up. More efficient that -- the standard Unbounded_Strings package because it will almost -- always allocate more space than is needed for whatever is being -- appended. -- Services provided are general string manipulation and extraction -- ones. -- The expandable string type type Expandable_String (Initial_Size : Positive := 2000; Expansion : Positive := 2000) is private; -- Make a deep copy of the source string procedure Copy(Target : out Expandable_String; Source : in Expandable_String); procedure Append(Es : in out Expandable_String; Char : in Character); procedure Append(Es : in out Expandable_String; Str : in String); procedure Append(Es : in out Expandable_String; More_ES : in Expandable_String); function Length(Es : Expandable_String) return Natural; function Get(Es : Expandable_String; Index : Positive) return Character; function Slice(Es : Expandable_String; First : Positive; Last : Natural) return String; -- Return the whole valid part of the expandable string as a string function Extract(Es : Expandable_String) return String; procedure Destroy(ES : in out Expandable_String); -- Destroy the string and deallocate any storage procedure Clear (ES : in out Expandable_String); -- Clear the string; does not release any space. -- String comparisons function "=" (Left, Right : Expandable_String) return Boolean; function "<" (Left, Right : Expandable_String) return Boolean; function "<="(Left, Right : Expandable_String) return Boolean; function ">" (Left, Right : Expandable_String) return Boolean; function ">="(Left, Right : Expandable_String) return Boolean; function "=" (Left : Expandable_String; Right : String) return Boolean; function "<" (Left : Expandable_String; Right : String) return Boolean; function "<="(Left : Expandable_String; Right : String) return Boolean; function ">" (Left : Expandable_String; Right : String) return Boolean; function ">="(Left : Expandable_String; Right : String) return Boolean; private type String_Access is access all String; -- General purpose string access type. Note that the caller is -- responsible for freeing allocated strings to avoid memory leaks. -- The implementation of the expandable string type Expandable_String (Initial_Size : Positive := 2000; Expansion : Positive := 2000) is record S : String_Access := new String(1 .. Initial_Size); Length : Natural := 0; Allocated : Natural := Initial_Size; end record; end McKae.Space.Unbounded_String_Expandable;