\(input :: inp) -> let !(# init, readMore, readNext #) = let _ = "cursorOf" in let next ( t@( Data.Text.Internal.Text arr off unconsumed ) ) = let !( Data.Text.Unsafe.Iter c d ) = Data.Text.Unsafe.iter t 0 in (# c, Data.Text.Internal.Text arr (off GHC.Num.+ d) (unconsumed GHC.Num.- d) #) more ( Data.Text.Internal.Text _ _ unconsumed ) = unconsumed GHC.Classes.> 0 in (# input, more, next #) finalRet = \_farInp _farExp v _inp -> Symantic.Parser.Machine.Generate.returnST GHC.Base.$ Data.Either.Right v finalRaise :: forall st b. Symantic.Parser.Machine.Generate.Catcher st inp b = \(!exn) _failInp (!farInp) (!farExp) -> Symantic.Parser.Machine.Generate.returnST GHC.Base.$ Data.Either.Left Symantic.Parser.Machine.Generate.ParsingError { Symantic.Parser.Machine.Generate.parsingErrorOffset = Symantic.Parser.Machine.Input.offset farInp, Symantic.Parser.Machine.Generate.parsingErrorException = exn, Symantic.Parser.Machine.Generate.parsingErrorUnexpected = if readMore farInp then GHC.Maybe.Just ( let (# c, _ #) = readNext farInp in c ) else GHC.Maybe.Nothing, Symantic.Parser.Machine.Generate.parsingErrorExpecting = farExp } in GHC.ST.runST ( let inputToken = Data.Proxy.Proxy :: Data.Proxy.Proxy (Symantic.Parser.Machine.Input.InputToken inp) in let in do let dupv = \x -> x reg <- GHC.STRef.newSTRef dupv let _ = "iter" in let catchHandler loopInput (!_exn) (!failInp) (!farInp) (!farExp) = if ( \( Data.Text.Internal.Text _ i _ ) ( Data.Text.Internal.Text _ j _ ) -> i GHC.Classes.== j ) loopInput failInp then let _ = "choicesBranch.then" in do sr <- GHC.STRef.readSTRef reg let _ = "resume" in finalRet farInp farExp ( let _ = "resume.genCode" in GHC.Show.show (sr GHC.Types . []) ) failInp else let _ = "choicesBranch.else" in finalRaise Symantic.Parser.Grammar.Combinators.ExceptionFailure failInp farInp farExp loop = \_callReturn callInput callCatchStackByLabel -> let readFail = catchHandler callInput in if readMore callInput then let !(# c, cs #) = readNext callInput in if (GHC.Classes.==) 'a' c then do sr <- GHC.STRef.readSTRef reg do let dupv = \x -> sr ((GHC.Types.:) 'a' x) GHC.STRef.writeSTRef reg dupv let _ = "jump" in loop (GHC.Err.error "invalid return") cs (Data.Map.Internal.Bin 1 Symantic.Parser.Grammar.Combinators.ExceptionFailure readFail Data.Map.Internal.Tip Data.Map.Internal.Tip) else let _ = "checkToken.else" in let failExp = Data.Set.Internal.Bin 1 ( Symantic.Parser.Grammar.Combinators.SomeFailure ( case inputToken of (Data.Proxy.Proxy :: Data.Proxy.Proxy tok') -> Symantic.Parser.Grammar.Combinators.FailureToken 'a' ) ) Data.Set.Internal.Tip Data.Set.Internal.Tip in let (# farInp, farExp #) = case (GHC.Classes.compare `Data.Function.on` Symantic.Parser.Machine.Input.offset) init callInput of GHC.Types.LT -> (# callInput, failExp #) GHC.Types.EQ -> (# init, failExp GHC.Base.<> Data.Set.Internal.empty #) GHC.Types.GT -> (# init, Data.Set.Internal.empty #) in readFail Symantic.Parser.Grammar.Combinators.ExceptionFailure callInput farInp farExp else let _ = "checkHorizon.else" in let failExp = Data.Set.Internal.Bin 1 ( Symantic.Parser.Grammar.Combinators.SomeFailure ( case inputToken of (Data.Proxy.Proxy :: Data.Proxy.Proxy tok') -> Symantic.Parser.Grammar.Combinators.FailureHorizon @tok' 1 ) ) Data.Set.Internal.Tip Data.Set.Internal.Tip in let (# farInp, farExp #) = case (GHC.Classes.compare `Data.Function.on` Symantic.Parser.Machine.Input.offset) init callInput of GHC.Types.LT -> (# callInput, failExp #) GHC.Types.EQ -> (# init, failExp GHC.Base.<> Data.Set.Internal.empty #) GHC.Types.GT -> (# init, Data.Set.Internal.empty #) in readFail Symantic.Parser.Grammar.Combinators.ExceptionFailure callInput farInp farExp in let _ = "jump" in loop finalRet init Data.Map.Internal.Tip )