" #-}
-{-# LINE 1 "templates/GenericTemplate.hs" #-}
--- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp
-
-{-# LINE 28 "templates/GenericTemplate.hs" #-}
-
-
-data Happy_IntList = HappyCons Int# Happy_IntList
-
-
-
-
-
-{-# LINE 49 "templates/GenericTemplate.hs" #-}
-
-{-# LINE 59 "templates/GenericTemplate.hs" #-}
-
-{-# LINE 68 "templates/GenericTemplate.hs" #-}
-
-infixr 9 `HappyStk`
-data HappyStk a = HappyStk a (HappyStk a)
-
------------------------------------------------------------------------------
--- starting the parse
-
-happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll
-
------------------------------------------------------------------------------
--- Accepting the parse
-
--- If the current token is 0#, it means we've just accepted a partial
--- parse (a %partial parser). We must ignore the saved token on the top of
--- the stack in this case.
-happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
- happyReturn1 ans
-happyAccept j tk st sts (HappyStk ans _) =
- (happyTcHack j (happyTcHack st)) (happyReturn1 ans)
-
------------------------------------------------------------------------------
--- Arrays only: do the next action
-
-
-
-happyDoAction i tk st
- = {- nothing -}
-
-
- case action of
- 0# -> {- nothing -}
- happyFail i tk st
- -1# -> {- nothing -}
- happyAccept i tk st
- n | (n <# (0# :: Int#)) -> {- nothing -}
-
- (happyReduceArr ! rule) i tk st
- where rule = (I# ((negateInt# ((n +# (1# :: Int#))))))
- n -> {- nothing -}
-
-
- happyShift new_state i tk st
- where new_state = (n -# (1# :: Int#))
- where off = indexShortOffAddr happyActOffsets st
- off_i = (off +# i)
- check = if (off_i >=# (0# :: Int#))
- then (indexShortOffAddr happyCheck off_i ==# i)
- else False
- action | check = indexShortOffAddr happyTable off_i
- | otherwise = indexShortOffAddr happyDefActions st
-
-{-# LINE 127 "templates/GenericTemplate.hs" #-}
-
-
-indexShortOffAddr (HappyA# arr) off =
-#if __GLASGOW_HASKELL__ > 500
- narrow16Int# i
-#elif __GLASGOW_HASKELL__ == 500
- intToInt16# i
-#else
- (i `iShiftL#` 16#) `iShiftRA#` 16#
-#endif
- where
-#if __GLASGOW_HASKELL__ >= 503
- i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low)
-#else
- i = word2Int# ((high `shiftL#` 8#) `or#` low)
-#endif
- high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#)))
- low = int2Word# (ord# (indexCharOffAddr# arr off'))
- off' = off *# 2#
-
-
-
-
-
-data HappyAddr = HappyA# Addr#
-
-
-
-
------------------------------------------------------------------------------
--- HappyState data type (not arrays)
-
-{-# LINE 170 "templates/GenericTemplate.hs" #-}
-
------------------------------------------------------------------------------
--- Shifting a token
-
-happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
- let i = (case unsafeCoerce# x of { (I# (i)) -> i }) in
--- trace "shifting the error token" $
- happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)
-
-happyShift new_state i tk st sts stk =
- happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk)
-
--- happyReduce is specialised for the common cases.
-
-happySpecReduce_0 i fn 0# tk st sts stk
- = happyFail 0# tk st sts stk
-happySpecReduce_0 nt fn j tk st@((action)) sts stk
- = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)
-
-happySpecReduce_1 i fn 0# tk st sts stk
- = happyFail 0# tk st sts stk
-happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
- = let r = fn v1 in
- happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
-
-happySpecReduce_2 i fn 0# tk st sts stk
- = happyFail 0# tk st sts stk
-happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
- = let r = fn v1 v2 in
- happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
-
-happySpecReduce_3 i fn 0# tk st sts stk
- = happyFail 0# tk st sts stk
-happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
- = let r = fn v1 v2 v3 in
- happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
-
-happyReduce k i fn 0# tk st sts stk
- = happyFail 0# tk st sts stk
-happyReduce k nt fn j tk st sts stk
- = case happyDrop (k -# (1# :: Int#)) sts of
- sts1@((HappyCons (st1@(action)) (_))) ->
- let r = fn stk in -- it doesn't hurt to always seq here...
- happyDoSeq r (happyGoto nt j tk st1 sts1 r)
-
-happyMonadReduce k nt fn 0# tk st sts stk
- = happyFail 0# tk st sts stk
-happyMonadReduce k nt fn j tk st sts stk =
- happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
- where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts))
- drop_stk = happyDropStk k stk
-
-happyMonad2Reduce k nt fn 0# tk st sts stk
- = happyFail 0# tk st sts stk
-happyMonad2Reduce k nt fn j tk st sts stk =
- happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
- where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts))
- drop_stk = happyDropStk k stk
-
- off = indexShortOffAddr happyGotoOffsets st1
- off_i = (off +# nt)
- new_state = indexShortOffAddr happyTable off_i
-
-
-
-
-happyDrop 0# l = l
-happyDrop n (HappyCons (_) (t)) = happyDrop (n -# (1# :: Int#)) t
-
-happyDropStk 0# l = l
-happyDropStk n (x `HappyStk` xs) = happyDropStk (n -# (1#::Int#)) xs
-
------------------------------------------------------------------------------
--- Moving to a new state after a reduction
-
-
-happyGoto nt j tk st =
- {- nothing -}
- happyDoAction j tk new_state
- where off = indexShortOffAddr happyGotoOffsets st
- off_i = (off +# nt)
- new_state = indexShortOffAddr happyTable off_i
-
-
-
-
------------------------------------------------------------------------------
--- Error recovery (0# is the error token)
-
--- parse error if we are in recovery and we fail again
-happyFail 0# tk old_st _ stk =
--- trace "failing" $
- happyError_ tk
-
-{- We don't need state discarding for our restricted implementation of
- "error". In fact, it can cause some bogus parses, so I've disabled it
- for now --SDM
-
--- discard a state
-happyFail 0# tk old_st (HappyCons ((action)) (sts))
- (saved_tok `HappyStk` _ `HappyStk` stk) =
--- trace ("discarding state, depth " ++ show (length stk)) $
- happyDoAction 0# tk action sts ((saved_tok`HappyStk`stk))
--}
-
--- Enter error recovery: generate an error token,
--- save the old token and carry on.
-happyFail i tk (action) sts stk =
--- trace "entering error recovery" $
- happyDoAction 0# tk action sts ( (unsafeCoerce# (I# (i))) `HappyStk` stk)
-
--- Internal happy errors:
-
-notHappyAtAll = error "Internal Happy error\n"
-
------------------------------------------------------------------------------
--- Hack to get the typechecker to accept our action functions
-
-
-happyTcHack :: Int# -> a -> a
-happyTcHack x y = y
-{-# INLINE happyTcHack #-}
-
-
------------------------------------------------------------------------------
--- Seq-ing. If the --strict flag is given, then Happy emits
--- happySeq = happyDoSeq
--- otherwise it emits
--- happySeq = happyDontSeq
-
-happyDoSeq, happyDontSeq :: a -> b -> b
-happyDoSeq a b = a `seq` b
-happyDontSeq a b = b
-
------------------------------------------------------------------------------
--- Don't inline any functions from the template. GHC has a nasty habit
--- of deciding to inline happyGoto everywhere, which increases the size of
--- the generated parser quite a bit.
-
-
-{-# NOINLINE happyDoAction #-}
-{-# NOINLINE happyTable #-}
-{-# NOINLINE happyCheck #-}
-{-# NOINLINE happyActOffsets #-}
-{-# NOINLINE happyGotoOffsets #-}
-{-# NOINLINE happyDefActions #-}
-
-{-# NOINLINE happyShift #-}
-{-# NOINLINE happySpecReduce_0 #-}
-{-# NOINLINE happySpecReduce_1 #-}
-{-# NOINLINE happySpecReduce_2 #-}
-{-# NOINLINE happySpecReduce_3 #-}
-{-# NOINLINE happyReduce #-}
-{-# NOINLINE happyMonadReduce #-}
-{-# NOINLINE happyGoto #-}
-{-# NOINLINE happyFail #-}
-
--- end of Happy Template.
diff --git a/XQueryParser.y b/XQueryParser.y
--- a/XQueryParser.y
+++ b/XQueryParser.y
@@ -14,7 +14,7 @@
--------------------------------------------------------------------------------------}
{
-module XQueryParser where
+module XML.HXQ.Parser where
import Char
}
diff --git a/XTree.hs b/XTree.hs
deleted file mode 100644
--- a/XTree.hs
+++ /dev/null
@@ -1,101 +0,0 @@
-{-------------------------------------------------------------------------------------
--
-- XML Trees (rose trees)
-- Programmer: Leonidas Fegaras
-- Email: fegaras@cse.uta.edu
-- Web: http://lambda.uta.edu/
-- Creation: 05/01/08, last update: 05/01/08
--
-- Copyright (c) 2008 by Leonidas Fegaras, the University of Texas at Arlington. All rights reserved.
-- This material is provided as is, with absolutely no warranty expressed or implied.
-- Any use is at your own risk. Permission is hereby granted to use or copy this program
-- for any purpose, provided the above notices are retained on all copies.
--
---------------------------------------------------------------------------------------}
-
-
-{-# OPTIONS_GHC -funbox-strict-fields #-}
-
-
-module XTree where
-
-import System.IO
-import XMLParse(XMLEvent(..))
-import HXML(AttList)
-
-
-type Tag = String
-
-
--- A DOM-like tree to represent XML data
--- Int in XElem is the preorder numbering used for document order
-data XTree = XElem !Tag !AttList !Int [XTree]
- | XText !String
- | XInt !Int
- | XFloat !Float
- | XBool !Bool
- | XPI Tag String -- processing instruction
- | XGERef Tag -- general entity reference
- | XComment String -- comment
- | XError String -- error report
- deriving Eq
-
-type XSeq = [XTree]
-
-
-showAL :: AttList -> String
-showAL = foldr(\(a,v) r -> " "++a++"=\""++v++"\""++r) []
-
-showXT :: XTree -> Bool -> String
-showXT e pad
- = case e of
- XElem tag al _ [] -> "<"++tag++(showAL al)++"/>"
- XElem tag al _ xs -> "<"++tag++(showAL al)++">"++(showXS xs)++""
- XText text -> text
- XInt n -> p++(show n)
- XFloat n -> p++(show n)
- XBool v -> p++(if v then "true" else "false")
- XComment s -> ""
- XPI n s -> ""
- XError s -> error s
- _ -> ""
- where p = if pad then " " else ""
-
-showXS :: XSeq -> String
-showXS [] = ""
-showXS (x:xs) = (showXT x False) ++ (concatMap (\x -> showXT x True) xs)
-
-instance Show XTree where
- show t = showXT t False
-
-
--- print an XSeq without waiting
-putXSeq :: XSeq -> IO ()
-putXSeq xs = hSetBuffering stdout NoBuffering >> putStrLn (showXS xs)
-
-
-{--------------- Build the rose tree from the XML stream ----------------------------}
-
-
-type Stream = [XMLEvent]
-
-
--- lazily materialize the SAX stream into a DOM tree
-materialize :: Stream -> XTree
-materialize stream = XElem "document" [] 1 [head (filter (\x -> case x of XElem _ _ _ _ -> True; _ -> False)
- ((\(x,_,_)->x) (ml stream 2)))]
- where m ((TextEvent t):xs) i = (XText t,xs,i)
- m ((EmptyEvent n atts):xs) i = (XElem n atts i [],xs,i+1)
- m ((StartEvent n atts):xs) i = let (el,xs',i') = ml xs (i+1)
- in (XElem n atts i el,xs',i')
- m ((PIEvent n s):xs) i = (XPI n s,xs,i)
- m ((CommentEvent s):xs) i = (XComment s,xs,i)
- m ((GERefEvent n):xs) i = (XGERef n,xs,i)
- m ((ErrorEvent s):xs) i = (XError s,xs,i)
- m (_:xs) i = (XError "unrecognized XML event",xs,i)
- m [] i = (XError "unbalanced tags",[],i)
- ml [] i = ([],[],i)
- ml ((EndEvent n):xs) i = ([],xs,i)
- ml xs i = let (e,xs',i') = m xs i
- (el,xs'',i'') = ml xs' i'
- in (e:el,xs'',i'')
diff --git a/data/company.sql b/data/company.sql
new file mode 100644
--- /dev/null
+++ b/data/company.sql
@@ -0,0 +1,189 @@
+create table employee
+ ( fname varchar(15) not null,
+ minit char,
+ lname varchar(15) not null,
+ ssn char(9) primary key not null,
+ dno int references department(dnumber),
+ bdate date,
+ address varchar(30),
+ sex char,
+ salary decimal(10,2),
+ superssn char(9) references employee(ssn) );
+
+
+create table department
+ ( dname varchar(15) unique not null,
+ dnumber int primary key not null,
+ mgrssn char(9) references employee(ssn),
+ mgrstartdate date );
+
+
+create table dept_locations
+ ( dnumber int not null references department(dnumber),
+ dlocation varchar(15) not null,
+ primary key (dnumber,dlocation) );
+
+
+create table project
+ ( pname varchar(15) unique not null,
+ pnumber int primary key not null,
+ plocation varchar(15),
+ dnum int references department(dnumber) );
+
+
+create table works_on
+ ( essn char(9) not null references employee(ssn),
+ pno int not null references project(pnumber),
+ hours decimal(3,1),
+ primary key (essn,pno) );
+
+
+create table dependent
+ ( essn char(9) not null references employee(ssn),
+ dependent_name varchar(15) not null,
+ sex char,
+ bdate date,
+ relationship varchar(8),
+ primary key (essn,dependent_name) );
+
+
+
+insert into department
+ values ( 'Research', 5, '22-MAY-78', 333445555 );
+
+insert into department
+ values ( 'Administration', 4, '01-JAN-85', 987654321 );
+
+insert into department
+ values ( 'Headquarters', 1, '19-JUN-71', 888665555 );
+
+
+insert into employee
+ values ( 'James', 'E', 'Borg', 888665555, 1, '10-NOV-27', '450 Stone, Houston, TX', 'M', 55000, null );
+
+insert into employee
+ values ( 'Franklin', 'T', 'Wong', 333445555, 5, '18-DEC-45', '638 Voss, Houston, TX', 'M', 40000, 888665555);
+
+insert into employee
+ values ( 'John', 'B', 'Smith', 123456789, 5, '09-JAN-55', '731 Fondren, Houston, TX', 'M', 30000, 333445555 );
+
+insert into employee
+ values ( 'Jennifer', 'S', 'Wallace', 987654321, 4, '20-JUN-31', '291 Berry, Bellair, TX', 'F', 43000, 888665555 );
+
+insert into employee
+ values ( 'Alicia', 'J', 'Zelaya', 999887777, 4, '19-JUL-58', '3321 Castle, Spring, TX', 'F', 25000, 987654321 );
+
+insert into employee
+ values ( 'Ramesh', 'K', 'Narayan', 666884444, 5, '15-SEP-52', '975 Fire Oak, Humble, TX', 'M', 38000, 333445555 );
+
+insert into employee
+ values ( 'Joyce', 'A', 'English', 453453453, 5, '31-JUL-62', '5631 Rice, Houston, TX', 'F', 25000, 333445555 );
+
+insert into employee
+ values ( 'Ahmad', 'V', 'Jabbar', 987987987, 1, '29-MAR-59', '980 Dallas, Houston, TX', 'M', 25000, 987654321 );
+
+
+insert into dept_locations
+ values ( 1, 'Houston' );
+
+insert into dept_locations
+ values ( 4, 'Stafford' );
+
+insert into dept_locations
+ values ( 5, 'Bellaire' );
+
+insert into dept_locations
+ values ( 5, 'Sugarland' );
+
+insert into dept_locations
+ values ( 5, 'Houston' );
+
+
+insert into project
+ values ( 'ProductX', 1, 'Bellaire', 5 );
+
+insert into project
+ values ( 'ProductY', 2, 'Sugarland', 5 );
+
+insert into project
+ values ( 'ProductZ', 3, 'Houston', 5 );
+
+insert into project
+ values ( 'Computerization', 10, 'Stafford', 4 );
+
+insert into project
+ values ( 'Reorganization', 20, 'Houston', 1 );
+
+insert into project
+ values ( 'Newbenefits', 30, 'Stafford', 4 );
+
+
+insert into works_on
+ values ( 123456789, 1, 32.5 );
+
+insert into works_on
+ values ( 123456789, 2, 7.5 );
+
+insert into works_on
+ values ( 666884444, 3, 40.0 );
+
+insert into works_on
+ values ( 453453453, 1, 20.0 );
+
+insert into works_on
+ values ( 453453453, 2, 20.0 );
+
+insert into works_on
+ values ( 333445555, 2, 10.0 );
+
+insert into works_on
+ values ( 333445555, 3, 10.0 );
+
+insert into works_on
+ values ( 333445555, 10, 10.0 );
+
+insert into works_on
+ values ( 333445555, 20, 10.0 );
+
+insert into works_on
+ values ( 999887777, 30, 30.0 );
+
+insert into works_on
+ values ( 999887777, 10, 10.0 );
+
+insert into works_on
+ values ( 987987987, 10, 35.0 );
+
+insert into works_on
+ values ( 987987987, 30, 5.0 );
+
+insert into works_on
+ values ( 987654321, 30, 20.0 );
+
+insert into works_on
+ values ( 987654321, 20, 15.0 );
+
+insert into works_on
+ values ( 888665555, 20, null );
+
+
+insert into dependent
+ values ( 333445555, 'Alice', 'F', '05-APR-76', 'DAUGHTER' );
+
+insert into dependent
+ values ( 333445555, 'Theodore', 'M', '25-OCT-73', 'SON' );
+
+insert into dependent
+ values ( 333445555, 'Joy', 'F', '03-MAR-48', 'SPOUSE' );
+
+insert into dependent
+ values ( 987654321, 'Abner', 'M', '29-FEB-32', 'SPOUSE' );
+
+insert into dependent
+ values ( 123456789, 'Michael', 'M', '01-JAN-78', 'SON' );
+
+insert into dependent
+ values ( 123456789, 'Alice', 'F', '31-DEC-78', 'DAUGHTER' );
+
+insert into dependent
+ values ( 123456789, 'Elizabeth', 'F', '05-MAY-57', 'SPOUSE' );
diff --git a/index.html b/index.html
--- a/index.html
+++ b/index.html
@@ -43,7 +43,7 @@
yum install ghc happy
-Then download HXQ and untar it.
+Then download HXQ and untar it.
You can use either make or cabal to build it. To build it with cabal, you do:
runhaskell Setup.lhs configure --prefix=$HOME
@@ -64,7 +64,8 @@
Some, but not all, parent axis steps are removed using optimization rules; all others cause a compilation error.
Finally, the XQuery semantics requires duplicate elimination and
sorting by document order for every XPath step, which is very expensive and unnecessary in most cases.
-This will be addressed in the future (needs a static analysis to determine when is necessary).
+For exmple, e//*//* may return duplicate elements in HXQ.
+This will be addressed in the future (needs a static analysis to determine when duplicate elimination is necessary).
Using the Compiler
@@ -130,7 +131,26 @@
xquery -p "//inproceedings[100]" data/dblp.xml.
With xquery -help you get the list of system functions and usage information.
-There is an experimental
+
Experimental Features
+
+There is an experimental interface to HDBC to query relational data inside an XQuery.
+To use it, you need to install HDBC
+and HDBC-sqlite3
+(or some other HDBC driver, such ODBC). The main function is
+$(xqdb query) :: (IConnection conn) => conn -> IO XSeq.
+The XQuery may contain multiple SQL queries in the form sql(query,args),
+where query is the sql query that may contain parameters (denoted by ?), which are bound to the values in args.
+An example can be found in TestDB.hs. To run it, you need
+to install the company database. For example, using the sqlite3
+interpreter, you do:
+
+sqlite3 myDB
+.read data/company.sql
+.quit
+
+and then you do make testdb on linux.
+
+Finally, there is an experimental
program, called hxqc, that works like xquery but is faster because it uses the
HXQ compiler instead of the interpreter. It's constracted with the Unix Makefile (make hxqc).
It is unstable and the hxqc executable is 10 times larger than xquery since it
@@ -141,4 +161,4 @@
-
Last modified: 05/03/08 by Leonidas Fegaras
+Last modified: 05/13/08 by Leonidas Fegaras
diff --git a/profile.hs b/profile.hs
--- a/profile.hs
+++ b/profile.hs
@@ -2,9 +2,9 @@
module Main where
-import XTree
-import XQueryParser
-import XQueryCompiler
+import XML.HXQ.XTree
+import XML.HXQ.Parser
+import XML.HXQ.Compiler
import XMLParse(parseDocument)
import IO