From f2e9e3b3f242a0cd5694ba57900bca498d9dfcf2 Mon Sep 17 00:00:00 2001 From: Max Brunsfeld Date: Mon, 2 Mar 2020 09:38:25 -0800 Subject: [PATCH] docs: Link to semantic dir instead of codegen PR --- docs/section-2-using-parsers.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/section-2-using-parsers.md b/docs/section-2-using-parsers.md index 03dd294e..15cadff6 100644 --- a/docs/section-2-using-parsers.md +++ b/docs/section-2-using-parsers.md @@ -585,7 +585,7 @@ This function will return `false` when there are no more matches. Otherwise, it In languages with static typing, it can be helpful for syntax trees to provide specific type information about individual syntax nodes. Tree-sitter makes this information available via a generated file called `node-types.json`. This *node types* file provides structured data about every possible syntax node in a grammar. -You can use this data to generate type declarations in statically-typed programming languages. For example, GitHub's [Semantic](https://github.com/github/semantic) uses these node types files to [generate Haskell data types](https://github.com/github/semantic/pull/448) for every possible syntax node, which allows for code analysis algorithms to be structurally verified by the Haskell type system. +You can use this data to generate type declarations in statically-typed programming languages. For example, GitHub's [Semantic](https://github.com/github/semantic) uses these node types files to [generate Haskell data types](https://github.com/github/semantic/tree/master/semantic-ast) for every possible syntax node, which allows for code analysis algorithms to be structurally verified by the Haskell type system. The node types file contains an array of objects, each of which describes a particular type of syntax node using the following entries: