Loading...
Please wait, while we are loading the content...
Similar Documents
Parser Combinators in Scala Adriaan
| Content Provider | Semantic Scholar |
|---|---|
| Author | Moors, Adriaan Martin, Frank |
| Copyright Year | 2008 |
| Abstract | 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 discuss its features using various examples. Chapter |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW491.pdf |
| Alternate Webpage(s) | http://www.cs.kuleuven.be/publicaties/rapporten/cw/CW491.pdf |
| Alternate Webpage(s) | http://www.cse.unt.edu/~tarau/teaching/ScalaCourse/ScalaPapers/CW491.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |