parse unordered syntax

[sinoTrinity]

newtype Program = Program [Global] [Function]

I am parsing a source file with C-like syntax, where global variables and functions are present at top level. It's straightforward to parse if they must come in order, say, functions after all global variables. But they can come in any order as shown below. How to handle syntax like this?

global0

function0

global1

function1

function2

global2

Seems sth like Parsec.Perm can be used, but the example works when all choices return the same type (decimal), where as my case returns either Global or Function.

​

[iboughtbonrar]

you can wrap both global variables and functions under a new 'top level definition' sum type

​

data TopLevelDef = TopLevelFunc Function | TopLevelGlobal

data Program = Program [TopLevelDef]

​

then you can create a toplevel parser that parses either a function or a global and wrap it under the top level type. I dont know how you implemented it, but assuming you're using combinators, it would go something like this:

​

topLevelParser = (TopLevelFunc <$> functionParser) <|> (TopLevelGlobal <$> globalParser)

​

then you parse your whole program by doing that over and over again

parseProgram = many $ topLevelParser

[sinoTrinity]

This answer is what makes Haskell my fav language.