This is a Scala port of attoparsec, forked from Ed Kmett's original, updated, sliced up in the style of scalaz and expanded with more combinators and parsers for base types.

Progress thus far:

• Updated to Scala 2.10 and scalaz 7.0
• Implementation is now trampolined (slower, but no more stack overflows)
• Additional combinators and parsing options
• New tut-based tutorial over here. Enjoy!
• NTriples parser example in progress here

Known issues:

• It is possible to construct a parser that does not behave properly when given incremental input. This is under investigation.
• No idea how fast or slow it is. Doesn't seem terrible but hard to say for sure.

You need scalaz and atto and you probably want spire. Here's how to get all three.

resolvers ++= Seq(
  "releases"  at "http://oss.sonatype.org/content/repositories/releases",
  "tpolecat"  at "http://dl.bintray.com/tpolecat/maven"
)

libraryDependencies ++= Seq(
  "org.scalaz"     %% "scalaz-core" % "7.0.2",
  "org.spire-math" %% "spire"       % "0.6.0",
  "org.tpolecat"   %% "atto"        % "0.1"
)

See the tutorial over here. Enjoy!