shadowfacts
/
tree-sitter-elixir
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Wording fixes

This commit is contained in:
Jonatan Kłosko 2021-09-30 16:44:26 +02:00
parent d7f4f08a81
commit 3817c5f986
1 changed files with 5 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
docs/parser.md
View File

@ -17,15 +17,15 @@ end
As opposed to other languages, core constructs like `def`, `if` and `for` are not As opposed to other languages, core constructs like `def`, `if` and `for` are not
particularly special either, since they are itself regular functions (or macros rather). particularly special either, since they are itself regular functions (or macros rather).
Consequently they can be used "improperly" in a quoted expression, as shown above. As a result, these constructs can be used "improperly" in a quoted expression, as shown above.
Consequently, to correctly parse all Elixir code, we need the AST to closely match Consequently, to correctly parse all Elixir code, we need the AST to closely match
the Elixir AST. See [Elixir / Syntax reference](https://hexdocs.pm/elixir/syntax-reference.html) the Elixir AST. See [Elixir / Syntax reference](https://hexdocs.pm/elixir/syntax-reference.html)
for more details. for more details.
Whenever possible possible, we try using a more specific nodes (like binary/unary operator), Whenever possible, we try using a more specific nodes (like binary/unary operator), but only
but only to the extent that doesn't lose on generality. To get a sense of what the AST looks to the extent that doesn't lose on generality. To get a sense of what the AST looks like, have
like, have a look at the tests in `test/corpus/`. a look at the tests in `test/corpus/`.
## Getting started with Tree-sitter ## Getting started with Tree-sitter
@ -155,9 +155,6 @@ a +b
In the first three expressions `+` is a binary operator, while in the last one In the first three expressions `+` is a binary operator, while in the last one
`+` is an unary operator referring to local call argument. `+` is an unary operator referring to local call argument.
To correctly tokenize all the cases, we have a special `_before_unary_operator` empty
token and use external scanner to tokenize
To correctly tokenize all cases we use external scanner to tokenize a special empty To correctly tokenize all cases we use external scanner to tokenize a special empty
token (`_before_unary_operator`) when the spacing matches `a +b`, which forces the token (`_before_unary_operator`) when the spacing matches `a +b`, which forces the
parser to pick the unary operator path. parser to pick the unary operator path.
@ -166,7 +163,7 @@ parser to pick the unary operator path.
The `not in` operator may have an arbitrary inline whitespace between `not` and `in`. The `not in` operator may have an arbitrary inline whitespace between `not` and `in`.
We cannot use a regular expressoin like `/not[ \t]+in/`, because it would also match We cannot use a regular expression like `/not[ \t]+in/`, because it would also match
in expressions like `a not inn` as the longest matching token. in expressions like `a not inn` as the longest matching token.
A possible solution could be `seq("not", "in")` with dynamic conflict resolution, but A possible solution could be `seq("not", "in")` with dynamic conflict resolution, but