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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
|
Language semantics
------------------
.. class:: nodoc
> module Codec.Pesto.Graph (
> toGraph
> , walkRoot
> , outgoingEdges
> , outgoingNodes
> , incomingEdges
> , incomingNodes
> , firstNodeId
> , resolveReferences
> , test
> , extract
> , NodeId
> , Node
> , Nodes
> , Edge
> , Edges
> ) where
> import Data.Char (toLower)
> import Data.List (sort, nub)
> import Test.HUnit hiding (test, Node)
> import Control.Applicative ((<$>))
>
> import Codec.Pesto.Parse hiding (test)
The parser’s output, a stream of instructions, may contain multiple recipes. A
recipe must start with the directive “pesto” and may end with “bonappetit”.
This function extracts all recipes from the stream and removes both directives.
- easily embed recipes into other documents
> extract [] = []
> extract (Directive "pesto":stream) = between:extract next
> where
> isEnd (Directive x) | x `elem` ["bonappetit", "pesto"] = True
> isEnd _ = False
> (between, next) = break isEnd stream
> extract (_:xs) = extract xs
Start and end directive are removed from the extracted instructions. The
directive “bonappetit” is optional at the end of a stream.
> testExtract = [
> extract [Directive "pesto", Directive "bonappetit"] ~?= [[]]
> , extract [Directive "pesto", Action "foobar", Directive "bonappetit"] ~?= [[Action "foobar"]]
> , extract [Directive "pesto"] ~?= [[]]
> , extract [Directive "pesto", Directive "foobar"] ~?= [[Directive "foobar"]]
Instructions surrounding the start and end directive are removed.
> , extract [Unknown "Something", Directive "pesto"] ~?= [[]]
> , extract [Unknown "Something", Action "pour", Directive "pesto"] ~?= [[]]
> , extract [Directive "pesto", Directive "bonappetit", Annotation "something"] ~?= [[]]
The stream may contain multiple recipes. The start directive also ends the
previous recipe and starts a new one.
> , extract [Directive "pesto", Action "pour", Directive "bonappetit", Action "foobar", Directive "pesto", Annotation "something"] ~?= [[Action "pour"], [Annotation "something"]]
> , extract [Directive "pesto", Action "heat", Directive "pesto", Annotation "something"] ~?= [[Action "heat"], [Annotation "something"]]
> , extract [Directive "pesto", Annotation "foobar", Directive "pesto", Directive "bonappetit"] ~?= [[Annotation "foobar"], []]
> ]
Each recipe’s stream of instructions drives a stack-based machine that transforms
it into a directed graph. Think of the stack as your kitchen’s workspace that
is used to prepare the food’s components. You can add new ingredients, perform
actions on them, put them aside and add them again.
This function processes a list of nodes, that is instructions uniquely identified
by an integer and returns the edges of the directed graph as a list of tuples.
> toGraph nodes = third $ foldl f (Nothing, [[]], []) nodes
> where
Ingredients are simply added to the current workspace. They should for example
appear on the shopping list.
> f ctx (i, Ingredient _) = addToStack ctx i
The same happens for for tools. However they are not part of the final product,
but used in the process of making it. For instance they do not appear on the
shopping list. `Time is a tool <time-is-a-tool_>`_.
> f ctx (i, Tool _) = addToStack ctx i
Actions take all ingredients and tools currently on the workspace, perform some
action with them and put the product back onto the workspace.
> f (_, stack:sx, edges) (i, Action _) = (Just i, [i]:stack:sx, edgesTo i stack ++ edges)
> f (_, [], _) (_, Action _) = undefined -- never reached
Results add a label to the current workspace’s contents and move them out of
the way. It should be a meaningful name, not just A and B obviously.
Consecutive Results add different labels to the same workspace. That’s useful
when an action yields multiple results at once that are processed in different
ways.
> f ctx (i, Result _) = consumeStack ctx i
Alternatives too add a label to the current workspace’s content, but they pick
one of things on the workspace and throw everything else away. This allows
adding optional or equivalent ingredients to a recipe (i.e. margarine or butter).
> f ctx (i, Alternative _) = consumeStack ctx i
References are similar to ingredients. They are used to add items from a
workspace labeled with Result or Alternative. More on that `in the next section
<references_>`_.
> f ctx (i, Reference _) = addToStack ctx i
Annotations add a description to any of the previous instructions. They can be
used to provide more information about ingredients (so “hot water” becomes
“+water (hot)”, tools (“&oven (200 °C)”) or actions (“[cook] (XXX)”).
> f ctx@(Nothing, _, _) (_, Annotation _) = ctx
> f (Just prev, s, edges) (i, Annotation _) = (Just prev, s, (i, prev):edges)
Unused directives or unknown instructions are danging nodes with no connection to
other nodes.
> f ctx (_, Directive _) = ctx
> f ctx (_, Unknown _) = ctx
These are helper functions:
> addToStack (_, stack:sx, edges) i = (Just i, (i:stack):sx, edges)
> addToStack (_, [], _) _ = undefined -- never reached
> consumeStack (_, s, edges) i =
> let
> stack = dropWhile null s
> (top:sx) = if null stack then [[]] else stack
> in (Just i, []:top:sx, edgesTo i top ++ edges)
> edgesTo i = map (\x -> (x, i))
Here are a few example of how this stack-machine works. Each edge is a tuple of
two integer numbers. These are the nodes it connects, starting with zero.
Ingredient, Tool and Reference itself do not create any edges:
> testGraph = [
> cmpGraph "+ketchup &spoon *foobar" []
But Action, Alternative and Result do in combination with them:
> , cmpGraph "+foobar [barbaz]" [(0, 1)]
> , cmpGraph "+foobar |barbaz" [(0, 1)]
> , cmpGraph "+foobar >barbaz" [(0, 1)]
> , cmpGraph "+foobar +B >barbaz" [(0, 2), (1, 2)]
> , cmpGraph "+foobar >barbaz +foobar >barbaz" [(0, 1), (2, 3)]
> , cmpGraph "+foobar [barbaz] +foobar >barbaz" [(0, 1), (1, 3), (2, 3)]
> , cmpGraph "&foobar [barbaz] [C] >D" [(0, 1), (1, 2), (2, 3)]
If the stack is empty, i.e. it was cleared by a Result or Alternative
instruction, consecutive results or alternatives operate on the *previous*,
non-empty stack.
> , cmpGraph "+foobar >barbaz >C" [(0, 1), (0, 2)]
> , cmpGraph "+foobar |barbaz |C" [(0, 1), (0, 2)]
> , cmpGraph "+foobar >barbaz |C" [(0, 1), (0, 2)]
Unless that stack too is empty. Then they do nothing:
> , cmpGraph ">foobar >foobar" []
> , cmpGraph "|foobar |foobar" []
> , cmpGraph "(foobar) (foobar)" []
> , cmpGraph "[foobar]" []
The Annotation instruction always creates an edge to the most-recently processed
node that was not an annotation. Thus two consecutive annotations create edges
to the same node.
> , cmpGraph "+foobar (barbaz)" [(1, 0)]
> , cmpGraph "+foobar (barbaz) (C)" [(1, 0), (2, 0)]
> , cmpGraph "+foobar (barbaz) >barbaz" [(1, 0), (0, 2)]
> , cmpGraph "+foobar >barbaz (C)" [(0, 1), (2, 1)]
> , cmpGraph "+foobar |barbaz (C)" [(0, 1), (2, 1)]
> , cmpGraph "*foobar (C)" [(1, 0)]
Unknown directives or instructions are never connected to other nodes.
> , cmpGraph "%invalid" []
> , cmpGraph "invalid" []
> ]
References
++++++++++
Results and alternatives can be referenced with the Reference instruction.
Resolving these references does not happen while buiding the graph, but
afterwards. This allows referencing an a result or alternative before its
definition with regard to the their processing order.
Resolving references is fairly simple: For every reference its object name a
case-insensitive looked is performed in a table containing all results and
alternatives. If it succeeds an edge from every result and alternative returned
to the reference in question is created.
> resolveReferences nodes = foldl f [] nodes
> where
> f edges (i, ref@(Reference _)) = map (\x -> (x, i)) (findTarget nodes ref) ++ edges
> f edges _ = edges
> findTarget nodes (Reference (Quantity _ _ a)) = map fst $ filter (isTarget a) nodes
> where
> lc = map toLower
> isTarget dest (_, Result (Quantity _ _ x)) = lc x == lc dest
> isTarget dest (_, Alternative (Quantity _ _ x)) = lc x == lc dest
> isTarget _ _ = False
> findTarget _ _ = []
References works before or after the result instruction.
> testRef = [
> cmpGraphRef ">foobar *foobar" [(0, 1)]
> , cmpGraphRef ">foobar |foobar *foobar" [(0, 2), (1, 2)]
> , cmpGraphRef "+A >foobar +B >barbaz *foobar *barbaz" [(1, 4), (3, 5)]
> , cmpGraphRef "*foobar >foobar" [(1, 0)]
Nonexistent references do not create an edge.
> , cmpGraphRef ">foobar *barbaz" []
References can use amounts and units.
> , cmpGraphRef ">foobar *1 _ foobar *2 _ foobar" [(0, 1), (0, 2)]
There are a few cases that do not make sense here (like loops or multiple
results with the same name). They are permitted at this stage, but rejected
`later <reject-loops_>`_.
> , cmpGraphRef "*foobar |foobar >foobar" [(1, 0), (2, 0)]
> , cmpGraphRef "|foobar *foobar >foobar *foobar" [(0, 1), (0, 3), (2, 1), (2, 3)]
> ]
Appendix
++++++++
> runGraphWith f doc expect = sort edges ~?= sort expect
> where
> (Right op) = (head . extract . snd . unzip) <$> parse ("%pesto " ++ doc)
> nodes = zip [firstNodeId..] op
> edges = f nodes
> cmpGraph = runGraphWith toGraph
> cmpGraphRef = runGraphWith resolveReferences
> type NodeId = Int
> type Node a = (NodeId, a)
> type Nodes a = [Node a]
> type Edge = (NodeId, NodeId)
> type Edges = [Edge]
> firstNodeId = 0 :: NodeId
Find graph’s root node(s), that is a node without outgoing edges:
> walkRoot nodes edges = let out = nub $ map fst edges
> in filter (\(x, _) -> notElem x out) nodes
Get all nodes with edges pointing towards nodeid
> incomingEdges edges (nodeid, _) = filter ((==) nodeid . snd) edges
> incomingNodes nodes edges n = map ((!!) nodes . fst) $ incomingEdges edges n
> outgoingEdges edges (nodeid, _) = filter ((==) nodeid . fst) edges
> outgoingNodes nodes edges n = map ((!!) nodes . snd) $ outgoingEdges edges n
> test = ["graph" ~: testGraph, "ref" ~: testRef, "extract" ~: testExtract]
> third (_, _, x) = x
|
