[Haskell-beginners] Noobie attempt to process log output into dependency graph

[John Lusk]

I have not, but I might. This was a little work project that I've now run
out of time for.

I was really hoping for a deeper discussion of state management than "just
use this package." This seems kind of like receiving a stream of inputs
from a user and needing to keep track of several items of state that are
changing independently (as opposed to the neat problems usually used in
basic FP education).

Should I be taking a more monadic approach?

On Thu, Dec 15, 2016 at 5:17 AM, Magnus Therning <magnus at therning.org>
wrote:

>
> John Lusk <johnlusk4 at gmail.com> writes:
>
> > Hi, all,
> [.. cut ..]
> > http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
>
> If I understand you correctly you want to parse a set of lines and keep
> track of indentation. This is not entirely unlike parsing a programming
> language where indentation is significant, like Haskell :) Is that
> correct?
>
> A quick look at Hackage gives several libs with combinators dealing with
> indentaion-aware parsers. Have you looked at any of them?
>
> /M
>
> --
> Magnus Therning              OpenPGP: 0x927912051716CE39
> email: magnus at therning.org   jabber: magnus at therning.org
> twitter: magthe               http://therning.org/magnus
>
> For a successful technology, reality must take precedence over public
> relations, for nature cannot be fooled.
>      — R.P. Feynman
>
> _______________________________________________
> Beginners mailing list
> Beginners at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/beginners/attachments/20161215/d7b257bb/attachment.html>