1
2
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
{-# LINE 1 "templates/GLR_Base.hs" #-}
{- GLR_Base.lhs
$Id: GLR_Base.lhs,v 1.4 2004/12/04 15:01:37 paulcc Exp $
-}
-- Basic defs required for compiling the data portion of the parser
-- We're creating Int-indexed graphs
type ForestId = (Int,Int,GSymbol)
-- Actions for the GLR machine
data GLRAction = Shift Int [Reduction]
| Reduce [Reduction]
| Accept
| Error
---
-- A Reduction (s,n,f) removes the top n node-ids, creates a new branch from these
-- and labels the branch with the given symbol s. Additionally, the branch may
-- hold some semantic value.
type Reduction = (GSymbol,Int, [ForestId] -> Branch)
---
-- A Branch holds the semantic result plus node ids of children
data Branch
= Branch {b_sem :: GSem, b_nodes :: [ForestId]}
deriving Show
instance Eq Branch where
b1 == b2 = b_nodes b1 == b_nodes b2
-------------------------------------------------------------------------------
-- Utilities for decoding
---
-- Tree decode unpacks the forest into a list of results
-- - this is ok for small examples, but inefficient for very large examples
-- - the data file contains further instances
-- - see documentation for further information
-- - "Decode_Result" is a synonym used to insert the monad type constr (or not)
class TreeDecode a where
decode_b :: (ForestId -> [Branch]) -> Branch -> [Decode_Result a]
decode :: TreeDecode a => (ForestId -> [Branch]) -> ForestId -> [Decode_Result a]
decode f i@(_,_,HappyTok t)
= decode_b f (Branch (SemTok t) [])
decode f i
= [ d | b <- f i, d <- decode_b f b ]
---- generated by Happy, since it means expansion of synonym (not ok in H-98)
--instance TreeDecode UserDefTok where
-- decode_b f (Branch (SemTok t) []) = [happy_return t]
---
-- this is used to multiply the ambiguous possibilities from children
--cross_fn :: [a -> b] -> [a] -> [b]
--actual type will depend on monad in use.
--happy_ap defined by parser generator
cross_fn fs as = [ f `happy_ap` a | f <- fs, a <- as]
---
-- Label decoding unpacks from the Semantic wrapper type
-- - this allows arbitrary values (within the limits of the compiler settings)
-- to be recovered from nodes in the tree.
-- - again, more instances are written in the data file
-- - see documentation for further information
class LabelDecode a where
unpack :: GSem -> a
---- generated by Happy, since it means expansion of synonym (not ok in H-98)
--instance LabelDecode UserDefTok where
-- unpack (SemTok t) = t
|
