Posted
by Jeriho
on Stack Overflow
See other posts from Stack Overflow
or by Jeriho
Published on 2010-04-20T08:39:18Z
Indexed on
2010/04/20
8:43 UTC
Read the original article
Hit count: 466
I am using parsing combinators in scala If I have recursive parser:
val parser = "(?ui)(regexvalue)".r | (parser2~>value)
How can I check how many characters of input my parser consumed?
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
I've installed ensime according to the README.md file, however, I get errors in the inferior-ensime-server buffer with the following:
INFO: Fatal Error: scala.tools.nsc.MissingRequirementError: object scala not found.
scala.tools.nsc.MissingRequirementError: object scala not found.
at scala…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
When I run M-X ensime-disconnect I get the following forever:
string matching regex `\"((?:[^\"\\]|\\.)*)\"' expected but `^@' found
and I see this exception when I use C-c C-c
Uncaught exception in com.ensime.server.SocketHandler@769aba32
java.net.SocketException: Broken pipe
at java…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm using Scala 2.8.0 and trying to read pipe delimited file like in code snipped below:
object Main {
def main(args: Array[String]) :Unit = {
if (args.length > 0) {
val lines = scala.io.Source.fromPath("QUICK!LRU-2009-11-15.psv")
for (line <-lines)
print(line)
}
…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I don't understand why authors said that Code Listing 9.1 from "Programming in Scala" use closure. In chapter 9, they show how to refactor code into more less duplicated form, from this original code:
object FileMatcher {
private def filesHere = (new java.io.File(".")).listFiles
def filesEnding(query:…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am processing a XML document and iterating through nodes. I want to iterate through the nodes and build a new List of some type. How would I do this with Scala:
Here is my XML traverse code:
def findClassRef(xmlNode: Elem) = {
xmlNode\"classDef" foreach { (entry) =>
val name…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Around 6 years ago, I benchmarked my own parser combinators in OCaml and found that they were ~5× slower than the parser generators on offer at the time. I recently revisited this subject and benchmarked Haskell's Parsec vs a simple hand-rolled precedence climbing parser written in F# and was…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Given a family of objects that implement parser combinators, how do I combine the parsers? Since Parsers.Parser is an inner class, and in Scala inner classes are bound to the outer object, the story becomes slightly complicated.
Here's an example that attempts to combine two parsers from different…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am using parsing combinators in scala
If I have recursive parser:
val parser = "(?ui)(regexvalue)".r | (parser2~value)
How can I check how many characters of input my parser consumed?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm trying to get this to work:
def emptyCond: Parser[Cond] = ("if" ~ "(") ~> regularStr <~ ")" ^^ { case s => Cond("",Nil,Nil) }
where regularStr is defined to accept a number of things, including ")". Of course, I want this to be an acceptable input: if(foo()). But for any if(x) it is…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am wondered why there is no generalized parser combinators for Bottom-up parsing in Haskell like a Parsec combinators for top down parsing.
( I could find some research work went during 2004 but nothing after
https://haskell-functional-parsing.googlecode.com/files/Ljunglof-2002a.pdf
http://www…
>>> More
