mirror of https://github.com/Wilfred/difftastic/
Merge pull request #659 from hugo-vrijswijk/update-scala-treesitter
update scala treesitterpull/731/head
Wilfred Hughes
GitHub
commit
954979b19f
@ -0,0 +1,39 @@
|
||||
root = true
|
||||
|
||||
[*]
|
||||
charset = utf-8
|
||||
end_of_line = lf
|
||||
insert_final_newline = true
|
||||
trim_trailing_whitespace = true
|
||||
|
||||
[*.{json,toml,yml,gyp}]
|
||||
indent_style = space
|
||||
indent_size = 2
|
||||
|
||||
[*.js]
|
||||
indent_style = space
|
||||
indent_size = 2
|
||||
|
||||
[*.rs]
|
||||
indent_style = space
|
||||
indent_size = 4
|
||||
|
||||
[*.{c,cc,h}]
|
||||
indent_style = space
|
||||
indent_size = 4
|
||||
|
||||
[*.{py,pyi}]
|
||||
indent_style = space
|
||||
indent_size = 4
|
||||
|
||||
[*.swift]
|
||||
indent_style = space
|
||||
indent_size = 4
|
||||
|
||||
[*.go]
|
||||
indent_style = tab
|
||||
indent_size = 8
|
||||
|
||||
[Makefile]
|
||||
indent_style = tab
|
||||
indent_size = 8
|
||||
@ -0,0 +1,112 @@
|
||||
VERSION := 0.0.1
|
||||
|
||||
LANGUAGE_NAME := tree-sitter-scala
|
||||
|
||||
# repository
|
||||
SRC_DIR := src
|
||||
|
||||
PARSER_REPO_URL := $(shell git -C $(SRC_DIR) remote get-url origin 2>/dev/null)
|
||||
|
||||
ifeq ($(PARSER_URL),)
|
||||
PARSER_URL := $(subst .git,,$(PARSER_REPO_URL))
|
||||
ifeq ($(shell echo $(PARSER_URL) | grep '^[a-z][-+.0-9a-z]*://'),)
|
||||
PARSER_URL := $(subst :,/,$(PARSER_URL))
|
||||
PARSER_URL := $(subst git@,https://,$(PARSER_URL))
|
||||
endif
|
||||
endif
|
||||
|
||||
TS ?= tree-sitter
|
||||
|
||||
# ABI versioning
|
||||
SONAME_MAJOR := $(word 1,$(subst ., ,$(VERSION)))
|
||||
SONAME_MINOR := $(word 2,$(subst ., ,$(VERSION)))
|
||||
|
||||
# install directory layout
|
||||
PREFIX ?= /usr/local
|
||||
INCLUDEDIR ?= $(PREFIX)/include
|
||||
LIBDIR ?= $(PREFIX)/lib
|
||||
PCLIBDIR ?= $(LIBDIR)/pkgconfig
|
||||
|
||||
# source/object files
|
||||
PARSER := $(SRC_DIR)/parser.c
|
||||
EXTRAS := $(filter-out $(PARSER),$(wildcard $(SRC_DIR)/*.c))
|
||||
OBJS := $(patsubst %.c,%.o,$(PARSER) $(EXTRAS))
|
||||
|
||||
# flags
|
||||
ARFLAGS ?= rcs
|
||||
override CFLAGS += -I$(SRC_DIR) -std=c11 -fPIC
|
||||
|
||||
# OS-specific bits
|
||||
ifeq ($(OS),Windows_NT)
|
||||
$(error "Windows is not supported")
|
||||
else ifeq ($(shell uname),Darwin)
|
||||
SOEXT = dylib
|
||||
SOEXTVER_MAJOR = $(SONAME_MAJOR).dylib
|
||||
SOEXTVER = $(SONAME_MAJOR).$(SONAME_MINOR).dylib
|
||||
LINKSHARED := $(LINKSHARED)-dynamiclib -Wl,
|
||||
ifneq ($(ADDITIONAL_LIBS),)
|
||||
LINKSHARED := $(LINKSHARED)$(ADDITIONAL_LIBS),
|
||||
endif
|
||||
LINKSHARED := $(LINKSHARED)-install_name,$(LIBDIR)/lib$(LANGUAGE_NAME).$(SONAME_MAJOR).dylib,-rpath,@executable_path/../Frameworks
|
||||
else
|
||||
SOEXT = so
|
||||
SOEXTVER_MAJOR = so.$(SONAME_MAJOR)
|
||||
SOEXTVER = so.$(SONAME_MAJOR).$(SONAME_MINOR)
|
||||
LINKSHARED := $(LINKSHARED)-shared -Wl,
|
||||
ifneq ($(ADDITIONAL_LIBS),)
|
||||
LINKSHARED := $(LINKSHARED)$(ADDITIONAL_LIBS)
|
||||
endif
|
||||
LINKSHARED := $(LINKSHARED)-soname,lib$(LANGUAGE_NAME).so.$(SONAME_MAJOR)
|
||||
endif
|
||||
ifneq ($(filter $(shell uname),FreeBSD NetBSD DragonFly),)
|
||||
PCLIBDIR := $(PREFIX)/libdata/pkgconfig
|
||||
endif
|
||||
|
||||
all: lib$(LANGUAGE_NAME).a lib$(LANGUAGE_NAME).$(SOEXT) $(LANGUAGE_NAME).pc
|
||||
|
||||
lib$(LANGUAGE_NAME).a: $(OBJS)
|
||||
$(AR) $(ARFLAGS) $@ $^
|
||||
|
||||
lib$(LANGUAGE_NAME).$(SOEXT): $(OBJS)
|
||||
$(CC) $(LDFLAGS) $(LINKSHARED) $^ $(LDLIBS) -o $@
|
||||
ifneq ($(STRIP),)
|
||||
$(STRIP) $@
|
||||
endif
|
||||
|
||||
$(LANGUAGE_NAME).pc: bindings/c/$(LANGUAGE_NAME).pc.in
|
||||
sed -e 's|@URL@|$(PARSER_URL)|' \
|
||||
-e 's|@VERSION@|$(VERSION)|' \
|
||||
-e 's|@LIBDIR@|$(LIBDIR)|' \
|
||||
-e 's|@INCLUDEDIR@|$(INCLUDEDIR)|' \
|
||||
-e 's|@REQUIRES@|$(REQUIRES)|' \
|
||||
-e 's|@ADDITIONAL_LIBS@|$(ADDITIONAL_LIBS)|' \
|
||||
-e 's|=$(PREFIX)|=$${prefix}|' \
|
||||
-e 's|@PREFIX@|$(PREFIX)|' $< > $@
|
||||
|
||||
$(PARSER): $(SRC_DIR)/grammar.json
|
||||
$(TS) generate --no-bindings $^
|
||||
|
||||
install: all
|
||||
install -d '$(DESTDIR)$(INCLUDEDIR)'/tree_sitter '$(DESTDIR)$(PCLIBDIR)' '$(DESTDIR)$(LIBDIR)'
|
||||
install -m644 bindings/c/$(LANGUAGE_NAME).h '$(DESTDIR)$(INCLUDEDIR)'/tree_sitter/$(LANGUAGE_NAME).h
|
||||
install -m644 $(LANGUAGE_NAME).pc '$(DESTDIR)$(PCLIBDIR)'/$(LANGUAGE_NAME).pc
|
||||
install -m644 lib$(LANGUAGE_NAME).a '$(DESTDIR)$(LIBDIR)'/lib$(LANGUAGE_NAME).a
|
||||
install -m755 lib$(LANGUAGE_NAME).$(SOEXT) '$(DESTDIR)$(LIBDIR)'/lib$(LANGUAGE_NAME).$(SOEXTVER)
|
||||
ln -sf lib$(LANGUAGE_NAME).$(SOEXTVER) '$(DESTDIR)$(LIBDIR)'/lib$(LANGUAGE_NAME).$(SOEXTVER_MAJOR)
|
||||
ln -sf lib$(LANGUAGE_NAME).$(SOEXTVER_MAJOR) '$(DESTDIR)$(LIBDIR)'/lib$(LANGUAGE_NAME).$(SOEXT)
|
||||
|
||||
uninstall:
|
||||
$(RM) '$(DESTDIR)$(LIBDIR)'/lib$(LANGUAGE_NAME).a \
|
||||
'$(DESTDIR)$(LIBDIR)'/lib$(LANGUAGE_NAME).$(SOEXTVER) \
|
||||
'$(DESTDIR)$(LIBDIR)'/lib$(LANGUAGE_NAME).$(SOEXTVER_MAJOR) \
|
||||
'$(DESTDIR)$(LIBDIR)'/lib$(LANGUAGE_NAME).$(SOEXT) \
|
||||
'$(DESTDIR)$(INCLUDEDIR)'/tree_sitter/$(LANGUAGE_NAME).h \
|
||||
'$(DESTDIR)$(PCLIBDIR)'/$(LANGUAGE_NAME).pc
|
||||
|
||||
clean:
|
||||
$(RM) $(OBJS) $(LANGUAGE_NAME).pc lib$(LANGUAGE_NAME).a lib$(LANGUAGE_NAME).$(SOEXT)
|
||||
|
||||
test:
|
||||
$(TS) test
|
||||
|
||||
.PHONY: all install uninstall clean test
|
||||
@ -0,0 +1,16 @@
|
||||
#ifndef TREE_SITTER_SCALA_H_
|
||||
#define TREE_SITTER_SCALA_H_
|
||||
|
||||
typedef struct TSLanguage TSLanguage;
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
const TSLanguage *tree_sitter_scala(void);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif // TREE_SITTER_SCALA_H_
|
||||
@ -0,0 +1,11 @@
|
||||
prefix=@PREFIX@
|
||||
libdir=@LIBDIR@
|
||||
includedir=@INCLUDEDIR@
|
||||
|
||||
Name: tree-sitter-scala
|
||||
Description: Scala grammar for tree-sitter
|
||||
URL: @URL@
|
||||
Version: @VERSION@
|
||||
Requires: @REQUIRES@
|
||||
Libs: -L${libdir} @ADDITIONAL_LIBS@ -ltree-sitter-scala
|
||||
Cflags: -I${includedir}
|
||||
@ -0,0 +1,13 @@
|
||||
package tree_sitter_scala
|
||||
|
||||
// #cgo CFLAGS: -std=c11 -fPIC
|
||||
// #include "../../src/parser.c"
|
||||
// // NOTE: if your language has an external scanner, add it here.
|
||||
import "C"
|
||||
|
||||
import "unsafe"
|
||||
|
||||
// Get the tree-sitter Language for this grammar.
|
||||
func Language() unsafe.Pointer {
|
||||
return unsafe.Pointer(C.tree_sitter_scala())
|
||||
}
|
||||
@ -0,0 +1,15 @@
|
||||
package tree_sitter_scala_test
|
||||
|
||||
import (
|
||||
"testing"
|
||||
|
||||
tree_sitter "github.com/smacker/go-tree-sitter"
|
||||
"github.com/tree-sitter/tree-sitter-scala"
|
||||
)
|
||||
|
||||
func TestCanLoadGrammar(t *testing.T) {
|
||||
language := tree_sitter.NewLanguage(tree_sitter_scala.Language())
|
||||
if language == nil {
|
||||
t.Errorf("Error loading Scala grammar")
|
||||
}
|
||||
}
|
||||
@ -0,0 +1,5 @@
|
||||
module github.com/tree-sitter/tree-sitter-scala
|
||||
|
||||
go 1.22
|
||||
|
||||
require github.com/smacker/go-tree-sitter v0.0.0-20230720070738-0d0a9f78d8f8
|
||||
@ -1,28 +1,20 @@
|
||||
#include "tree_sitter/parser.h"
|
||||
#include <node.h>
|
||||
#include "nan.h"
|
||||
#include <napi.h>
|
||||
|
||||
using namespace v8;
|
||||
typedef struct TSLanguage TSLanguage;
|
||||
|
||||
extern "C" TSLanguage * tree_sitter_scala();
|
||||
extern "C" TSLanguage *tree_sitter_scala();
|
||||
|
||||
namespace {
|
||||
// "tree-sitter", "language" hashed with BLAKE2
|
||||
const napi_type_tag LANGUAGE_TYPE_TAG = {
|
||||
0x8AF2E5212AD58ABF, 0xD5006CAD83ABBA16
|
||||
};
|
||||
|
||||
NAN_METHOD(New) {}
|
||||
|
||||
void Init(Local<Object> exports, Local<Object> module) {
|
||||
Local<FunctionTemplate> tpl = Nan::New<FunctionTemplate>(New);
|
||||
tpl->SetClassName(Nan::New("Language").ToLocalChecked());
|
||||
tpl->InstanceTemplate()->SetInternalFieldCount(1);
|
||||
|
||||
Local<Function> constructor = Nan::GetFunction(tpl).ToLocalChecked();
|
||||
Local<Object> instance = constructor->NewInstance(Nan::GetCurrentContext()).ToLocalChecked();
|
||||
Nan::SetInternalFieldPointer(instance, 0, tree_sitter_scala());
|
||||
|
||||
Nan::Set(instance, Nan::New("name").ToLocalChecked(), Nan::New("scala").ToLocalChecked());
|
||||
Nan::Set(module, Nan::New("exports").ToLocalChecked(), instance);
|
||||
Napi::Object Init(Napi::Env env, Napi::Object exports) {
|
||||
exports["name"] = Napi::String::New(env, "scala");
|
||||
auto language = Napi::External<TSLanguage>::New(env, tree_sitter_scala());
|
||||
language.TypeTag(&LANGUAGE_TYPE_TAG);
|
||||
exports["language"] = language;
|
||||
return exports;
|
||||
}
|
||||
|
||||
NODE_MODULE(tree_sitter_scala_binding, Init)
|
||||
|
||||
} // namespace
|
||||
NODE_API_MODULE(tree_sitter_scala_binding, Init)
|
||||
|
||||
@ -0,0 +1,28 @@
|
||||
type BaseNode = {
|
||||
type: string;
|
||||
named: boolean;
|
||||
};
|
||||
|
||||
type ChildNode = {
|
||||
multiple: boolean;
|
||||
required: boolean;
|
||||
types: BaseNode[];
|
||||
};
|
||||
|
||||
type NodeInfo =
|
||||
| (BaseNode & {
|
||||
subtypes: BaseNode[];
|
||||
})
|
||||
| (BaseNode & {
|
||||
fields: { [name: string]: ChildNode };
|
||||
children: ChildNode[];
|
||||
});
|
||||
|
||||
type Language = {
|
||||
name: string;
|
||||
language: unknown;
|
||||
nodeTypeInfo: NodeInfo[];
|
||||
};
|
||||
|
||||
declare const language: Language;
|
||||
export = language;
|
||||
@ -0,0 +1,5 @@
|
||||
"Scala grammar for tree-sitter"
|
||||
|
||||
from ._binding import language
|
||||
|
||||
__all__ = ["language"]
|
||||
@ -0,0 +1 @@
|
||||
def language() -> int: ...
|
||||
@ -0,0 +1,27 @@
|
||||
#include <Python.h>
|
||||
|
||||
typedef struct TSLanguage TSLanguage;
|
||||
|
||||
TSLanguage *tree_sitter_scala(void);
|
||||
|
||||
static PyObject* _binding_language(PyObject *self, PyObject *args) {
|
||||
return PyLong_FromVoidPtr(tree_sitter_scala());
|
||||
}
|
||||
|
||||
static PyMethodDef methods[] = {
|
||||
{"language", _binding_language, METH_NOARGS,
|
||||
"Get the tree-sitter language for this grammar."},
|
||||
{NULL, NULL, 0, NULL}
|
||||
};
|
||||
|
||||
static struct PyModuleDef module = {
|
||||
.m_base = PyModuleDef_HEAD_INIT,
|
||||
.m_name = "_binding",
|
||||
.m_doc = NULL,
|
||||
.m_size = -1,
|
||||
.m_methods = methods
|
||||
};
|
||||
|
||||
PyMODINIT_FUNC PyInit__binding(void) {
|
||||
return PyModule_Create(&module);
|
||||
}
|
||||
@ -1,206 +0,0 @@
|
||||
=========================
|
||||
Alternative patterns
|
||||
=========================
|
||||
|
||||
val x = y match {
|
||||
case 1 | a => b
|
||||
case "c" | "d" | "e" => f
|
||||
}
|
||||
|
||||
---
|
||||
|
||||
(compilation_unit
|
||||
(val_definition
|
||||
(identifier)
|
||||
(match_expression (identifier) (case_block
|
||||
(case_clause
|
||||
(alternative_pattern (integer_literal) (identifier))
|
||||
(identifier))
|
||||
(case_clause
|
||||
(alternative_pattern
|
||||
(alternative_pattern (string) (string))
|
||||
(string))
|
||||
(identifier))))))
|
||||
|
||||
=========================
|
||||
Typed patterns
|
||||
=========================
|
||||
|
||||
val x = y match {
|
||||
case 1 : Int => 2
|
||||
case a : B with C => d
|
||||
case _: B | _: C => 3
|
||||
case Object.Constant => 3
|
||||
}
|
||||
|
||||
---
|
||||
|
||||
(compilation_unit
|
||||
(val_definition
|
||||
(identifier)
|
||||
(match_expression (identifier) (case_block
|
||||
(case_clause
|
||||
(typed_pattern (integer_literal) (type_identifier)) (integer_literal))
|
||||
(case_clause
|
||||
(typed_pattern (identifier) (compound_type (type_identifier) (type_identifier)))
|
||||
(identifier))
|
||||
(case_clause
|
||||
(alternative_pattern
|
||||
(typed_pattern (wildcard) (type_identifier))
|
||||
(typed_pattern (wildcard) (type_identifier)))
|
||||
(integer_literal))
|
||||
(case_clause
|
||||
(stable_identifier (identifier) (identifier))
|
||||
(integer_literal))))))
|
||||
|
||||
============================
|
||||
Tuple patterns
|
||||
============================
|
||||
|
||||
val (a, b) = if (c) (d, e) else (f, g)
|
||||
|
||||
val x = y match {
|
||||
case (A, B) => X
|
||||
}
|
||||
|
||||
---
|
||||
|
||||
(compilation_unit
|
||||
(val_definition
|
||||
(tuple_pattern (identifier) (identifier))
|
||||
(if_expression
|
||||
(parenthesized_expression (identifier))
|
||||
(tuple_expression (identifier) (identifier))
|
||||
(tuple_expression (identifier) (identifier))))
|
||||
(val_definition (identifier)
|
||||
(match_expression (identifier)
|
||||
(case_block
|
||||
(case_clause
|
||||
(tuple_pattern (identifier) (identifier)) (identifier))))))
|
||||
|
||||
============================
|
||||
Case class patterns
|
||||
============================
|
||||
|
||||
def showNotification(notification: Notification): String = {
|
||||
notification match {
|
||||
case Email(email, title, _) =>
|
||||
s"You got an email from $email with title: $title"
|
||||
case SMS(number, message) =>
|
||||
s"You got an SMS from $number! Message: $message"
|
||||
case VoiceRecording(name, link) =>
|
||||
s"you received a Voice Recording from $name! Click the link to hear it: $link"
|
||||
}
|
||||
}
|
||||
|
||||
---
|
||||
|
||||
(compilation_unit
|
||||
(function_definition
|
||||
(identifier)
|
||||
(parameters (parameter (identifier) (type_identifier)))
|
||||
(type_identifier)
|
||||
(block
|
||||
(match_expression (identifier) (case_block
|
||||
(case_clause
|
||||
(case_class_pattern (type_identifier) (identifier) (identifier) (wildcard))
|
||||
(interpolated_string_expression (identifier) (interpolated_string (interpolation (identifier)) (interpolation (identifier)))))
|
||||
(case_clause
|
||||
(case_class_pattern (type_identifier) (identifier) (identifier))
|
||||
(interpolated_string_expression (identifier) (interpolated_string (interpolation (identifier)) (interpolation (identifier)))))
|
||||
(case_clause
|
||||
(case_class_pattern (type_identifier) (identifier) (identifier))
|
||||
(interpolated_string_expression (identifier) (interpolated_string (interpolation (identifier)) (interpolation (identifier))))))))))
|
||||
|
||||
============================
|
||||
Infix patterns
|
||||
============================
|
||||
|
||||
def first(x: Seq[Int]) = x match {
|
||||
case e :+ _ => Some(e)
|
||||
case _ => None
|
||||
}
|
||||
|
||||
---
|
||||
|
||||
(compilation_unit
|
||||
(function_definition (identifier)
|
||||
(parameters (parameter (identifier) (generic_type (type_identifier) (type_arguments (type_identifier)))))
|
||||
(match_expression (identifier)
|
||||
(case_block
|
||||
(case_clause (infix_pattern (identifier) (operator_identifier) (wildcard))
|
||||
(call_expression (identifier) (arguments (identifier))))
|
||||
(case_clause (wildcard)
|
||||
(identifier))))))
|
||||
|
||||
============================
|
||||
Capture patterns
|
||||
============================
|
||||
|
||||
val x = y match {
|
||||
case a @ B(1) => a
|
||||
case b @ C(d @ (e @ X, _: Y)) => e
|
||||
case req @ (POST | GET) -> Root / "test" => 5
|
||||
case Array(a: Type, _@_*) => y
|
||||
}
|
||||
|
||||
---
|
||||
|
||||
(compilation_unit
|
||||
(val_definition
|
||||
(identifier)
|
||||
(match_expression
|
||||
(identifier)
|
||||
(case_block
|
||||
(case_clause
|
||||
(capture_pattern (identifier) (case_class_pattern (type_identifier) (integer_literal)))
|
||||
(identifier))
|
||||
(case_clause
|
||||
(capture_pattern (identifier)
|
||||
(case_class_pattern (type_identifier)
|
||||
(capture_pattern (identifier)
|
||||
(tuple_pattern
|
||||
(capture_pattern (identifier) (identifier))
|
||||
(typed_pattern (wildcard) (type_identifier))))))
|
||||
(identifier))
|
||||
(case_clause
|
||||
(infix_pattern
|
||||
(infix_pattern
|
||||
(capture_pattern (identifier)
|
||||
(tuple_pattern (alternative_pattern (identifier) (identifier))))
|
||||
(operator_identifier) (identifier)) (operator_identifier) (string))
|
||||
(integer_literal))
|
||||
(case_clause
|
||||
(case_class_pattern
|
||||
(type_identifier)
|
||||
(typed_pattern
|
||||
(identifier)
|
||||
(type_identifier))
|
||||
(repeat_pattern
|
||||
(capture_pattern
|
||||
(wildcard)
|
||||
(wildcard))))
|
||||
(identifier))))))
|
||||
|
||||
============================
|
||||
Quoted patterns (Scala 3 syntax)
|
||||
============================
|
||||
|
||||
def foo =
|
||||
x match
|
||||
case '{ $boolExpr } => Some(true)
|
||||
case _ => None
|
||||
|
||||
---
|
||||
|
||||
(compilation_unit
|
||||
(function_definition (identifier)
|
||||
(indented_block
|
||||
(match_expression (identifier)
|
||||
(indented_cases
|
||||
(case_clause
|
||||
(quote_expression (identifier))
|
||||
(call_expression (identifier) (arguments (boolean_literal))))
|
||||
(case_clause (wildcard)
|
||||
(identifier)))))))
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
@ -0,0 +1,29 @@
|
||||
[build-system]
|
||||
requires = ["setuptools>=42", "wheel"]
|
||||
build-backend = "setuptools.build_meta"
|
||||
|
||||
[project]
|
||||
name = "tree-sitter-scala"
|
||||
description = "Scala grammar for tree-sitter"
|
||||
version = "0.0.1"
|
||||
keywords = ["incremental", "parsing", "tree-sitter", "scala"]
|
||||
classifiers = [
|
||||
"Intended Audience :: Developers",
|
||||
"License :: OSI Approved :: MIT License",
|
||||
"Topic :: Software Development :: Compilers",
|
||||
"Topic :: Text Processing :: Linguistic",
|
||||
"Typing :: Typed"
|
||||
]
|
||||
requires-python = ">=3.8"
|
||||
license.text = "MIT"
|
||||
readme = "README.md"
|
||||
|
||||
[project.urls]
|
||||
Homepage = "https://github.com/tree-sitter/tree-sitter-scala"
|
||||
|
||||
[project.optional-dependencies]
|
||||
core = ["tree-sitter~=0.21"]
|
||||
|
||||
[tool.cibuildwheel]
|
||||
build = "cp38-*"
|
||||
build-frontend = "build"
|
||||
@ -0,0 +1,60 @@
|
||||
from os.path import isdir, join
|
||||
from platform import system
|
||||
|
||||
from setuptools import Extension, find_packages, setup
|
||||
from setuptools.command.build import build
|
||||
from wheel.bdist_wheel import bdist_wheel
|
||||
|
||||
|
||||
class Build(build):
|
||||
def run(self):
|
||||
if isdir("queries"):
|
||||
dest = join(self.build_lib, "tree_sitter_scala", "queries")
|
||||
self.copy_tree("queries", dest)
|
||||
super().run()
|
||||
|
||||
|
||||
class BdistWheel(bdist_wheel):
|
||||
def get_tag(self):
|
||||
python, abi, platform = super().get_tag()
|
||||
if python.startswith("cp"):
|
||||
python, abi = "cp38", "abi3"
|
||||
return python, abi, platform
|
||||
|
||||
|
||||
setup(
|
||||
packages=find_packages("bindings/python"),
|
||||
package_dir={"": "bindings/python"},
|
||||
package_data={
|
||||
"tree_sitter_scala": ["*.pyi", "py.typed"],
|
||||
"tree_sitter_scala.queries": ["*.scm"],
|
||||
},
|
||||
ext_package="tree_sitter_scala",
|
||||
ext_modules=[
|
||||
Extension(
|
||||
name="_binding",
|
||||
sources=[
|
||||
"bindings/python/tree_sitter_scala/binding.c",
|
||||
"src/parser.c",
|
||||
# NOTE: if your language uses an external scanner, add it here.
|
||||
],
|
||||
extra_compile_args=[
|
||||
"-std=c11",
|
||||
] if system() != "Windows" else [
|
||||
"/std:c11",
|
||||
"/utf-8",
|
||||
],
|
||||
define_macros=[
|
||||
("Py_LIMITED_API", "0x03080000"),
|
||||
("PY_SSIZE_T_CLEAN", None)
|
||||
],
|
||||
include_dirs=["src"],
|
||||
py_limited_api=True,
|
||||
)
|
||||
],
|
||||
cmdclass={
|
||||
"build": Build,
|
||||
"bdist_wheel": BdistWheel
|
||||
},
|
||||
zip_safe=False
|
||||
)
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
@ -1,99 +0,0 @@
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdbool.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#ifdef DEBUG
|
||||
#define LOG(...) fprintf(stderr, __VA_ARGS__)
|
||||
#else
|
||||
#define LOG(...)
|
||||
#endif
|
||||
|
||||
// Total payload size is 1024 bytes max
|
||||
#define STACK_SIZE 100
|
||||
|
||||
typedef struct ScannerStack {
|
||||
int stack[STACK_SIZE];
|
||||
int top;
|
||||
int last_indentation_size;
|
||||
int last_newline_count;
|
||||
int last_column;
|
||||
} ScannerStack;
|
||||
|
||||
ScannerStack* createStack() {
|
||||
ScannerStack* ptr = (ScannerStack*) malloc(sizeof(ScannerStack));
|
||||
|
||||
ptr -> top = 0;
|
||||
ptr -> last_indentation_size = -1;
|
||||
ptr -> last_newline_count = 0;
|
||||
ptr -> last_column = -1;
|
||||
memset(ptr -> stack, STACK_SIZE, (0));
|
||||
|
||||
return ptr;
|
||||
}
|
||||
|
||||
bool isEmptyStack(ScannerStack *stack) { return stack->top == 0; }
|
||||
|
||||
int peekStack(ScannerStack *stack) {
|
||||
return isEmptyStack(stack) ? -1 : stack->stack[stack->top - 1];
|
||||
}
|
||||
|
||||
void pushStack(ScannerStack *stack, unsigned int value) {
|
||||
stack->top++;
|
||||
stack->stack[stack->top - 1] = value;
|
||||
}
|
||||
|
||||
int popStack(ScannerStack *stack) {
|
||||
if (isEmptyStack(stack))
|
||||
return -1;
|
||||
else {
|
||||
int result = peekStack(stack);
|
||||
stack->top--;
|
||||
|
||||
return result;
|
||||
}
|
||||
}
|
||||
|
||||
void printStack(ScannerStack *stack, char *msg) {
|
||||
LOG("%s Stack[top = %d; ", msg, stack->top);
|
||||
for (int i = 0; i < stack->top; i++) {
|
||||
LOG("%d | ", stack->stack[i]);
|
||||
}
|
||||
LOG("]\n");
|
||||
}
|
||||
|
||||
unsigned serialiseStack(ScannerStack *stack, char *buf) {
|
||||
int elements = isEmptyStack(stack) ? 0 : stack->top;
|
||||
if (elements < 0) {
|
||||
elements = 0;
|
||||
}
|
||||
unsigned result_length = (elements + 3) * sizeof(int);
|
||||
int *placement = (int *)buf;
|
||||
memcpy(placement, stack->stack, elements * sizeof(int));
|
||||
placement[elements] = stack->last_indentation_size;
|
||||
placement[elements + 1] = stack->last_newline_count;
|
||||
placement[elements + 2] = stack->last_column;
|
||||
|
||||
return result_length;
|
||||
}
|
||||
|
||||
void deserialiseStack(ScannerStack* stack, const char* buf, unsigned n) {
|
||||
if (n != 0) {
|
||||
int *intBuf = (int *)buf;
|
||||
|
||||
unsigned elements = n / sizeof(int) - 3;
|
||||
stack->top = elements;
|
||||
memcpy(stack->stack, intBuf, elements * sizeof(int));
|
||||
stack->last_indentation_size = intBuf[elements];
|
||||
stack->last_newline_count = intBuf[elements + 1];
|
||||
stack->last_column = intBuf[elements + 2];
|
||||
}
|
||||
}
|
||||
|
||||
void resetStack(ScannerStack *p) {
|
||||
p->top = 0;
|
||||
p->last_indentation_size = -1;
|
||||
p->last_newline_count = 0;
|
||||
p->last_column = -1;
|
||||
}
|
||||
@ -0,0 +1,54 @@
|
||||
#ifndef TREE_SITTER_ALLOC_H_
|
||||
#define TREE_SITTER_ALLOC_H_
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
// Allow clients to override allocation functions
|
||||
#ifdef TREE_SITTER_REUSE_ALLOCATOR
|
||||
|
||||
extern void *(*ts_current_malloc)(size_t);
|
||||
extern void *(*ts_current_calloc)(size_t, size_t);
|
||||
extern void *(*ts_current_realloc)(void *, size_t);
|
||||
extern void (*ts_current_free)(void *);
|
||||
|
||||
#ifndef ts_malloc
|
||||
#define ts_malloc ts_current_malloc
|
||||
#endif
|
||||
#ifndef ts_calloc
|
||||
#define ts_calloc ts_current_calloc
|
||||
#endif
|
||||
#ifndef ts_realloc
|
||||
#define ts_realloc ts_current_realloc
|
||||
#endif
|
||||
#ifndef ts_free
|
||||
#define ts_free ts_current_free
|
||||
#endif
|
||||
|
||||
#else
|
||||
|
||||
#ifndef ts_malloc
|
||||
#define ts_malloc malloc
|
||||
#endif
|
||||
#ifndef ts_calloc
|
||||
#define ts_calloc calloc
|
||||
#endif
|
||||
#ifndef ts_realloc
|
||||
#define ts_realloc realloc
|
||||
#endif
|
||||
#ifndef ts_free
|
||||
#define ts_free free
|
||||
#endif
|
||||
|
||||
#endif
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif // TREE_SITTER_ALLOC_H_
|
||||
@ -0,0 +1,290 @@
|
||||
#ifndef TREE_SITTER_ARRAY_H_
|
||||
#define TREE_SITTER_ARRAY_H_
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#include "./alloc.h"
|
||||
|
||||
#include <assert.h>
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#pragma warning(disable : 4101)
|
||||
#elif defined(__GNUC__) || defined(__clang__)
|
||||
#pragma GCC diagnostic push
|
||||
#pragma GCC diagnostic ignored "-Wunused-variable"
|
||||
#endif
|
||||
|
||||
#define Array(T) \
|
||||
struct { \
|
||||
T *contents; \
|
||||
uint32_t size; \
|
||||
uint32_t capacity; \
|
||||
}
|
||||
|
||||
/// Initialize an array.
|
||||
#define array_init(self) \
|
||||
((self)->size = 0, (self)->capacity = 0, (self)->contents = NULL)
|
||||
|
||||
/// Create an empty array.
|
||||
#define array_new() \
|
||||
{ NULL, 0, 0 }
|
||||
|
||||
/// Get a pointer to the element at a given `index` in the array.
|
||||
#define array_get(self, _index) \
|
||||
(assert((uint32_t)(_index) < (self)->size), &(self)->contents[_index])
|
||||
|
||||
/// Get a pointer to the first element in the array.
|
||||
#define array_front(self) array_get(self, 0)
|
||||
|
||||
/// Get a pointer to the last element in the array.
|
||||
#define array_back(self) array_get(self, (self)->size - 1)
|
||||
|
||||
/// Clear the array, setting its size to zero. Note that this does not free any
|
||||
/// memory allocated for the array's contents.
|
||||
#define array_clear(self) ((self)->size = 0)
|
||||
|
||||
/// Reserve `new_capacity` elements of space in the array. If `new_capacity` is
|
||||
/// less than the array's current capacity, this function has no effect.
|
||||
#define array_reserve(self, new_capacity) \
|
||||
_array__reserve((Array *)(self), array_elem_size(self), new_capacity)
|
||||
|
||||
/// Free any memory allocated for this array. Note that this does not free any
|
||||
/// memory allocated for the array's contents.
|
||||
#define array_delete(self) _array__delete((Array *)(self))
|
||||
|
||||
/// Push a new `element` onto the end of the array.
|
||||
#define array_push(self, element) \
|
||||
(_array__grow((Array *)(self), 1, array_elem_size(self)), \
|
||||
(self)->contents[(self)->size++] = (element))
|
||||
|
||||
/// Increase the array's size by `count` elements.
|
||||
/// New elements are zero-initialized.
|
||||
#define array_grow_by(self, count) \
|
||||
do { \
|
||||
if ((count) == 0) break; \
|
||||
_array__grow((Array *)(self), count, array_elem_size(self)); \
|
||||
memset((self)->contents + (self)->size, 0, (count) * array_elem_size(self)); \
|
||||
(self)->size += (count); \
|
||||
} while (0)
|
||||
|
||||
/// Append all elements from one array to the end of another.
|
||||
#define array_push_all(self, other) \
|
||||
array_extend((self), (other)->size, (other)->contents)
|
||||
|
||||
/// Append `count` elements to the end of the array, reading their values from the
|
||||
/// `contents` pointer.
|
||||
#define array_extend(self, count, contents) \
|
||||
_array__splice( \
|
||||
(Array *)(self), array_elem_size(self), (self)->size, \
|
||||
0, count, contents \
|
||||
)
|
||||
|
||||
/// Remove `old_count` elements from the array starting at the given `index`. At
|
||||
/// the same index, insert `new_count` new elements, reading their values from the
|
||||
/// `new_contents` pointer.
|
||||
#define array_splice(self, _index, old_count, new_count, new_contents) \
|
||||
_array__splice( \
|
||||
(Array *)(self), array_elem_size(self), _index, \
|
||||
old_count, new_count, new_contents \
|
||||
)
|
||||
|
||||
/// Insert one `element` into the array at the given `index`.
|
||||
#define array_insert(self, _index, element) \
|
||||
_array__splice((Array *)(self), array_elem_size(self), _index, 0, 1, &(element))
|
||||
|
||||
/// Remove one element from the array at the given `index`.
|
||||
#define array_erase(self, _index) \
|
||||
_array__erase((Array *)(self), array_elem_size(self), _index)
|
||||
|
||||
/// Pop the last element off the array, returning the element by value.
|
||||
#define array_pop(self) ((self)->contents[--(self)->size])
|
||||
|
||||
/// Assign the contents of one array to another, reallocating if necessary.
|
||||
#define array_assign(self, other) \
|
||||
_array__assign((Array *)(self), (const Array *)(other), array_elem_size(self))
|
||||
|
||||
/// Swap one array with another
|
||||
#define array_swap(self, other) \
|
||||
_array__swap((Array *)(self), (Array *)(other))
|
||||
|
||||
/// Get the size of the array contents
|
||||
#define array_elem_size(self) (sizeof *(self)->contents)
|
||||
|
||||
/// Search a sorted array for a given `needle` value, using the given `compare`
|
||||
/// callback to determine the order.
|
||||
///
|
||||
/// If an existing element is found to be equal to `needle`, then the `index`
|
||||
/// out-parameter is set to the existing value's index, and the `exists`
|
||||
/// out-parameter is set to true. Otherwise, `index` is set to an index where
|
||||
/// `needle` should be inserted in order to preserve the sorting, and `exists`
|
||||
/// is set to false.
|
||||
#define array_search_sorted_with(self, compare, needle, _index, _exists) \
|
||||
_array__search_sorted(self, 0, compare, , needle, _index, _exists)
|
||||
|
||||
/// Search a sorted array for a given `needle` value, using integer comparisons
|
||||
/// of a given struct field (specified with a leading dot) to determine the order.
|
||||
///
|
||||
/// See also `array_search_sorted_with`.
|
||||
#define array_search_sorted_by(self, field, needle, _index, _exists) \
|
||||
_array__search_sorted(self, 0, _compare_int, field, needle, _index, _exists)
|
||||
|
||||
/// Insert a given `value` into a sorted array, using the given `compare`
|
||||
/// callback to determine the order.
|
||||
#define array_insert_sorted_with(self, compare, value) \
|
||||
do { \
|
||||
unsigned _index, _exists; \
|
||||
array_search_sorted_with(self, compare, &(value), &_index, &_exists); \
|
||||
if (!_exists) array_insert(self, _index, value); \
|
||||
} while (0)
|
||||
|
||||
/// Insert a given `value` into a sorted array, using integer comparisons of
|
||||
/// a given struct field (specified with a leading dot) to determine the order.
|
||||
///
|
||||
/// See also `array_search_sorted_by`.
|
||||
#define array_insert_sorted_by(self, field, value) \
|
||||
do { \
|
||||
unsigned _index, _exists; \
|
||||
array_search_sorted_by(self, field, (value) field, &_index, &_exists); \
|
||||
if (!_exists) array_insert(self, _index, value); \
|
||||
} while (0)
|
||||
|
||||
// Private
|
||||
|
||||
typedef Array(void) Array;
|
||||
|
||||
/// This is not what you're looking for, see `array_delete`.
|
||||
static inline void _array__delete(Array *self) {
|
||||
if (self->contents) {
|
||||
ts_free(self->contents);
|
||||
self->contents = NULL;
|
||||
self->size = 0;
|
||||
self->capacity = 0;
|
||||
}
|
||||
}
|
||||
|
||||
/// This is not what you're looking for, see `array_erase`.
|
||||
static inline void _array__erase(Array *self, size_t element_size,
|
||||
uint32_t index) {
|
||||
assert(index < self->size);
|
||||
char *contents = (char *)self->contents;
|
||||
memmove(contents + index * element_size, contents + (index + 1) * element_size,
|
||||
(self->size - index - 1) * element_size);
|
||||
self->size--;
|
||||
}
|
||||
|
||||
/// This is not what you're looking for, see `array_reserve`.
|
||||
static inline void _array__reserve(Array *self, size_t element_size, uint32_t new_capacity) {
|
||||
if (new_capacity > self->capacity) {
|
||||
if (self->contents) {
|
||||
self->contents = ts_realloc(self->contents, new_capacity * element_size);
|
||||
} else {
|
||||
self->contents = ts_malloc(new_capacity * element_size);
|
||||
}
|
||||
self->capacity = new_capacity;
|
||||
}
|
||||
}
|
||||
|
||||
/// This is not what you're looking for, see `array_assign`.
|
||||
static inline void _array__assign(Array *self, const Array *other, size_t element_size) {
|
||||
_array__reserve(self, element_size, other->size);
|
||||
self->size = other->size;
|
||||
memcpy(self->contents, other->contents, self->size * element_size);
|
||||
}
|
||||
|
||||
/// This is not what you're looking for, see `array_swap`.
|
||||
static inline void _array__swap(Array *self, Array *other) {
|
||||
Array swap = *other;
|
||||
*other = *self;
|
||||
*self = swap;
|
||||
}
|
||||
|
||||
/// This is not what you're looking for, see `array_push` or `array_grow_by`.
|
||||
static inline void _array__grow(Array *self, uint32_t count, size_t element_size) {
|
||||
uint32_t new_size = self->size + count;
|
||||
if (new_size > self->capacity) {
|
||||
uint32_t new_capacity = self->capacity * 2;
|
||||
if (new_capacity < 8) new_capacity = 8;
|
||||
if (new_capacity < new_size) new_capacity = new_size;
|
||||
_array__reserve(self, element_size, new_capacity);
|
||||
}
|
||||
}
|
||||
|
||||
/// This is not what you're looking for, see `array_splice`.
|
||||
static inline void _array__splice(Array *self, size_t element_size,
|
||||
uint32_t index, uint32_t old_count,
|
||||
uint32_t new_count, const void *elements) {
|
||||
uint32_t new_size = self->size + new_count - old_count;
|
||||
uint32_t old_end = index + old_count;
|
||||
uint32_t new_end = index + new_count;
|
||||
assert(old_end <= self->size);
|
||||
|
||||
_array__reserve(self, element_size, new_size);
|
||||
|
||||
char *contents = (char *)self->contents;
|
||||
if (self->size > old_end) {
|
||||
memmove(
|
||||
contents + new_end * element_size,
|
||||
contents + old_end * element_size,
|
||||
(self->size - old_end) * element_size
|
||||
);
|
||||
}
|
||||
if (new_count > 0) {
|
||||
if (elements) {
|
||||
memcpy(
|
||||
(contents + index * element_size),
|
||||
elements,
|
||||
new_count * element_size
|
||||
);
|
||||
} else {
|
||||
memset(
|
||||
(contents + index * element_size),
|
||||
0,
|
||||
new_count * element_size
|
||||
);
|
||||
}
|
||||
}
|
||||
self->size += new_count - old_count;
|
||||
}
|
||||
|
||||
/// A binary search routine, based on Rust's `std::slice::binary_search_by`.
|
||||
/// This is not what you're looking for, see `array_search_sorted_with` or `array_search_sorted_by`.
|
||||
#define _array__search_sorted(self, start, compare, suffix, needle, _index, _exists) \
|
||||
do { \
|
||||
*(_index) = start; \
|
||||
*(_exists) = false; \
|
||||
uint32_t size = (self)->size - *(_index); \
|
||||
if (size == 0) break; \
|
||||
int comparison; \
|
||||
while (size > 1) { \
|
||||
uint32_t half_size = size / 2; \
|
||||
uint32_t mid_index = *(_index) + half_size; \
|
||||
comparison = compare(&((self)->contents[mid_index] suffix), (needle)); \
|
||||
if (comparison <= 0) *(_index) = mid_index; \
|
||||
size -= half_size; \
|
||||
} \
|
||||
comparison = compare(&((self)->contents[*(_index)] suffix), (needle)); \
|
||||
if (comparison == 0) *(_exists) = true; \
|
||||
else if (comparison < 0) *(_index) += 1; \
|
||||
} while (0)
|
||||
|
||||
/// Helper macro for the `_sorted_by` routines below. This takes the left (existing)
|
||||
/// parameter by reference in order to work with the generic sorting function above.
|
||||
#define _compare_int(a, b) ((int)*(a) - (int)(b))
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#pragma warning(default : 4101)
|
||||
#elif defined(__GNUC__) || defined(__clang__)
|
||||
#pragma GCC diagnostic pop
|
||||
#endif
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif // TREE_SITTER_ARRAY_H_
|
||||
@ -0,0 +1,334 @@
|
||||
================================================================================
|
||||
Alternative patterns
|
||||
================================================================================
|
||||
|
||||
val x = y match {
|
||||
case 1 | a => b
|
||||
case "c" | "d" | "e" => f
|
||||
}
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
|
||||
(compilation_unit
|
||||
(val_definition
|
||||
(identifier)
|
||||
(match_expression
|
||||
(identifier)
|
||||
(case_block
|
||||
(case_clause
|
||||
(alternative_pattern
|
||||
(integer_literal)
|
||||
(identifier))
|
||||
(identifier))
|
||||
(case_clause
|
||||
(alternative_pattern
|
||||
(alternative_pattern
|
||||
(string)
|
||||
(string))
|
||||
(string))
|
||||
(identifier))))))
|
||||
|
||||
================================================================================
|
||||
Typed patterns
|
||||
================================================================================
|
||||
|
||||
val x = y match {
|
||||
case 1 : Int => 2
|
||||
case a : B with C => d
|
||||
case _: B | _: C => 3
|
||||
case Object.Constant => 3
|
||||
}
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
|
||||
(compilation_unit
|
||||
(val_definition
|
||||
(identifier)
|
||||
(match_expression
|
||||
(identifier)
|
||||
(case_block
|
||||
(case_clause
|
||||
(typed_pattern
|
||||
(integer_literal)
|
||||
(type_identifier))
|
||||
(integer_literal))
|
||||
(case_clause
|
||||
(typed_pattern
|
||||
(identifier)
|
||||
(compound_type
|
||||
(type_identifier)
|
||||
(type_identifier)))
|
||||
(identifier))
|
||||
(case_clause
|
||||
(alternative_pattern
|
||||
(typed_pattern
|
||||
(wildcard)
|
||||
(type_identifier))
|
||||
(typed_pattern
|
||||
(wildcard)
|
||||
(type_identifier)))
|
||||
(integer_literal))
|
||||
(case_clause
|
||||
(stable_identifier
|
||||
(identifier)
|
||||
(identifier))
|
||||
(integer_literal))))))
|
||||
|
||||
================================================================================
|
||||
Tuple patterns
|
||||
================================================================================
|
||||
|
||||
val (a, b) = if (c) (d, e) else (f, g)
|
||||
|
||||
val x = y match {
|
||||
case (A, B) => X
|
||||
}
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
|
||||
(compilation_unit
|
||||
(val_definition
|
||||
(tuple_pattern
|
||||
(identifier)
|
||||
(identifier))
|
||||
(if_expression
|
||||
(parenthesized_expression
|
||||
(identifier))
|
||||
(tuple_expression
|
||||
(identifier)
|
||||
(identifier))
|
||||
(tuple_expression
|
||||
(identifier)
|
||||
(identifier))))
|
||||
(val_definition
|
||||
(identifier)
|
||||
(match_expression
|
||||
(identifier)
|
||||
(case_block
|
||||
(case_clause
|
||||
(tuple_pattern
|
||||
(identifier)
|
||||
(identifier))
|
||||
(identifier))))))
|
||||
|
||||
================================================================================
|
||||
Case class patterns
|
||||
================================================================================
|
||||
|
||||
def showNotification(notification: Notification): String = {
|
||||
notification match {
|
||||
case Email(email, title, _) =>
|
||||
s"You got an email from $email with title: $title"
|
||||
case SMS(number, message) =>
|
||||
s"You got an SMS from $number! Message: $message"
|
||||
case VoiceRecording(name, link) =>
|
||||
s"you received a Voice Recording from $name! Click the link to hear it: $link"
|
||||
}
|
||||
}
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
|
||||
(compilation_unit
|
||||
(function_definition
|
||||
(identifier)
|
||||
(parameters
|
||||
(parameter
|
||||
(identifier)
|
||||
(type_identifier)))
|
||||
(type_identifier)
|
||||
(block
|
||||
(match_expression
|
||||
(identifier)
|
||||
(case_block
|
||||
(case_clause
|
||||
(case_class_pattern
|
||||
(type_identifier)
|
||||
(identifier)
|
||||
(identifier)
|
||||
(wildcard))
|
||||
(interpolated_string_expression
|
||||
(identifier)
|
||||
(interpolated_string
|
||||
(interpolation
|
||||
(identifier))
|
||||
(interpolation
|
||||
(identifier)))))
|
||||
(case_clause
|
||||
(case_class_pattern
|
||||
(type_identifier)
|
||||
(identifier)
|
||||
(identifier))
|
||||
(interpolated_string_expression
|
||||
(identifier)
|
||||
(interpolated_string
|
||||
(interpolation
|
||||
(identifier))
|
||||
(interpolation
|
||||
(identifier)))))
|
||||
(case_clause
|
||||
(case_class_pattern
|
||||
(type_identifier)
|
||||
(identifier)
|
||||
(identifier))
|
||||
(interpolated_string_expression
|
||||
(identifier)
|
||||
(interpolated_string
|
||||
(interpolation
|
||||
(identifier))
|
||||
(interpolation
|
||||
(identifier))))))))))
|
||||
|
||||
================================================================================
|
||||
Infix patterns
|
||||
================================================================================
|
||||
|
||||
def first(x: Seq[Int]) = x match {
|
||||
case e :+ _ => Some(e)
|
||||
case _ => None
|
||||
}
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
|
||||
(compilation_unit
|
||||
(function_definition
|
||||
(identifier)
|
||||
(parameters
|
||||
(parameter
|
||||
(identifier)
|
||||
(generic_type
|
||||
(type_identifier)
|
||||
(type_arguments
|
||||
(type_identifier)))))
|
||||
(match_expression
|
||||
(identifier)
|
||||
(case_block
|
||||
(case_clause
|
||||
(infix_pattern
|
||||
(identifier)
|
||||
(operator_identifier)
|
||||
(wildcard))
|
||||
(call_expression
|
||||
(identifier)
|
||||
(arguments
|
||||
(identifier))))
|
||||
(case_clause
|
||||
(wildcard)
|
||||
(identifier))))))
|
||||
|
||||
================================================================================
|
||||
Capture patterns
|
||||
================================================================================
|
||||
|
||||
val x = y match {
|
||||
case a @ B(1) => a
|
||||
case b @ C(d @ (e @ X, _: Y)) => e
|
||||
case req @ (POST | GET) -> Root / "test" => 5
|
||||
case Array(a: Type, _@_*) => y
|
||||
}
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
|
||||
(compilation_unit
|
||||
(val_definition
|
||||
(identifier)
|
||||
(match_expression
|
||||
(identifier)
|
||||
(case_block
|
||||
(case_clause
|
||||
(capture_pattern
|
||||
(identifier)
|
||||
(case_class_pattern
|
||||
(type_identifier)
|
||||
(integer_literal)))
|
||||
(identifier))
|
||||
(case_clause
|
||||
(capture_pattern
|
||||
(identifier)
|
||||
(case_class_pattern
|
||||
(type_identifier)
|
||||
(capture_pattern
|
||||
(identifier)
|
||||
(tuple_pattern
|
||||
(capture_pattern
|
||||
(identifier)
|
||||
(identifier))
|
||||
(typed_pattern
|
||||
(wildcard)
|
||||
(type_identifier))))))
|
||||
(identifier))
|
||||
(case_clause
|
||||
(infix_pattern
|
||||
(infix_pattern
|
||||
(capture_pattern
|
||||
(identifier)
|
||||
(tuple_pattern
|
||||
(alternative_pattern
|
||||
(identifier)
|
||||
(identifier))))
|
||||
(operator_identifier)
|
||||
(identifier))
|
||||
(operator_identifier)
|
||||
(string))
|
||||
(integer_literal))
|
||||
(case_clause
|
||||
(case_class_pattern
|
||||
(type_identifier)
|
||||
(typed_pattern
|
||||
(identifier)
|
||||
(type_identifier))
|
||||
(repeat_pattern
|
||||
(capture_pattern
|
||||
(wildcard)
|
||||
(wildcard))))
|
||||
(identifier))))))
|
||||
|
||||
================================================================================
|
||||
Quoted patterns (Scala 3 syntax)
|
||||
================================================================================
|
||||
|
||||
def foo =
|
||||
x match
|
||||
case '{ $boolExpr } => Some(true)
|
||||
case _ => None
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
|
||||
(compilation_unit
|
||||
(function_definition
|
||||
(identifier)
|
||||
(indented_block
|
||||
(match_expression
|
||||
(identifier)
|
||||
(indented_cases
|
||||
(case_clause
|
||||
(quote_expression
|
||||
(identifier))
|
||||
(call_expression
|
||||
(identifier)
|
||||
(arguments
|
||||
(boolean_literal))))
|
||||
(case_clause
|
||||
(wildcard)
|
||||
(identifier)))))))
|
||||
|
||||
================================================================================
|
||||
Given pattern (Scala 3 syntax)
|
||||
================================================================================
|
||||
|
||||
for
|
||||
given Int <- Some(1)
|
||||
yield ()
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
|
||||
(compilation_unit
|
||||
(for_expression
|
||||
(enumerators
|
||||
(enumerator
|
||||
(given_pattern
|
||||
(type_identifier))
|
||||
(call_expression
|
||||
(identifier)
|
||||
(arguments
|
||||
(integer_literal)))))
|
||||
(unit)))
|
||||
@ -1,50 +0,0 @@
|
||||
#define DEBUG
|
||||
#include "../src/stack.h"
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int main() {
|
||||
ScannerStack *stack = createStack();
|
||||
|
||||
printStack(stack, "hello");
|
||||
|
||||
assert(isEmptyStack(stack));
|
||||
|
||||
pushStack(stack, 27);
|
||||
assert(!isEmptyStack(stack));
|
||||
assert(peekStack(stack) == 27);
|
||||
|
||||
pushStack(stack, 42);
|
||||
assert(!isEmptyStack(stack));
|
||||
assert(peekStack(stack) == 42);
|
||||
|
||||
assert(popStack(stack) == 42);
|
||||
assert(peekStack(stack) == 27);
|
||||
|
||||
assert(popStack(stack) == 27);
|
||||
assert(peekStack(stack) == -1);
|
||||
assert(isEmptyStack(stack));
|
||||
|
||||
char *buf = malloc(1024);
|
||||
|
||||
for (int i = 0; i < 100; i++) {
|
||||
pushStack(stack, i);
|
||||
}
|
||||
|
||||
assert(serialiseStack(stack, buf) == sizeof(int) * 103);
|
||||
|
||||
ScannerStack *newStack = createStack();
|
||||
|
||||
deserialiseStack(newStack, buf, sizeof(int) * 103);
|
||||
assert(newStack -> top == 100);
|
||||
assert(popStack(newStack) == 99);
|
||||
|
||||
resetStack(newStack);
|
||||
|
||||
assert(isEmptyStack(newStack));
|
||||
|
||||
printStack(stack, "hello");
|
||||
printStack(newStack, "hello");
|
||||
return 0;
|
||||
}
|
||||
Loading…
Reference in New Issue