Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>You have many questions!</p> <blockquote> <p>Comparing parsec (which is only one of many Haskell parser combinator libraries) to the Scala implementation of parsec</p> </blockquote> <p>No one has made comparisons here, as the Scala code is fairly new, but check the documentation:</p> <ul> <li><a href="http://hackage.haskell.org/package/parsec" rel="nofollow noreferrer">http://hackage.haskell.org/package/parsec</a></li> <li><a href="http://www.scala-lang.org/api/current/index.html#scala.util.parsing.combinator.Parsers$Parser" rel="nofollow noreferrer">http://www.scala-lang.org/api/current/index.html#scala.util.parsing.combinator.Parsers</a></li> </ul> <p>Note that Haskell has many other parser combinator libraries, if you're interested in this approach, e.g.</p> <ul> <li><a href="http://hackage.haskell.org/package/attoparsec" rel="nofollow noreferrer">attoparsec</a> + <a href="http://hackage.haskell.org/package/attoparsec-iteratee" rel="nofollow noreferrer">attoparsec-iteratee</a> </li> <li><a href="http://hackage.haskell.org/package/polyparse" rel="nofollow noreferrer">polyparse</a></li> </ul> <blockquote> <p>What are some strengths/weaknesses of Scala's implementation of parser combinators, vs Haskell's?</p> </blockquote> <p>The Haskell code is more than a decade old, well understood, and there are many examples, lots of documentation and user cases. Scala's stuff is relatively new.</p> <blockquote> <p>packrat parsing</p> </blockquote> <p>packrat parsing is different entirely. The original <a href="http://pdos.csail.mit.edu/~baford/packrat/icfp02/" rel="nofollow noreferrer">packrat paper</a> was developed in Haskell, but has since become more widespread.</p> <blockquote> <p>Is there a webpage or some other resource that shows how different operators/functions/DSL-sugar from one language's implementation maps onto the other's?</p> </blockquote> <p>No, but that would be cool. However, almost all(?) parser combinator libraries are based on the pioneering parsec implementation, so they share a lot with the original parsec.</p>
    singulars
    1. This table or related slice is empty.
    1. POHow do Scala parser combinators compare to Haskell's Parsec?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USДМИТРИЙ МАЛИКОВ
    1. USDon Stewart
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload