Does anyone have any guidelines on when to use ST in an algorithm vs looking for a non-monadic, pure solution?<br><br>The reason I ask is that I have just implemented an Earley parser for class (in Python) and would like to re-implement it in Haskell. The algorithm makes heavy use of mutable state, some of which can clearly be refactored out, but some of which can&#39;t be done so clearly.<br clear="all">
<br>Thanks.<br>-- <br><div dir="ltr"><div>          Alex R</div></div><br>