Owl

Languages and libraries

parser generator

SHOW HN2018

156points
42comments
#257of 2,155 in 2018
Top 12%of 2018 by points

How HN took it

CuriousMostly questions and neutral comments

7 positive, 13 neutral or asking, 0 mixed, 3 critical, out of 23 comments about the project. Thread score +0.06.

Idea: 4 for, 2 againstDesign: 2 for, 0 againstDocs: 1 for, 0 againstExecution: 0 for, 1 against

The thread, comment by comment

Each row is a top-level comment and its replies, in HN's order. Select a cell to open that comment on HN.

positive neutral or mixed critical about another commenter or something else the maker

What HN said

What people liked

  • Impressive design and syntax highlighting in the try-it page

    From 1 comment
    • Hi, I see that this is your tool, just wanted to say it looks amazing! Also I did not realize how much of a difference syntax highlighting makes for this kind of thing until I…
      sbjs on HN
  • Useful ambiguity detection compared with ANTLR

    From 1 comment
    • Yeah, they both solve the same problem -- turning text into a structured "parse tree". At the core of each parsing tool is a particular parsing algorithm. The details of this…
      panic on HN

Objections

  • Restricted to grammars where recursion is bounded by explicit begin and end tokens

    From 1 comment
    • > Can you provide some intuition on which languages can be parsed by this algorithm, and which can't? The restriction is that any recursion in the grammar has to be inside…
      panic on HN
  • Arithmetic expressions without operator support can be split into separate statements

    From 1 comment
    • Handling arithmetic expressions in a simple parser is difficult. The approach here seems limited in the usual way. e.g the following is parsed as two statements (separated by the…
      hyperpallium on HN

Requests

  • Support for incremental DFA construction

    From 1 comment
    • "Owl uses precomputed DFAs and action tables, which can blow up in size as grammars get more complex. In the future, it would be nice to build the DFAs incrementally." Don't know…
      blarg1 on HN
  • Runtime conflict resolution for operator precedence

    From 1 comment
    • I don't see the trick I really like to use - which is for some conflicts (mostly shift/reduce ones) decide to resolve them on the fly at run time (it lets you do things like…
      Taniwha on HN

Questions

  • How does it compare to ANTLR and how does it differ in algorithm

    From 1 comment
    • Is Owl similar to ANTLR? Could you explain the differences between the two languages, and what makes a parser unique if they're similar? I'm curious because I've quickly run…
      chucky_z on HN
  • Which languages can it parse and which cannot

    From 1 comment
    • Looks interesting. Can you provide some intuition on which languages can be parsed by this algorithm, and which can't? Btw, why did you choose the name Owl?
      erezsh on HN

Alternatives named

  • ANTLR

    From 2 comments
    • Is Owl similar to ANTLR? Could you explain the differences between the two languages, and what makes a parser unique if they're similar? I'm curious because I've quickly run…
      chucky_z on HN
    • Owl is much more limited. That's not a problem because the documentation tells outright what it can and can't do and what it's for; experts can get things done better if we have…
      bmn__ on HN
  • Marpa

    From 2 comments
    • Hey- does anyone know how this compares to Marpa? Also, more examples of errors would be great :)
      nmca on HN
    • Owl is much more limited. That's not a problem because the documentation tells outright what it can and can't do and what it's for; experts can get things done better if we have…
      bmn__ on HN

Category, keywords, summaries and labels on this page were made by AI (Thread Reader v2) and not checked by hand. Each point links to the comments it came from.

Add a badge to your READMEShown on HackerShow
[![Shown on HackerShow](https://hackershow.org/badge.svg)](https://hackershow.org/show/17644115)