Browse free open source Haskell Parser Generators and projects below. Use the toggles on the left to filter open source Haskell Parser Generators by OS, license, language, programming language, and project status.

  • AI-powered service management for IT and enterprise teams Icon
    AI-powered service management for IT and enterprise teams

    Enterprise-grade ITSM, for every business

    Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
    Try it Free
  • AI-generated apps that pass security review Icon
    AI-generated apps that pass security review

    Stop waiting on engineering. Build production-ready internal tools with AI—on your company data, in your cloud.

    Retool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
    Try Retool free
  • 1
    More Than Parsing is a parser generator for context free grammars defined in a BNF-like format. It generates scanners, parsers, ASTs, etc. This sf project is no longer active, development will continue in a different place.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Queryparser

    Queryparser

    Parsing and analysis of Vertica, Hive, and Presto SQL

    Queryparser is Uber’s open source Haskell library for parsing and analyzing SQL queries written in different dialects (Vertica, Hive, Presto). It creates a unified AST and supports name resolution using catalog metadata, enabling large-scale query analysis for lineage detection, analytics, and tooling. The parsing logic produces an AST with table and column identifiers that are "raw" or optionally qualified. Frequently, it is desirable to convert the AST over raw names to an AST over resolved names, where identifiers are fully qualified. This transformation is called "name resolution" or simply "resolution". It requires as input the full list of columns in every table and the full list of tables in every schema, otherwise known as "catalog information". The parsing logic produces an AST with table and column identifiers that are "raw" or optionally qualified.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next