• Computer Science
  • Published 2008

Parser combinators in Scala

@inproceedings{Moors2008ParserCI,
  title={Parser combinators in Scala},
  author={Adriaan Moors and Frank Piessens and Martin Odersky},
  year={2008}
}
Parser combinators are well-known in functional programming languages such as Haskell. In this paper, we describe how they are implemented as a library in Scala, a functional object-oriented language. Thanks to Scala’s flexible syntax, we are able to closely approximate the EBNF notation supported by dedicated parser generators. For the uninitiated, we first explain the concept of parser combinators by developing a minimal library from scratch. We then turn to the existing Scala library, and… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 35 CITATIONS

Efficient parsing with parser combinators

VIEW 2 EXCERPTS
CITES METHODS & BACKGROUND

Knowledge-based security testing of web applications by logic programming

  • International Journal on Software Tools for Technology Transfer
  • 2017
VIEW 1 EXCERPT
CITES METHODS