title: Would it be more efficient to define a parser through a pointer in a list, or to pass the list recursively?
body: <p>In C/C++ we use pointers and stuff like that to save memory when parsing through a large array of characters. Would the same be used for Haskell? I've seen some parser implementations that accept/return the "remaining characters to be parsed" in Haskell - does the compiler take care of the massive amount of memory being passed around? Thanks in advance!</p>