]> Git — Sourcephile - haskell/symantic-parser.git/blob - tests/Golden/Machine/G11.expected.txt
doc: registers are now available
[haskell/symantic-parser.git] / tests / Golden / Machine / G11.expected.txt
1 pushValue (\x_0 -> \x_1 -> GHC.Show.show x_0)
2 minReads=1
3 mayRaise=[ExceptionFailure]
4 alwaysRaise=[]
5 freeRegs=[]
6 pushValue (\x_0 -> x_0)
7 minReads=1
8 mayRaise=[ExceptionFailure]
9 alwaysRaise=[]
10 freeRegs=[]
11 newRegister reg
12 minReads=1
13 mayRaise=[ExceptionFailure]
14 alwaysRaise=[]
15 freeRegs=[]
16 iter loop
17 minReads=1
18 mayRaise=[ExceptionFailure]
19 alwaysRaise=[]
20 freeRegs=[reg]
21 | <ok>
22 | | pushValue (\x_0 -> (GHC.Types.:) 'a')
23 | | minReads=1
24 | | mayRaise=[ExceptionFailure]
25 | | alwaysRaise=[]
26 | | freeRegs=[reg]
27 | | comment "satisfy ((GHC.Classes.==) 'a')"
28 | | minReads=1
29 | | mayRaise=[ExceptionFailure]
30 | | alwaysRaise=[]
31 | | freeRegs=[reg]
32 | | read ((GHC.Classes.==) 'a')
33 | | minReads=1
34 | | mayRaise=[ExceptionFailure]
35 | | alwaysRaise=[]
36 | | freeRegs=[reg]
37 | | lift2Value (\x_0 -> \x_1 -> x_0 x_1)
38 | | minReads=0
39 | | mayRaise=[]
40 | | alwaysRaise=[]
41 | | freeRegs=[reg]
42 | | pushValue (\x_0 -> \x_1 -> \x_2 -> x_1 (x_0 x_2))
43 | | minReads=0
44 | | mayRaise=[]
45 | | alwaysRaise=[]
46 | | freeRegs=[reg]
47 | | lift2Value (\x_0 -> \x_1 -> x_1 x_0)
48 | | minReads=0
49 | | mayRaise=[]
50 | | alwaysRaise=[]
51 | | freeRegs=[reg]
52 | | readRegister reg
53 | | minReads=0
54 | | mayRaise=[]
55 | | alwaysRaise=[]
56 | | freeRegs=[reg]
57 | | lift2Value (\x_0 -> \x_1 -> x_0 x_1)
58 | | minReads=0
59 | | mayRaise=[]
60 | | alwaysRaise=[]
61 | | freeRegs=[reg]
62 | | writeRegister reg
63 | | minReads=0
64 | | mayRaise=[]
65 | | alwaysRaise=[]
66 | | freeRegs=[reg]
67 | | jump loop
68 | | minReads=0
69 | | mayRaise=[]
70 | | alwaysRaise=[]
71 | | freeRegs=[]
72 | <ko>
73 | | comment "raiseAgainIfConsumed"
74 | | minReads=1
75 | | mayRaise=[ExceptionFailure]
76 | | alwaysRaise=[]
77 | | freeRegs=[reg]
78 | | saveInput
79 | | minReads=1
80 | | mayRaise=[ExceptionFailure]
81 | | alwaysRaise=[]
82 | | freeRegs=[reg]
83 | | lift2Value (\(Data.Text.Internal.Text _ i_0 _) (Data.Text.Internal.Text _
84 | | j_1
85 | | _) -> i_0 GHC.Classes.== j_1)
86 | | minReads=1
87 | | mayRaise=[ExceptionFailure]
88 | | alwaysRaise=[]
89 | | freeRegs=[reg]
90 | | choicesBranch
91 | | minReads=1
92 | | mayRaise=[ExceptionFailure]
93 | | alwaysRaise=[]
94 | | freeRegs=[reg]
95 | | | <branch (\x_0 -> x_0)>
96 | | | | readRegister reg
97 | | | | minReads=1
98 | | | | mayRaise=[ExceptionFailure]
99 | | | | alwaysRaise=[]
100 | | | | freeRegs=[reg]
101 | | | | pushValue GHC.Types.[]
102 | | | | minReads=1
103 | | | | mayRaise=[ExceptionFailure]
104 | | | | alwaysRaise=[]
105 | | | | freeRegs=[]
106 | | | | lift2Value (\x_0 -> \x_1 -> x_0 x_1)
107 | | | | minReads=1
108 | | | | mayRaise=[ExceptionFailure]
109 | | | | alwaysRaise=[]
110 | | | | freeRegs=[]
111 | | | | lift2Value (\x_0 -> \x_1 -> x_0 x_1)
112 | | | | minReads=1
113 | | | | mayRaise=[ExceptionFailure]
114 | | | | alwaysRaise=[]
115 | | | | freeRegs=[]
116 | | | | comment "satisfy ((GHC.Classes.==) 'b')"
117 | | | | minReads=1
118 | | | | mayRaise=[ExceptionFailure]
119 | | | | alwaysRaise=[]
120 | | | | freeRegs=[]
121 | | | | read ((GHC.Classes.==) 'b')
122 | | | | minReads=1
123 | | | | mayRaise=[ExceptionFailure]
124 | | | | alwaysRaise=[]
125 | | | | freeRegs=[]
126 | | | | lift2Value (\x_0 -> \x_1 -> x_0 x_1)
127 | | | | minReads=0
128 | | | | mayRaise=[]
129 | | | | alwaysRaise=[]
130 | | | | freeRegs=[]
131 | | | | ret
132 | | | | minReads=0
133 | | | | mayRaise=[]
134 | | | | alwaysRaise=[]
135 | | | | freeRegs=[]
136 | | | <default>
137 | | | | fail []
138 | | | | minReads=0
139 | | | | mayRaise=[ExceptionFailure]
140 | | | | alwaysRaise=[ExceptionFailure]
141 | | | | freeRegs=[]