Search Results

Search found 1820 results on 73 pages for 'parser combinators'.

Page 1/73 | 1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >

• Scala: How to combine parser combinators from different objects

  - by eed3si9n

  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 objects. import scala.util.parsing.combinator._ …

  Read the article

• Can parser combinators be made efficient?

  - by Jon Harrop

  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 surprised to find the F# to be 25× faster than the…

  Read the article

• What kind parser that phpdoc use ?

  - by justjoe

  When the first time, i install phpdoc, i love it so much. And i want to create its mini version for myself use. So, can anybody give me information about what kind of parser it has. and Maybe a image reference on how it works (so i can picture it visually in my mind) ?

  Read the article

• Scala parser combinator runs out of memory

  - by user3217013

  I wrote the following parser in Scala using the parser combinators: import scala.util.parsing.combinator._ import scala.collection.Map import scala.io.StdIn object Keywords { val Define = "define" val True = "true" val False = "false" val If = "if" val Then = "then" val Else = "else" val Return = "return" …

  Read the article

• Can parser combination be made efficient?

  - by Jon Harrop

  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 surprised to find the F# to be 25× faster than the…

  Read the article

• Automate Log Parser to Find Your Data Faster

  - by The Official Microsoft IIS Site

  Microsoft’s Log Parser is a really powerful tool for searching log files. With just a few simple SQL commands you can pull more data than you ever imagined out of your logs. It can be used to read web site log files, csv files, and even Windows event logs. Log Parser isn’t intended to compete with stats products such as Webtrends Log Analyzer…

  Read the article

• Parser generator for inline documentation

  - by Leonth

  To have a general-purpose documentation system that can extract inline documentation of multiple languages, a parser for each language is needed. A parser generator (which actually doesn't have to be that complete or efficient) is thus needed. http://antlr.org/ is a nice parser generator that already has a number of grammars for popular…

  Read the article

• ANTLR parser hanging at proxy.handshake call

  - by Peter Boughton

  I am attempting to get a basic ECMAScript parser working, and found a complete ANTLR grammar for ECMAScript 3, which appears to compile ok and produces the appropriate Lexer/Parser/Walker Java files. (Running inside ANTLR IDE plugin for Eclipse 3.5) However, when actually trying to use it with some simple test code (following guide on…

  Read the article

• What parser generator do you recommend

  - by stefan.ciobaca

  I'm currently shopping for a FOSS parser generator for a project of mine. It has to support either C or C++. I've looked at bison/flex and at boost::spirit. I went from writing my own to spirit to bison to spirit to bison to spirit, each time hit by some feature I found unpleasant. The thing I hate most about bison/flex is that they…

  Read the article

• Generalized Bottom up Parser Combinators in Haskell

  - by Panini Sai

  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…

  Read the article

• Is LINQ to objects a collection of combinators?

  - by Jimmy Hoffa

  I was just trying to explain the usefulness of combinators to a colleague and I told him LINQ to objects are like combinators as they exhibit the same value, the ability to combine small pieces to create a single large piece. Though I don't know that I can call LINQ to objects…

  Read the article

• Parser combinators info

  - by Jeriho

  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?

  Read the article

• Core Data error when assigning variable with one-to-one relationship

  - by Hoang Pham

  I tried to assign a managed object (C) with its property another managed object (B) (a one-to-one relationship) in which this other managed object (B) has a to-many relationship with one other managed object (A). There is an error from this assignment in which I copied as…

  Read the article

• Scala parser combinators: how to parse "if(x)" if x can contain a ")"

  - by Germán

  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:…

  Read the article

• c++ write own xml parser vs using tinyxml

  - by AdityaGameProgrammer

  Hi , I am currently in a task to generate an XML file for an srt text file containing timestamps and corresponding text. To generate an exe file which accepts file name input and outputs the relevant XML file to be used as part of an automated script. Is it…

  Read the article

• design for a parser to handle very large files

  - by user619818

  I have written a program which records protocol messages between an application and a hardware device which matches each application request with each hardware response. This is so that I can later remove the hardware, connect a 'replay' application to the main…

  Read the article

• Advanced control of recursive parser in scala

  - by Jeriho

  val uninterestingthings = ".".r val parser = "(?ui)(regexvalue)".r | (uninterestingthings~>parser) This recursive parser will try to parse "(?ui)(regexvalue)".r until the end of input. Is in scala a way to prohibit parsing when some defined number of…

  Read the article

• How can I test a parser for a bespoke XML schema?

  - by Greg B

  I'm parsing a bespoke XML format into an object graph using .NET 4.0. My parser is using the System.XML namespace internally, I'm then interrogating the relevant properties of XmlNodes to create my object graph. I've got a first cut of the parser working…

  Read the article

• Role of Combinators in Concatenative/Tacit Programming Languages.

  - by Bubba88

  Hi! I have a question about what exact role do higher-order compinators (or function producers) hold in concatenative/tacit programming. Additionally I would like to ask if there is another way to implement concatenative programming language rather than…

  Read the article

• Wiki .NET Parser, C#

  Wiki .NET Parser C#, 3 (4) files with lexer, grammar, parser definition and ANTLR engine

  Read the article

• Wiki .NET Parser, C#

  Wiki .NET Parser C#, 3 (4) files with lexer, grammar, parser definition and ANTLR engine

  Read the article

• writing a fast parser in python

  - by panzi

  I've written a hands-on recursive pure python parser for a some file format (ARFF) we use in one lecture. Now running my exercise submission is awfully slow. Turns out by far the most time is spent in my parser. It's consuming a lot of CPU time, the HD is…

  Read the article

• Difference between an LL and Recursive Descent parser?

  - by Noldorin

  I've recently being trying to teach myself how parsers (for languages/context-free grammars) work, and most of it seems to be making sense, except for one thing. I'm focusing my attention in particular on LL(k) grammars, for which the two main algorithms…

  Read the article

• Scala: Can I nudge a combinator parser to be locally greedy?

  - by eed3si9n

  Suppose I have an ambiguous language expressed in combinator parser. Is there a way to make certain expressions locally greedy? Here's an example of what I mean. import scala.util.parsing.combinator._ object Example extends JavaTokenParsers { def…

  Read the article

• Help me find an appropriate ruby/python parser generator

  - by Geo

  The first parser generator I've worked with was Parse::RecDescent, and the guides/tutorials available for it were great, but the most useful feature it has was it's debugging tools, specifically the tracing capabilities ( activated by setting…

  Read the article

1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >