# tree-sitter-haskell
[](https://github.com/tree-sitter/tree-sitter-haskell/actions/workflows/ci.yml)
Haskell grammar for [tree-sitter].
# References
- [Haskell 2010 Language Report – Syntax References][ref]
- [GHC Language Extensions][ext]
# Supported Language Extensions
These extensions are supported ✅, unsupported ❌ or not applicable because they don't involve parsing ➖️:
- AllowAmbiguousTypes ➖️
- ApplicativeDo ➖️
- Arrows ❌
- BangPatterns ✅
- BinaryLiterals ✅
- BlockArguments ✅
- CApiFFI ✅
- ConstrainedClassMethods ✅
- ConstraintKinds ✅
- CPP ✅
- CUSKs ✅
- DataKinds ✅
- DatatypeContexts ✅
- DefaultSignatures ✅
- DeriveAnyClass ➖️
- DeriveDataTypeable ➖️
- DeriveFoldable ➖️
- DeriveFunctor ➖️
- DeriveGeneric ➖️
- DeriveLift ➖️
- DeriveTraversable ➖️
- DerivingStrategies ✅
- DerivingVia ✅
- DisambiguateRecordFields ➖️
- DuplicateRecordFields ➖️
- EmptyCase ✅
- EmptyDataDecls ✅
- EmptyDataDeriving ✅
- ExistentialQuantification ✅
- ExplicitForAll ✅
- ExplicitNamespaces ✅
- ExtendedDefaultRules ➖️
- FlexibleContexts ✅
- FlexibleInstances ✅
- ForeignFunctionInterface ✅
- FunctionalDependencies ✅
- GADTs ✅
- GADTSyntax ✅
- GeneralisedNewtypeDeriving ➖️
- GHCForeignImportPrim ✅
- Haskell2010 ➖️
- Haskell98 ➖️
- HexFloatLiterals ✅
- ImplicitParams ✅
- ImplicitPrelude ➖️
- ImportQualifiedPost ✅
- ImpredicativeTypes ➖️
- IncoherentInstances ➖️
- InstanceSigs ✅
- InterruptibleFFI ✅
- KindSignatures ✅
- LambdaCase ✅
- LexicalNegation ❌
- LiberalTypeSynonyms ✅
- LinearTypes ✅
- ListTuplePuns ✅
- MagicHash ✅
- Modifiers ❌
- MonadComprehensions ➖️
- MonadFailDesugaring ➖️
- MonoLocalBinds ➖️
- MonomorphismRestriction ➖️
- MultiParamTypeClasses ✅
- MultiWayIf ✅
- NamedFieldPuns ✅
- NamedWildCards ✅
- NegativeLiterals ➖️
- NondecreasingIndentation ✅
- NPlusKPatterns ➖️
- NullaryTypeClasses ✅
- NumDecimals ➖️
- NumericUnderscores ✅
- OverlappingInstances ➖️
- OverloadedLabels ✅
- OverloadedLists ➖️
- OverloadedRecordDot ✅
- OverloadedRecordUpdate ✅
- OverloadedStrings ➖️
- PackageImports ✅
- ParallelListComp ✅
- PartialTypeSignatures ✅
- PatternGuards ✅
- PatternSynonyms ✅
- PolyKinds ➖️
- PostfixOperators ➖️
- QualifiedDo ✅
- QuantifiedConstraints ✅
- QuasiQuotes ✅
- Rank2Types ✅
- RankNTypes ✅
- RebindableSyntax ➖️
- RecordWildCards ➖️
- RecursiveDo ✅
- RequiredTypeArguments ✅
- RoleAnnotations ✅
- Safe ➖️
- ScopedTypeVariables ✅
- StandaloneDeriving ✅
- StandaloneKindSignatures ✅
- StarIsType ✅
- StaticPointers ❌
- Strict ➖️
- StrictData ✅
- TemplateHaskell ✅
- TemplateHaskellQuotes ✅
- TraditionalRecordSyntax ➖️
- TransformListComp ✅
- Trustworthy ➖️
- TupleSections ✅
- TypeAbstractions ✅
- TypeApplications ✅
- TypeData ✅
- TypeFamilies ✅
- TypeFamilyDependencies ✅
- TypeInType ✅
- TypeOperators ✅
- TypeSynonymInstances ➖️
- UnboxedSums ✅
- UnboxedTuples ✅
- UndecidableInstances ➖️
- UndecidableSuperClasses ➖️
- UnicodeSyntax ✅
- UnliftedFFITypes ➖️
- UnliftedNewtypes ✅
- Unsafe ➖️
- ViewPatterns ✅
# Bugs
## CPP
Preprocessor `#elif` and `#else` directives cannot be handled correctly, since the parser state would have to be
manually reset to what it was at the `#if`.
As a workaround, the code blocks in the alternative branches are parsed as part of the directives.
# Querying
The grammar contains several [supertypes](https://tree-sitter.github.io/tree-sitter/using-parsers#static-node-types),
which group multiple other node types under a single name.
Supertype names do not occur as extra nodes in parse trees, but they can be used in queries in special ways:
- As an alias, matching any of their subtypes
- As prefix for one of their subtypes, matching its symbol only when it occurs as a production of the supertype
For example, the query `(expression)` matches the nodes `infix`, `record`, `projection`, `constructor`, and the second
and third `variable` in this tree for `cats <> Cat {mood = moods.sleepy}`:
```
(infix
(variable)
(operator)
(record
(constructor)
(field_update
(field_name (variable))
(projection (variable) (field_name (variable)))))))))
```
The two occurrences of `variable` in `field_name` (`mood` and `sleepy`) are not expressions, but record field names part
of a composite `record` expression.
Matching `variable` nodes specifically that are expressions is possible with the second special form.
A query for `(expression/variable)` will match only the other two, `cats` and `moods`.
The grammar's supertypes consist of the following sets:
- [`expression`](./grammar/exp.js)
Rules that are valid in any expression position, excluding type applications, explicit types and expression
signatures.
- [`pattern`](./grammar/pat.js)
Rules that are valid in any pattern position, excluding type binders, explicit types and pattern signatures.
- [`type`](./grammar/type.js)
Types that are either atomic (have no ambiguous associativity, like bracketed constructs, variables and type
constructors), applied types or infix types.
- [`quantified_type`](./grammar/type.js)
Types prefixed with a `forall`, context or function parameter.
- [`constraint`](./grammar/constraint.js)
Almost the same rules as `type`, but mirrored for use in contexts.
- [`constraints`](./grammar/constraints.js)
Analog of `quantified_type`, for constraints with `forall` or context.
- [`type_param`](./grammar/type.js)
Atomic nodes in type and class heads, like the three nodes following `A` in `data A @k a (b :: k)`.
- [`declaration`](./grammar/module.js)
All top-level declarations, like functions and data types.
- [`decl`](./grammar/decl.js)
Shorthand for declarations that are also valid in local bindings (`let` and `where`) and in class and instance bodies,
except for fixity declarations.
Consists of `signature`, `function` and `bind`.
- [`class_decl` and `instance_decl`](./grammar/class.js)
All declarations that are valid in classes and instances, which includes associated type and data families.
- [`statement`](./grammar/exp.js)
Different forms of `do`-notation statements.
- [`qualifier`](./grammar/exp.js)
Different forms of list comprehension qualifiers.
- [`guard`](./grammar/exp.js)
Different forms of guards in function equations and case alternatives.
# Development
The main driver for generating and testing the parser for this grammar is the [tree-sitter CLI][cli].
Other components of the project require additional tools, described below.
Some are made available through `npm` – for example, `npx tree-sitter` runs the CLI.
If you don't have `tree-sitter` available otherwise, prefix all the commands in the following sections with `npx`.
## Output path
The CLI writes the shared library containing the parser to the directory denoted by `$TREE_SITTER_LIBDIR`.
If that variable is unset, it defaults to `$HOME/.cache/tree-sitter/lib`.
In order to avoid clobbering this global directory with development versions, you can set the env var to a local path:
```
export TREE_SITTER_LIBDIR=$PWD/.lib
```
## The grammar
The javascript file `grammar.js` contains the entry point into the grammar's production rules.
Please consult the [tree-sitter documentation][grammar-docs] for a comprehensive introduction to the syntax and
semantics.
Parsing starts with the first item in the `rules` field:
```javascript
{
rules: {
haskell: $ => seq(
optional($.header),
optional($._body),
),
}
}
```
## Generating the parser
The first step in the development workflow converts the javascript rule definitions to C code in `src/parser.c`:
```
$ tree-sitter generate
```
Two byproducts of this process are written to `src/grammar.json` and `src/node-types.json`.
## Compiling the parser
The C code is automatically compiled by most of the test tools mentioned below, but you can instruct tree-sitter to do
it in one go:
```
$ tree-sitter generate --build
```
If you've set `$TREE_SITTER_LIBDIR` as mentioned above, the shared object will be written to `$PWD/.lib/haskell.so`.
Aside from the generated `src/parser.c`, tree-sitter will also compile and link `src/scanner.c` into this object.
This file contains the _external scanner_, which is a custom extension of the built-in lexer whose purpose is to handle
language constructs that cannot be expressed (efficiently) in the javascript grammar, like Haskell layouts.
### WebAssembly
The parser can be compiled to WebAssembly as well, which requires `emscripten`:
```
$ tree-sitter build --wasm
```
The resulting binary is written to `$PWD/tree-sitter-haskell.wasm`.
## Testing the parser
The most fundamental test infrastructure for tree-sitter grammars consists of a set of code snippets with associated
reference ASTs stored in `./test/corpus/*.txt`.
```
$ tree-sitter test
```
Individual tests can be run by specifying (a substring of) their description with `-f`:
```
$ tree-sitter test -f 'module: exports empty'
```
The project contains several other types of tests:
- `test/parse/run.bash [update] [test names ...]` parses the files in `test/parse/*.hs` and compares the output with
`test/parse/*.target`.
If `update` is specified as the first argument, it will update the `.target` file for the first failing test.
- `test/query/run.bash [update] [test names ...]` parses the files in `test/query/*.hs`, applies the queries in
`test/query/*.query` and compares the output with `test/query/*.target`, similar to `test/parse`.
- `test/rust/parse-test.rs` contains a few tests that use tree-sitter's Rust API to extract the test ranges for
terminals in a slightly more convenient way.
This requires `cargo` to be installed, and can be executed with `cargo test` (which also runs the tests in
`bindings/rust`).
- `test/parse-libs [wasm]` clones a set of Haskell libraries to `test/libs` and parses the entire codebase.
When invoked as `test/parse-libs wasm`, it will use the WebAssembly parser.
This requires `bc` to be installed.
- `test/parse-lib name [wasm]` parses only the library `name` in that directory (without cloning the repository).
### Debugging
The shared library built by `tree-sitter test` includes debug symbols, so if the scanner segfaults you can just run
`coredumpctl debug` to inspect the backtrace and memory:
```
newline_lookahead () at src/scanner.c:2583
2583 ((Newline *) 0)->indent = 5;
(gdb) bt
#0 newline_lookahead () at src/scanner.c:2583
#1 0x00007ffff7a0740e in newline_start () at src/scanner.c:2604
#2 scan () at src/scanner.c:2646
#3 eval () at src/scanner.c:2684
#4 tree_sitter_haskell_external_scanner_scan (payload=<optimized out>, lexer=<optimized out>,
valid_symbols=<optimized out>) at src/scanner.c:2724
#5 0x0000555555772488 in ts_parser.lex ()
```
For more control, launch `gdb tree-sitter` and start the process with `run test -f 'some test'`, and set a breakpoint
with `break tree_sitter_haskell_external_scanner_scan`.
To disable optimizations, run `tree-sitter test --debug-build`.
#### Tracing
The `test` and `parse` commands offer two modes for obtaining detailed information about the parsing process.
With `tree-sitter test --debug`, every lexer step and shift/reduce action is printed to stderr.
With `tree-sitter test --debug-graph`, the CLI will generate an HTML file showing a graph representation of every step.
This requires `graphviz` to be installed.
[tree-sitter]: https://github.com/tree-sitter/tree-sitter
[ref]: https://www.haskell.org/onlinereport/haskell2010/haskellch10.html
[ext]: https://downloads.haskell.org/~ghc/latest/docs/html/users_guide/exts/table.html
[cli]: https://github.com/tree-sitter/tree-sitter/tree/master/cli
[grammar-docs]: https://tree-sitter.github.io/tree-sitter/creating-parsers#writing-the-grammar
Raw data
{
"_id": null,
"home_page": null,
"name": "tree-sitter-haskell",
"maintainer": "Torsten Schmits",
"docs_url": null,
"requires_python": ">=3.8",
"maintainer_email": null,
"keywords": "incremental, parsing, tree-sitter, haskell",
"author": "Rick Winfrey",
"author_email": null,
"download_url": "https://files.pythonhosted.org/packages/a8/18/fabe2c1ef465e51d4e6c2d942b3bc1f48010273afafcd31e0c95c0b43d0f/tree-sitter-haskell-0.21.0.tar.gz",
"platform": null,
"description": "# tree-sitter-haskell\n\n[](https://github.com/tree-sitter/tree-sitter-haskell/actions/workflows/ci.yml)\n\nHaskell grammar for [tree-sitter].\n\n# References\n\n- [Haskell 2010 Language Report \u2013 Syntax References][ref]\n- [GHC Language Extensions][ext]\n\n# Supported Language Extensions\n\nThese extensions are supported \u2705, unsupported \u274c or not applicable because they don't involve parsing \u2796\ufe0f:\n\n- AllowAmbiguousTypes \u2796\ufe0f\n- ApplicativeDo \u2796\ufe0f\n- Arrows \u274c\n- BangPatterns \u2705\n- BinaryLiterals \u2705\n- BlockArguments \u2705\n- CApiFFI \u2705\n- ConstrainedClassMethods \u2705\n- ConstraintKinds \u2705\n- CPP \u2705\n- CUSKs \u2705\n- DataKinds \u2705\n- DatatypeContexts \u2705\n- DefaultSignatures \u2705\n- DeriveAnyClass \u2796\ufe0f\n- DeriveDataTypeable \u2796\ufe0f\n- DeriveFoldable \u2796\ufe0f\n- DeriveFunctor \u2796\ufe0f\n- DeriveGeneric \u2796\ufe0f\n- DeriveLift \u2796\ufe0f\n- DeriveTraversable \u2796\ufe0f\n- DerivingStrategies \u2705\n- DerivingVia \u2705\n- DisambiguateRecordFields \u2796\ufe0f\n- DuplicateRecordFields \u2796\ufe0f\n- EmptyCase \u2705\n- EmptyDataDecls \u2705\n- EmptyDataDeriving \u2705\n- ExistentialQuantification \u2705\n- ExplicitForAll \u2705\n- ExplicitNamespaces \u2705\n- ExtendedDefaultRules \u2796\ufe0f\n- FlexibleContexts \u2705\n- FlexibleInstances \u2705\n- ForeignFunctionInterface \u2705\n- FunctionalDependencies \u2705\n- GADTs \u2705\n- GADTSyntax \u2705\n- GeneralisedNewtypeDeriving \u2796\ufe0f\n- GHCForeignImportPrim \u2705\n- Haskell2010 \u2796\ufe0f\n- Haskell98 \u2796\ufe0f\n- HexFloatLiterals \u2705\n- ImplicitParams \u2705\n- ImplicitPrelude \u2796\ufe0f\n- ImportQualifiedPost \u2705\n- ImpredicativeTypes \u2796\ufe0f\n- IncoherentInstances \u2796\ufe0f\n- InstanceSigs \u2705\n- InterruptibleFFI \u2705\n- KindSignatures \u2705\n- LambdaCase \u2705\n- LexicalNegation \u274c\n- LiberalTypeSynonyms \u2705\n- LinearTypes \u2705\n- ListTuplePuns \u2705\n- MagicHash \u2705\n- Modifiers \u274c\n- MonadComprehensions \u2796\ufe0f\n- MonadFailDesugaring \u2796\ufe0f\n- MonoLocalBinds \u2796\ufe0f\n- MonomorphismRestriction \u2796\ufe0f\n- MultiParamTypeClasses \u2705\n- MultiWayIf \u2705\n- NamedFieldPuns \u2705\n- NamedWildCards \u2705\n- NegativeLiterals \u2796\ufe0f\n- NondecreasingIndentation \u2705\n- NPlusKPatterns \u2796\ufe0f\n- NullaryTypeClasses \u2705\n- NumDecimals \u2796\ufe0f\n- NumericUnderscores \u2705\n- OverlappingInstances \u2796\ufe0f\n- OverloadedLabels \u2705\n- OverloadedLists \u2796\ufe0f\n- OverloadedRecordDot \u2705\n- OverloadedRecordUpdate \u2705\n- OverloadedStrings \u2796\ufe0f\n- PackageImports \u2705\n- ParallelListComp \u2705\n- PartialTypeSignatures \u2705\n- PatternGuards \u2705\n- PatternSynonyms \u2705\n- PolyKinds \u2796\ufe0f\n- PostfixOperators \u2796\ufe0f\n- QualifiedDo \u2705\n- QuantifiedConstraints \u2705\n- QuasiQuotes \u2705\n- Rank2Types \u2705\n- RankNTypes \u2705\n- RebindableSyntax \u2796\ufe0f\n- RecordWildCards \u2796\ufe0f\n- RecursiveDo \u2705\n- RequiredTypeArguments \u2705\n- RoleAnnotations \u2705\n- Safe \u2796\ufe0f\n- ScopedTypeVariables \u2705\n- StandaloneDeriving \u2705\n- StandaloneKindSignatures \u2705\n- StarIsType \u2705\n- StaticPointers \u274c\n- Strict \u2796\ufe0f\n- StrictData \u2705\n- TemplateHaskell \u2705\n- TemplateHaskellQuotes \u2705\n- TraditionalRecordSyntax \u2796\ufe0f\n- TransformListComp \u2705\n- Trustworthy \u2796\ufe0f\n- TupleSections \u2705\n- TypeAbstractions \u2705\n- TypeApplications \u2705\n- TypeData \u2705\n- TypeFamilies \u2705\n- TypeFamilyDependencies \u2705\n- TypeInType \u2705\n- TypeOperators \u2705\n- TypeSynonymInstances \u2796\ufe0f\n- UnboxedSums \u2705\n- UnboxedTuples \u2705\n- UndecidableInstances \u2796\ufe0f\n- UndecidableSuperClasses \u2796\ufe0f\n- UnicodeSyntax \u2705\n- UnliftedFFITypes \u2796\ufe0f\n- UnliftedNewtypes \u2705\n- Unsafe \u2796\ufe0f\n- ViewPatterns \u2705\n\n# Bugs\n\n## CPP\n\nPreprocessor `#elif` and `#else` directives cannot be handled correctly, since the parser state would have to be\nmanually reset to what it was at the `#if`.\nAs a workaround, the code blocks in the alternative branches are parsed as part of the directives.\n\n# Querying\n\nThe grammar contains several [supertypes](https://tree-sitter.github.io/tree-sitter/using-parsers#static-node-types),\nwhich group multiple other node types under a single name.\n\nSupertype names do not occur as extra nodes in parse trees, but they can be used in queries in special ways:\n\n- As an alias, matching any of their subtypes\n- As prefix for one of their subtypes, matching its symbol only when it occurs as a production of the supertype\n\nFor example, the query `(expression)` matches the nodes `infix`, `record`, `projection`, `constructor`, and the second\nand third `variable` in this tree for `cats <> Cat {mood = moods.sleepy}`:\n\n```\n(infix\n (variable)\n (operator)\n (record\n (constructor)\n (field_update\n (field_name (variable))\n (projection (variable) (field_name (variable)))))))))\n```\n\nThe two occurrences of `variable` in `field_name` (`mood` and `sleepy`) are not expressions, but record field names part\nof a composite `record` expression.\n\nMatching `variable` nodes specifically that are expressions is possible with the second special form.\nA query for `(expression/variable)` will match only the other two, `cats` and `moods`.\n\nThe grammar's supertypes consist of the following sets:\n\n- [`expression`](./grammar/exp.js)\n\n Rules that are valid in any expression position, excluding type applications, explicit types and expression\n signatures.\n\n- [`pattern`](./grammar/pat.js)\n\n Rules that are valid in any pattern position, excluding type binders, explicit types and pattern signatures.\n\n- [`type`](./grammar/type.js)\n\n Types that are either atomic (have no ambiguous associativity, like bracketed constructs, variables and type\n constructors), applied types or infix types.\n\n- [`quantified_type`](./grammar/type.js)\n\n Types prefixed with a `forall`, context or function parameter.\n\n- [`constraint`](./grammar/constraint.js)\n\n Almost the same rules as `type`, but mirrored for use in contexts.\n\n- [`constraints`](./grammar/constraints.js)\n\n Analog of `quantified_type`, for constraints with `forall` or context.\n\n- [`type_param`](./grammar/type.js)\n\n Atomic nodes in type and class heads, like the three nodes following `A` in `data A @k a (b :: k)`.\n\n- [`declaration`](./grammar/module.js)\n\n All top-level declarations, like functions and data types.\n\n- [`decl`](./grammar/decl.js)\n\n Shorthand for declarations that are also valid in local bindings (`let` and `where`) and in class and instance bodies,\n except for fixity declarations.\n Consists of `signature`, `function` and `bind`.\n\n- [`class_decl` and `instance_decl`](./grammar/class.js)\n\n All declarations that are valid in classes and instances, which includes associated type and data families.\n\n- [`statement`](./grammar/exp.js)\n\n Different forms of `do`-notation statements.\n\n- [`qualifier`](./grammar/exp.js)\n\n Different forms of list comprehension qualifiers.\n\n- [`guard`](./grammar/exp.js)\n\n Different forms of guards in function equations and case alternatives.\n\n# Development\n\nThe main driver for generating and testing the parser for this grammar is the [tree-sitter CLI][cli].\nOther components of the project require additional tools, described below.\n\nSome are made available through `npm` \u2013 for example, `npx tree-sitter` runs the CLI.\nIf you don't have `tree-sitter` available otherwise, prefix all the commands in the following sections with `npx`.\n\n## Output path\n\nThe CLI writes the shared library containing the parser to the directory denoted by `$TREE_SITTER_LIBDIR`.\nIf that variable is unset, it defaults to `$HOME/.cache/tree-sitter/lib`.\n\nIn order to avoid clobbering this global directory with development versions, you can set the env var to a local path:\n\n```\nexport TREE_SITTER_LIBDIR=$PWD/.lib\n```\n\n## The grammar\n\nThe javascript file `grammar.js` contains the entry point into the grammar's production rules.\nPlease consult the [tree-sitter documentation][grammar-docs] for a comprehensive introduction to the syntax and\nsemantics.\n\nParsing starts with the first item in the `rules` field:\n\n```javascript\n{\n rules: {\n haskell: $ => seq(\n optional($.header),\n optional($._body),\n ),\n }\n}\n```\n\n## Generating the parser\n\nThe first step in the development workflow converts the javascript rule definitions to C code in `src/parser.c`:\n\n```\n$ tree-sitter generate\n```\n\nTwo byproducts of this process are written to `src/grammar.json` and `src/node-types.json`.\n\n## Compiling the parser\n\nThe C code is automatically compiled by most of the test tools mentioned below, but you can instruct tree-sitter to do\nit in one go:\n\n```\n$ tree-sitter generate --build\n```\n\nIf you've set `$TREE_SITTER_LIBDIR` as mentioned above, the shared object will be written to `$PWD/.lib/haskell.so`.\n\nAside from the generated `src/parser.c`, tree-sitter will also compile and link `src/scanner.c` into this object.\nThis file contains the _external scanner_, which is a custom extension of the built-in lexer whose purpose is to handle\nlanguage constructs that cannot be expressed (efficiently) in the javascript grammar, like Haskell layouts.\n\n### WebAssembly\n\nThe parser can be compiled to WebAssembly as well, which requires `emscripten`:\n\n```\n$ tree-sitter build --wasm\n```\n\nThe resulting binary is written to `$PWD/tree-sitter-haskell.wasm`.\n\n## Testing the parser\n\nThe most fundamental test infrastructure for tree-sitter grammars consists of a set of code snippets with associated\nreference ASTs stored in `./test/corpus/*.txt`.\n\n```\n$ tree-sitter test\n```\n\nIndividual tests can be run by specifying (a substring of) their description with `-f`:\n\n```\n$ tree-sitter test -f 'module: exports empty'\n```\n\nThe project contains several other types of tests:\n\n- `test/parse/run.bash [update] [test names ...]` parses the files in `test/parse/*.hs` and compares the output with\n `test/parse/*.target`.\n If `update` is specified as the first argument, it will update the `.target` file for the first failing test.\n\n- `test/query/run.bash [update] [test names ...]` parses the files in `test/query/*.hs`, applies the queries in\n `test/query/*.query` and compares the output with `test/query/*.target`, similar to `test/parse`.\n\n- `test/rust/parse-test.rs` contains a few tests that use tree-sitter's Rust API to extract the test ranges for\n terminals in a slightly more convenient way.\n This requires `cargo` to be installed, and can be executed with `cargo test` (which also runs the tests in\n `bindings/rust`).\n\n- `test/parse-libs [wasm]` clones a set of Haskell libraries to `test/libs` and parses the entire codebase.\n When invoked as `test/parse-libs wasm`, it will use the WebAssembly parser.\n This requires `bc` to be installed.\n\n- `test/parse-lib name [wasm]` parses only the library `name` in that directory (without cloning the repository).\n\n### Debugging\n\nThe shared library built by `tree-sitter test` includes debug symbols, so if the scanner segfaults you can just run\n`coredumpctl debug` to inspect the backtrace and memory:\n\n```\nnewline_lookahead () at src/scanner.c:2583\n2583 ((Newline *) 0)->indent = 5;\n(gdb) bt\n#0 newline_lookahead () at src/scanner.c:2583\n#1 0x00007ffff7a0740e in newline_start () at src/scanner.c:2604\n#2 scan () at src/scanner.c:2646\n#3 eval () at src/scanner.c:2684\n#4 tree_sitter_haskell_external_scanner_scan (payload=<optimized out>, lexer=<optimized out>,\n valid_symbols=<optimized out>) at src/scanner.c:2724\n#5 0x0000555555772488 in ts_parser.lex ()\n```\n\nFor more control, launch `gdb tree-sitter` and start the process with `run test -f 'some test'`, and set a breakpoint\nwith `break tree_sitter_haskell_external_scanner_scan`.\n\nTo disable optimizations, run `tree-sitter test --debug-build`.\n\n#### Tracing\n\nThe `test` and `parse` commands offer two modes for obtaining detailed information about the parsing process.\n\nWith `tree-sitter test --debug`, every lexer step and shift/reduce action is printed to stderr.\n\nWith `tree-sitter test --debug-graph`, the CLI will generate an HTML file showing a graph representation of every step.\nThis requires `graphviz` to be installed.\n\n[tree-sitter]: https://github.com/tree-sitter/tree-sitter\n[ref]: https://www.haskell.org/onlinereport/haskell2010/haskellch10.html\n[ext]: https://downloads.haskell.org/~ghc/latest/docs/html/users_guide/exts/table.html\n[cli]: https://github.com/tree-sitter/tree-sitter/tree/master/cli\n[grammar-docs]: https://tree-sitter.github.io/tree-sitter/creating-parsers#writing-the-grammar\n",
"bugtrack_url": null,
"license": "MIT",
"summary": "Haskell grammar for tree-sitter",
"version": "0.21.0",
"project_urls": {
"Homepage": "https://github.com/tree-sitter/tree-sitter-haskell"
},
"split_keywords": [
"incremental",
" parsing",
" tree-sitter",
" haskell"
],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "ae33f163583faeccbd619171383f28cc4f41262c85b54c089b51754c87033f5f",
"md5": "989f4e60323d06040c6815761e1309ec",
"sha256": "137092e30bc1fc836ad1f4102bcd1abcfd020b4d1c1f080c040f9cf83f19873d"
},
"downloads": -1,
"filename": "tree_sitter_haskell-0.21.0-cp38-abi3-macosx_10_9_x86_64.whl",
"has_sig": false,
"md5_digest": "989f4e60323d06040c6815761e1309ec",
"packagetype": "bdist_wheel",
"python_version": "cp38",
"requires_python": ">=3.8",
"size": 325674,
"upload_time": "2024-05-05T07:24:56",
"upload_time_iso_8601": "2024-05-05T07:24:56.211087Z",
"url": "https://files.pythonhosted.org/packages/ae/33/f163583faeccbd619171383f28cc4f41262c85b54c089b51754c87033f5f/tree_sitter_haskell-0.21.0-cp38-abi3-macosx_10_9_x86_64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "6d844ebc5a400f712bf57d490c0fa4b28088a54e88ab7d1954cb260b16f33228",
"md5": "570b15ac2c0730d89e08b58d632bac4c",
"sha256": "0159bc8da0426c74a4b7906a9d1e035e05f894bdd45dc2e1eb0ae006cf1aa15b"
},
"downloads": -1,
"filename": "tree_sitter_haskell-0.21.0-cp38-abi3-macosx_11_0_arm64.whl",
"has_sig": false,
"md5_digest": "570b15ac2c0730d89e08b58d632bac4c",
"packagetype": "bdist_wheel",
"python_version": "cp38",
"requires_python": ">=3.8",
"size": 354962,
"upload_time": "2024-05-05T07:24:58",
"upload_time_iso_8601": "2024-05-05T07:24:58.178938Z",
"url": "https://files.pythonhosted.org/packages/6d/84/4ebc5a400f712bf57d490c0fa4b28088a54e88ab7d1954cb260b16f33228/tree_sitter_haskell-0.21.0-cp38-abi3-macosx_11_0_arm64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "c939ec2b4d25f959bf65006223b4e2824e08d4f3d6e0a762f2f03e0e68fecd6f",
"md5": "f89417eca11ae54cdca64f980e23f1a1",
"sha256": "babb6c5353a0808cae40ee482afc96b7659378b8d77b120cf6e968d7073ce7d2"
},
"downloads": -1,
"filename": "tree_sitter_haskell-0.21.0-cp38-abi3-manylinux_2_17_aarch64.manylinux2014_aarch64.whl",
"has_sig": false,
"md5_digest": "f89417eca11ae54cdca64f980e23f1a1",
"packagetype": "bdist_wheel",
"python_version": "cp38",
"requires_python": ">=3.8",
"size": 434217,
"upload_time": "2024-05-05T07:24:59",
"upload_time_iso_8601": "2024-05-05T07:24:59.376728Z",
"url": "https://files.pythonhosted.org/packages/c9/39/ec2b4d25f959bf65006223b4e2824e08d4f3d6e0a762f2f03e0e68fecd6f/tree_sitter_haskell-0.21.0-cp38-abi3-manylinux_2_17_aarch64.manylinux2014_aarch64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "a6391b176be4aca74c7ee035874676746cad19f94815ec67a7b616471bb36ff5",
"md5": "58a8536b9f1f3f83d434a27e4c43cde6",
"sha256": "86c588b51a070a4a00bcb3bb50f830d595e01c5cf4a6edb382bc5ec472fc431f"
},
"downloads": -1,
"filename": "tree_sitter_haskell-0.21.0-cp38-abi3-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"has_sig": false,
"md5_digest": "58a8536b9f1f3f83d434a27e4c43cde6",
"packagetype": "bdist_wheel",
"python_version": "cp38",
"requires_python": ">=3.8",
"size": 431175,
"upload_time": "2024-05-05T07:25:01",
"upload_time_iso_8601": "2024-05-05T07:25:01.026382Z",
"url": "https://files.pythonhosted.org/packages/a6/39/1b176be4aca74c7ee035874676746cad19f94815ec67a7b616471bb36ff5/tree_sitter_haskell-0.21.0-cp38-abi3-manylinux_2_17_x86_64.manylinux2014_x86_64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "e0bd7b21bb9755d35a748a374c81ca0aa8a046f66b2c71605ca6bd227e0e3189",
"md5": "1240bc97285e08dbc3964052946a3147",
"sha256": "ce2e69b1a7516274d1dabbdb2bfd8fbc7d7f00626d99de163ac36740b306a2e6"
},
"downloads": -1,
"filename": "tree_sitter_haskell-0.21.0-cp38-abi3-musllinux_1_1_aarch64.whl",
"has_sig": false,
"md5_digest": "1240bc97285e08dbc3964052946a3147",
"packagetype": "bdist_wheel",
"python_version": "cp38",
"requires_python": ">=3.8",
"size": 437712,
"upload_time": "2024-05-05T07:25:02",
"upload_time_iso_8601": "2024-05-05T07:25:02.411977Z",
"url": "https://files.pythonhosted.org/packages/e0/bd/7b21bb9755d35a748a374c81ca0aa8a046f66b2c71605ca6bd227e0e3189/tree_sitter_haskell-0.21.0-cp38-abi3-musllinux_1_1_aarch64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "6d84294a880747219be460eed54e603e4704ed69282286c37dedfe42d8076596",
"md5": "fc0ca0bf380dbedddba7dd6b1c7fcd0e",
"sha256": "7c2fa774a7083985ece920162f93f2946d5530e1af9b044ec9a4d69d203a9211"
},
"downloads": -1,
"filename": "tree_sitter_haskell-0.21.0-cp38-abi3-musllinux_1_1_x86_64.whl",
"has_sig": false,
"md5_digest": "fc0ca0bf380dbedddba7dd6b1c7fcd0e",
"packagetype": "bdist_wheel",
"python_version": "cp38",
"requires_python": ">=3.8",
"size": 436364,
"upload_time": "2024-05-05T07:25:03",
"upload_time_iso_8601": "2024-05-05T07:25:03.567886Z",
"url": "https://files.pythonhosted.org/packages/6d/84/294a880747219be460eed54e603e4704ed69282286c37dedfe42d8076596/tree_sitter_haskell-0.21.0-cp38-abi3-musllinux_1_1_x86_64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "528b75e24ec4d4f179b4a787f4c2581bd53cabbb2fbfc08d4235f170d092d101",
"md5": "d3278336e351a301ecd98dc8fab98a3a",
"sha256": "b0fc53ffd56e3bee58a3e2b0da4fdb583c3a3ea3129ea8faf2900ccf1f8880ed"
},
"downloads": -1,
"filename": "tree_sitter_haskell-0.21.0-cp38-abi3-win_amd64.whl",
"has_sig": false,
"md5_digest": "d3278336e351a301ecd98dc8fab98a3a",
"packagetype": "bdist_wheel",
"python_version": "cp38",
"requires_python": ">=3.8",
"size": 319338,
"upload_time": "2024-05-05T07:25:05",
"upload_time_iso_8601": "2024-05-05T07:25:05.390058Z",
"url": "https://files.pythonhosted.org/packages/52/8b/75e24ec4d4f179b4a787f4c2581bd53cabbb2fbfc08d4235f170d092d101/tree_sitter_haskell-0.21.0-cp38-abi3-win_amd64.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "a818fabe2c1ef465e51d4e6c2d942b3bc1f48010273afafcd31e0c95c0b43d0f",
"md5": "2fd1b37e44a242354d88c49885bc9fc4",
"sha256": "008d1cee4efbe5e64c77132b6daadf9a71e38c24d0c40277af2d6c0b2e5c3f6b"
},
"downloads": -1,
"filename": "tree-sitter-haskell-0.21.0.tar.gz",
"has_sig": false,
"md5_digest": "2fd1b37e44a242354d88c49885bc9fc4",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.8",
"size": 827706,
"upload_time": "2024-05-05T07:25:06",
"upload_time_iso_8601": "2024-05-05T07:25:06.691623Z",
"url": "https://files.pythonhosted.org/packages/a8/18/fabe2c1ef465e51d4e6c2d942b3bc1f48010273afafcd31e0c95c0b43d0f/tree-sitter-haskell-0.21.0.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-05-05 07:25:06",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "tree-sitter",
"github_project": "tree-sitter-haskell",
"travis_ci": false,
"coveralls": false,
"github_actions": true,
"lcname": "tree-sitter-haskell"
}
JSON
