v0.2: Pico-8 Lua dialect grammar and language
Reorganize into grammars/<name>/ subdirs ( Zed's [grammars.*] supports a `path` field, so both grammars ship from this repo without a sibling- repo split ). Vendor tree-sitter-lua as the fork base for tree-sitter- pico8-lua; upstream MIT license preserved at grammars/pico-8-lua/ UPSTREAM-LICENSE.md. Dialect features added: != as ~= alias, \ integer divide, ^^ binary xor, >>> / <<> / >>< shifts and rotates, compound-assignment statements, memory peek prefixes @ % $ (% coexists with binary modulo), single-line `if (cond) stmt [else stmt]` and `while (cond) stmt`, statement-level print shorthand ?, and `#include path` directives. Identifier rule no longer accepts ! ? @ $ ( upstream did ). Pico-8 Lua language ( languages/pico-8-lua/, suffix .p8lua ) ships highlights with the full ~110 PICO-8 builtins as @function.builtin. The cart injection now hands __lua__ bodies to pico-8-lua, so .p8 carts and bare .p8lua files share the dialect-aware grammar. Examples updated to exercise the dialect end-to-end. Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
This commit is contained in:
@@ -0,0 +1,74 @@
|
||||
/**
|
||||
* tree-sitter grammar for the PICO-8 .p8 cartridge text format.
|
||||
*
|
||||
* The .p8 format is a flat text container divided into named sections
|
||||
* delimited by lines of the form `__name__`. The first section is
|
||||
* always `__lua__` and contains the cart's Lua source; the remaining
|
||||
* sections (`__gfx__`, `__gff__`, `__label__`, `__map__`, `__sfx__`,
|
||||
* `__music__`) hold hex-encoded asset data. The file begins with a
|
||||
* fixed magic header line and a `version N` line.
|
||||
*
|
||||
* This grammar is intentionally minimal: it parses the section
|
||||
* structure and exposes each section's body as a single named node
|
||||
* so that injection queries (see languages/pico8-cart/injections.scm)
|
||||
* can hand the contents off to other languages — most importantly
|
||||
* Lua for the `__lua__` section.
|
||||
*/
|
||||
|
||||
module.exports = grammar({
|
||||
name: 'p8_cart',
|
||||
|
||||
// Whitespace is significant inside hex sections, so we don't skip it.
|
||||
extras: $ => [],
|
||||
|
||||
rules: {
|
||||
cartridge: $ => seq(
|
||||
optional($.header),
|
||||
optional($.version),
|
||||
repeat($.section),
|
||||
),
|
||||
|
||||
header: $ => /pico-8 cartridge \/\/[^\n]*\n/,
|
||||
version: $ => /version[ \t]+\d+\n/,
|
||||
|
||||
section: $ => choice(
|
||||
$.lua_section,
|
||||
$.gfx_section,
|
||||
$.gff_section,
|
||||
$.label_section,
|
||||
$.map_section,
|
||||
$.sfx_section,
|
||||
$.music_section,
|
||||
$.unknown_section,
|
||||
),
|
||||
|
||||
lua_section: $ => seq($.lua_marker, optional($.lua_content)),
|
||||
gfx_section: $ => seq($.gfx_marker, optional($.body)),
|
||||
gff_section: $ => seq($.gff_marker, optional($.body)),
|
||||
label_section: $ => seq($.label_marker, optional($.body)),
|
||||
map_section: $ => seq($.map_marker, optional($.body)),
|
||||
sfx_section: $ => seq($.sfx_marker, optional($.body)),
|
||||
music_section: $ => seq($.music_marker, optional($.body)),
|
||||
unknown_section: $ => seq($.section_marker, optional($.body)),
|
||||
|
||||
lua_marker: $ => token(prec(2, '__lua__\n')),
|
||||
gfx_marker: $ => token(prec(2, '__gfx__\n')),
|
||||
gff_marker: $ => token(prec(2, '__gff__\n')),
|
||||
label_marker: $ => token(prec(2, '__label__\n')),
|
||||
map_marker: $ => token(prec(2, '__map__\n')),
|
||||
sfx_marker: $ => token(prec(2, '__sfx__\n')),
|
||||
music_marker: $ => token(prec(2, '__music__\n')),
|
||||
section_marker: $ => token(prec(1, /__[a-z][a-z0-9_]*__\n/)),
|
||||
|
||||
lua_content: $ => repeat1($.line),
|
||||
body: $ => repeat1($.line),
|
||||
|
||||
// A single physical line. The lexer prefers section markers over
|
||||
// generic lines via the precedence above, so a line that happens
|
||||
// to be exactly `__name__\n` will tokenize as a marker, not a line.
|
||||
line: $ => choice(
|
||||
token(prec(0, /[^\n]*\n/)),
|
||||
token(prec(0, /[^\n]+/)), // final line with no trailing newline
|
||||
),
|
||||
},
|
||||
});
|
||||
@@ -0,0 +1,390 @@
|
||||
{
|
||||
"$schema": "https://tree-sitter.github.io/tree-sitter/assets/schemas/grammar.schema.json",
|
||||
"name": "p8_cart",
|
||||
"rules": {
|
||||
"cartridge": {
|
||||
"type": "SEQ",
|
||||
"members": [
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "header"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
},
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "version"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
},
|
||||
{
|
||||
"type": "REPEAT",
|
||||
"content": {
|
||||
"type": "SYMBOL",
|
||||
"name": "section"
|
||||
}
|
||||
}
|
||||
]
|
||||
},
|
||||
"header": {
|
||||
"type": "PATTERN",
|
||||
"value": "pico-8 cartridge \\/\\/[^\\n]*\\n"
|
||||
},
|
||||
"version": {
|
||||
"type": "PATTERN",
|
||||
"value": "version[ \\t]+\\d+\\n"
|
||||
},
|
||||
"section": {
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "lua_section"
|
||||
},
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "gfx_section"
|
||||
},
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "gff_section"
|
||||
},
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "label_section"
|
||||
},
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "map_section"
|
||||
},
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "sfx_section"
|
||||
},
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "music_section"
|
||||
},
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "unknown_section"
|
||||
}
|
||||
]
|
||||
},
|
||||
"lua_section": {
|
||||
"type": "SEQ",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "lua_marker"
|
||||
},
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "lua_content"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
},
|
||||
"gfx_section": {
|
||||
"type": "SEQ",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "gfx_marker"
|
||||
},
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "body"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
},
|
||||
"gff_section": {
|
||||
"type": "SEQ",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "gff_marker"
|
||||
},
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "body"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
},
|
||||
"label_section": {
|
||||
"type": "SEQ",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "label_marker"
|
||||
},
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "body"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
},
|
||||
"map_section": {
|
||||
"type": "SEQ",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "map_marker"
|
||||
},
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "body"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
},
|
||||
"sfx_section": {
|
||||
"type": "SEQ",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "sfx_marker"
|
||||
},
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "body"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
},
|
||||
"music_section": {
|
||||
"type": "SEQ",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "music_marker"
|
||||
},
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "body"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
},
|
||||
"unknown_section": {
|
||||
"type": "SEQ",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "section_marker"
|
||||
},
|
||||
{
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "SYMBOL",
|
||||
"name": "body"
|
||||
},
|
||||
{
|
||||
"type": "BLANK"
|
||||
}
|
||||
]
|
||||
}
|
||||
]
|
||||
},
|
||||
"lua_marker": {
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 2,
|
||||
"content": {
|
||||
"type": "STRING",
|
||||
"value": "__lua__\n"
|
||||
}
|
||||
}
|
||||
},
|
||||
"gfx_marker": {
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 2,
|
||||
"content": {
|
||||
"type": "STRING",
|
||||
"value": "__gfx__\n"
|
||||
}
|
||||
}
|
||||
},
|
||||
"gff_marker": {
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 2,
|
||||
"content": {
|
||||
"type": "STRING",
|
||||
"value": "__gff__\n"
|
||||
}
|
||||
}
|
||||
},
|
||||
"label_marker": {
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 2,
|
||||
"content": {
|
||||
"type": "STRING",
|
||||
"value": "__label__\n"
|
||||
}
|
||||
}
|
||||
},
|
||||
"map_marker": {
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 2,
|
||||
"content": {
|
||||
"type": "STRING",
|
||||
"value": "__map__\n"
|
||||
}
|
||||
}
|
||||
},
|
||||
"sfx_marker": {
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 2,
|
||||
"content": {
|
||||
"type": "STRING",
|
||||
"value": "__sfx__\n"
|
||||
}
|
||||
}
|
||||
},
|
||||
"music_marker": {
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 2,
|
||||
"content": {
|
||||
"type": "STRING",
|
||||
"value": "__music__\n"
|
||||
}
|
||||
}
|
||||
},
|
||||
"section_marker": {
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 1,
|
||||
"content": {
|
||||
"type": "PATTERN",
|
||||
"value": "__[a-z][a-z0-9_]*__\\n"
|
||||
}
|
||||
}
|
||||
},
|
||||
"lua_content": {
|
||||
"type": "REPEAT1",
|
||||
"content": {
|
||||
"type": "SYMBOL",
|
||||
"name": "line"
|
||||
}
|
||||
},
|
||||
"body": {
|
||||
"type": "REPEAT1",
|
||||
"content": {
|
||||
"type": "SYMBOL",
|
||||
"name": "line"
|
||||
}
|
||||
},
|
||||
"line": {
|
||||
"type": "CHOICE",
|
||||
"members": [
|
||||
{
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 0,
|
||||
"content": {
|
||||
"type": "PATTERN",
|
||||
"value": "[^\\n]*\\n"
|
||||
}
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "TOKEN",
|
||||
"content": {
|
||||
"type": "PREC",
|
||||
"value": 0,
|
||||
"content": {
|
||||
"type": "PATTERN",
|
||||
"value": "[^\\n]+"
|
||||
}
|
||||
}
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
"extras": [],
|
||||
"conflicts": [],
|
||||
"precedences": [],
|
||||
"externals": [],
|
||||
"inline": [],
|
||||
"supertypes": []
|
||||
}
|
||||
@@ -0,0 +1,296 @@
|
||||
[
|
||||
{
|
||||
"type": "body",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "line",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "cartridge",
|
||||
"named": true,
|
||||
"root": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": false,
|
||||
"types": [
|
||||
{
|
||||
"type": "header",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "section",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "version",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "gff_section",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "body",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "gff_marker",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "gfx_section",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "body",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "gfx_marker",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "label_section",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "body",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "label_marker",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "line",
|
||||
"named": true,
|
||||
"fields": {}
|
||||
},
|
||||
{
|
||||
"type": "lua_content",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "line",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "lua_section",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "lua_content",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "lua_marker",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "map_section",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "body",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "map_marker",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "music_section",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "body",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "music_marker",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "section",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": false,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "gff_section",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "gfx_section",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "label_section",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "lua_section",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "map_section",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "music_section",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "sfx_section",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "unknown_section",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "sfx_section",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "body",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "sfx_marker",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "unknown_section",
|
||||
"named": true,
|
||||
"fields": {},
|
||||
"children": {
|
||||
"multiple": true,
|
||||
"required": true,
|
||||
"types": [
|
||||
{
|
||||
"type": "body",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "section_marker",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
}
|
||||
},
|
||||
{
|
||||
"type": "gff_marker",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "gfx_marker",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "header",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "label_marker",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "lua_marker",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "map_marker",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "music_marker",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "section_marker",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "sfx_marker",
|
||||
"named": true
|
||||
},
|
||||
{
|
||||
"type": "version",
|
||||
"named": true
|
||||
}
|
||||
]
|
||||
File diff suppressed because it is too large
Load Diff
@@ -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 size);
|
||||
extern void *(*ts_current_calloc)(size_t count, size_t size);
|
||||
extern void *(*ts_current_realloc)(void *ptr, size_t size);
|
||||
extern void (*ts_current_free)(void *ptr);
|
||||
|
||||
#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,291 @@
|
||||
#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(push)
|
||||
#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(pop)
|
||||
#elif defined(__GNUC__) || defined(__clang__)
|
||||
#pragma GCC diagnostic pop
|
||||
#endif
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif // TREE_SITTER_ARRAY_H_
|
||||
@@ -0,0 +1,266 @@
|
||||
#ifndef TREE_SITTER_PARSER_H_
|
||||
#define TREE_SITTER_PARSER_H_
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#define ts_builtin_sym_error ((TSSymbol)-1)
|
||||
#define ts_builtin_sym_end 0
|
||||
#define TREE_SITTER_SERIALIZATION_BUFFER_SIZE 1024
|
||||
|
||||
#ifndef TREE_SITTER_API_H_
|
||||
typedef uint16_t TSStateId;
|
||||
typedef uint16_t TSSymbol;
|
||||
typedef uint16_t TSFieldId;
|
||||
typedef struct TSLanguage TSLanguage;
|
||||
#endif
|
||||
|
||||
typedef struct {
|
||||
TSFieldId field_id;
|
||||
uint8_t child_index;
|
||||
bool inherited;
|
||||
} TSFieldMapEntry;
|
||||
|
||||
typedef struct {
|
||||
uint16_t index;
|
||||
uint16_t length;
|
||||
} TSFieldMapSlice;
|
||||
|
||||
typedef struct {
|
||||
bool visible;
|
||||
bool named;
|
||||
bool supertype;
|
||||
} TSSymbolMetadata;
|
||||
|
||||
typedef struct TSLexer TSLexer;
|
||||
|
||||
struct TSLexer {
|
||||
int32_t lookahead;
|
||||
TSSymbol result_symbol;
|
||||
void (*advance)(TSLexer *, bool);
|
||||
void (*mark_end)(TSLexer *);
|
||||
uint32_t (*get_column)(TSLexer *);
|
||||
bool (*is_at_included_range_start)(const TSLexer *);
|
||||
bool (*eof)(const TSLexer *);
|
||||
void (*log)(const TSLexer *, const char *, ...);
|
||||
};
|
||||
|
||||
typedef enum {
|
||||
TSParseActionTypeShift,
|
||||
TSParseActionTypeReduce,
|
||||
TSParseActionTypeAccept,
|
||||
TSParseActionTypeRecover,
|
||||
} TSParseActionType;
|
||||
|
||||
typedef union {
|
||||
struct {
|
||||
uint8_t type;
|
||||
TSStateId state;
|
||||
bool extra;
|
||||
bool repetition;
|
||||
} shift;
|
||||
struct {
|
||||
uint8_t type;
|
||||
uint8_t child_count;
|
||||
TSSymbol symbol;
|
||||
int16_t dynamic_precedence;
|
||||
uint16_t production_id;
|
||||
} reduce;
|
||||
uint8_t type;
|
||||
} TSParseAction;
|
||||
|
||||
typedef struct {
|
||||
uint16_t lex_state;
|
||||
uint16_t external_lex_state;
|
||||
} TSLexMode;
|
||||
|
||||
typedef union {
|
||||
TSParseAction action;
|
||||
struct {
|
||||
uint8_t count;
|
||||
bool reusable;
|
||||
} entry;
|
||||
} TSParseActionEntry;
|
||||
|
||||
typedef struct {
|
||||
int32_t start;
|
||||
int32_t end;
|
||||
} TSCharacterRange;
|
||||
|
||||
struct TSLanguage {
|
||||
uint32_t version;
|
||||
uint32_t symbol_count;
|
||||
uint32_t alias_count;
|
||||
uint32_t token_count;
|
||||
uint32_t external_token_count;
|
||||
uint32_t state_count;
|
||||
uint32_t large_state_count;
|
||||
uint32_t production_id_count;
|
||||
uint32_t field_count;
|
||||
uint16_t max_alias_sequence_length;
|
||||
const uint16_t *parse_table;
|
||||
const uint16_t *small_parse_table;
|
||||
const uint32_t *small_parse_table_map;
|
||||
const TSParseActionEntry *parse_actions;
|
||||
const char * const *symbol_names;
|
||||
const char * const *field_names;
|
||||
const TSFieldMapSlice *field_map_slices;
|
||||
const TSFieldMapEntry *field_map_entries;
|
||||
const TSSymbolMetadata *symbol_metadata;
|
||||
const TSSymbol *public_symbol_map;
|
||||
const uint16_t *alias_map;
|
||||
const TSSymbol *alias_sequences;
|
||||
const TSLexMode *lex_modes;
|
||||
bool (*lex_fn)(TSLexer *, TSStateId);
|
||||
bool (*keyword_lex_fn)(TSLexer *, TSStateId);
|
||||
TSSymbol keyword_capture_token;
|
||||
struct {
|
||||
const bool *states;
|
||||
const TSSymbol *symbol_map;
|
||||
void *(*create)(void);
|
||||
void (*destroy)(void *);
|
||||
bool (*scan)(void *, TSLexer *, const bool *symbol_whitelist);
|
||||
unsigned (*serialize)(void *, char *);
|
||||
void (*deserialize)(void *, const char *, unsigned);
|
||||
} external_scanner;
|
||||
const TSStateId *primary_state_ids;
|
||||
};
|
||||
|
||||
static inline bool set_contains(TSCharacterRange *ranges, uint32_t len, int32_t lookahead) {
|
||||
uint32_t index = 0;
|
||||
uint32_t size = len - index;
|
||||
while (size > 1) {
|
||||
uint32_t half_size = size / 2;
|
||||
uint32_t mid_index = index + half_size;
|
||||
TSCharacterRange *range = &ranges[mid_index];
|
||||
if (lookahead >= range->start && lookahead <= range->end) {
|
||||
return true;
|
||||
} else if (lookahead > range->end) {
|
||||
index = mid_index;
|
||||
}
|
||||
size -= half_size;
|
||||
}
|
||||
TSCharacterRange *range = &ranges[index];
|
||||
return (lookahead >= range->start && lookahead <= range->end);
|
||||
}
|
||||
|
||||
/*
|
||||
* Lexer Macros
|
||||
*/
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#define UNUSED __pragma(warning(suppress : 4101))
|
||||
#else
|
||||
#define UNUSED __attribute__((unused))
|
||||
#endif
|
||||
|
||||
#define START_LEXER() \
|
||||
bool result = false; \
|
||||
bool skip = false; \
|
||||
UNUSED \
|
||||
bool eof = false; \
|
||||
int32_t lookahead; \
|
||||
goto start; \
|
||||
next_state: \
|
||||
lexer->advance(lexer, skip); \
|
||||
start: \
|
||||
skip = false; \
|
||||
lookahead = lexer->lookahead;
|
||||
|
||||
#define ADVANCE(state_value) \
|
||||
{ \
|
||||
state = state_value; \
|
||||
goto next_state; \
|
||||
}
|
||||
|
||||
#define ADVANCE_MAP(...) \
|
||||
{ \
|
||||
static const uint16_t map[] = { __VA_ARGS__ }; \
|
||||
for (uint32_t i = 0; i < sizeof(map) / sizeof(map[0]); i += 2) { \
|
||||
if (map[i] == lookahead) { \
|
||||
state = map[i + 1]; \
|
||||
goto next_state; \
|
||||
} \
|
||||
} \
|
||||
}
|
||||
|
||||
#define SKIP(state_value) \
|
||||
{ \
|
||||
skip = true; \
|
||||
state = state_value; \
|
||||
goto next_state; \
|
||||
}
|
||||
|
||||
#define ACCEPT_TOKEN(symbol_value) \
|
||||
result = true; \
|
||||
lexer->result_symbol = symbol_value; \
|
||||
lexer->mark_end(lexer);
|
||||
|
||||
#define END_STATE() return result;
|
||||
|
||||
/*
|
||||
* Parse Table Macros
|
||||
*/
|
||||
|
||||
#define SMALL_STATE(id) ((id) - LARGE_STATE_COUNT)
|
||||
|
||||
#define STATE(id) id
|
||||
|
||||
#define ACTIONS(id) id
|
||||
|
||||
#define SHIFT(state_value) \
|
||||
{{ \
|
||||
.shift = { \
|
||||
.type = TSParseActionTypeShift, \
|
||||
.state = (state_value) \
|
||||
} \
|
||||
}}
|
||||
|
||||
#define SHIFT_REPEAT(state_value) \
|
||||
{{ \
|
||||
.shift = { \
|
||||
.type = TSParseActionTypeShift, \
|
||||
.state = (state_value), \
|
||||
.repetition = true \
|
||||
} \
|
||||
}}
|
||||
|
||||
#define SHIFT_EXTRA() \
|
||||
{{ \
|
||||
.shift = { \
|
||||
.type = TSParseActionTypeShift, \
|
||||
.extra = true \
|
||||
} \
|
||||
}}
|
||||
|
||||
#define REDUCE(symbol_name, children, precedence, prod_id) \
|
||||
{{ \
|
||||
.reduce = { \
|
||||
.type = TSParseActionTypeReduce, \
|
||||
.symbol = symbol_name, \
|
||||
.child_count = children, \
|
||||
.dynamic_precedence = precedence, \
|
||||
.production_id = prod_id \
|
||||
}, \
|
||||
}}
|
||||
|
||||
#define RECOVER() \
|
||||
{{ \
|
||||
.type = TSParseActionTypeRecover \
|
||||
}}
|
||||
|
||||
#define ACCEPT_INPUT() \
|
||||
{{ \
|
||||
.type = TSParseActionTypeAccept \
|
||||
}}
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif // TREE_SITTER_PARSER_H_
|
||||
@@ -0,0 +1,29 @@
|
||||
{
|
||||
"grammars": [
|
||||
{
|
||||
"name": "p8-cart",
|
||||
"camelcase": "P8Cart",
|
||||
"scope": "source.p8-cart",
|
||||
"path": ".",
|
||||
"file-types": [
|
||||
"p8"
|
||||
]
|
||||
}
|
||||
],
|
||||
"metadata": {
|
||||
"version": "0.0.1",
|
||||
"license": "0BSD",
|
||||
"description": "tree-sitter grammar for the PICO-8 .p8 cartridge text format",
|
||||
"links": {
|
||||
"repository": "https://github.com/tree-sitter/tree-sitter-p8-cart"
|
||||
}
|
||||
},
|
||||
"bindings": {
|
||||
"c": true,
|
||||
"go": true,
|
||||
"node": true,
|
||||
"python": true,
|
||||
"rust": true,
|
||||
"swift": true
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,21 @@
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2021 Munif Tanjim
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
of this software and associated documentation files (the "Software"), to deal
|
||||
in the Software without restriction, including without limitation the rights
|
||||
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
copies of the Software, and to permit persons to whom the Software is
|
||||
furnished to do so, subject to the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all
|
||||
copies or substantial portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||||
SOFTWARE.
|
||||
@@ -0,0 +1,598 @@
|
||||
/**
|
||||
* @file PICO-8 Lua grammar for tree-sitter
|
||||
*
|
||||
* Forked from tree-sitter-lua 0.5.0 by Munif Tanjim ( MIT — see
|
||||
* UPSTREAM-LICENSE.md ). This fork adds the PICO-8 dialect extensions
|
||||
* documented in the PICO-8 manual:
|
||||
*
|
||||
* - != as alias for ~=
|
||||
* - Integer divide: \
|
||||
* - Bitwise XOR (binary): ^^
|
||||
* - Logical shift right: >>>
|
||||
* - Rotate left: <<>
|
||||
* - Rotate right: >><
|
||||
* - Compound-assignment statements: += -= *= /= %= \= ^= ..= &= |= ^^=
|
||||
* <<= >>= >>>= <<>= >><=
|
||||
* - Memory peek prefix unary operators: @addr %addr $addr
|
||||
* ( these coexist with binary % for modulo )
|
||||
* - Single-line if (cond) stmt [else stmt] — no `then`/`end`
|
||||
* - Single-line while (cond) stmt — no `do`/`end`
|
||||
* - Statement-level print shorthand: `?` followed by an expression list
|
||||
* - `#include path` directive
|
||||
*/
|
||||
|
||||
/// <reference types="tree-sitter-cli/dsl" />
|
||||
// @ts-check
|
||||
|
||||
const PREC = {
|
||||
OR: 1, // or
|
||||
AND: 2, // and
|
||||
COMPARE: 3, // < > <= >= ~= == !=
|
||||
BIT_OR: 4, // |
|
||||
BIT_NOT: 5, // ~ ^^
|
||||
BIT_AND: 6, // &
|
||||
BIT_SHIFT: 7, // << >> >>> <<> >><
|
||||
CONCAT: 8, // ..
|
||||
PLUS: 9, // + -
|
||||
MULTI: 10, // * / // % \
|
||||
UNARY: 11, // not # - ~ @ $ %
|
||||
POWER: 12, // ^
|
||||
};
|
||||
|
||||
const list_seq = (rule, separator, trailing_separator = false) =>
|
||||
trailing_separator
|
||||
? seq(rule, repeat(seq(separator, rule)), optional(separator))
|
||||
: seq(rule, repeat(seq(separator, rule)));
|
||||
|
||||
const optional_block = ($) => alias(optional($._block), $.block);
|
||||
|
||||
// namelist ::= Name {',' Name}
|
||||
const name_list = ($) => list_seq(field('name', $.identifier), ',');
|
||||
|
||||
const COMPOUND_ASSIGN_OPERATORS = [
|
||||
'+=', '-=', '*=', '/=', '%=', '\\=', '^=', '..=',
|
||||
'&=', '|=', '^^=',
|
||||
'<<=', '>>=', '>>>=', '<<>=', '>><=',
|
||||
];
|
||||
|
||||
export default grammar({
|
||||
name: 'pico8_lua',
|
||||
|
||||
extras: ($) => [$.comment, /\s/],
|
||||
|
||||
externals: ($) => [
|
||||
$._block_comment_start,
|
||||
$._block_comment_content,
|
||||
$._block_comment_end,
|
||||
|
||||
$._block_string_start,
|
||||
$._block_string_content,
|
||||
$._block_string_end,
|
||||
],
|
||||
|
||||
supertypes: ($) => [$.statement, $.expression, $.declaration, $.variable],
|
||||
|
||||
word: ($) => $.identifier,
|
||||
|
||||
// `if (cond) ...` is ambiguous between a standard if where the condition
|
||||
// is a parenthesized_expression and a shorthand if. Same for while. The
|
||||
// ambiguity resolves by what follows the closing `)` ( `then`/`do` for
|
||||
// the standard form, anything else for the shorthand ).
|
||||
conflicts: ($) => [
|
||||
[$.parenthesized_expression, $.shorthand_if_statement],
|
||||
[$.parenthesized_expression, $.shorthand_while_statement],
|
||||
],
|
||||
|
||||
rules: {
|
||||
// chunk ::= block
|
||||
chunk: ($) =>
|
||||
seq(
|
||||
optional($.hash_bang_line),
|
||||
repeat($.statement),
|
||||
optional($.return_statement)
|
||||
),
|
||||
|
||||
hash_bang_line: (_) => /#![^\n]*/,
|
||||
|
||||
// block ::= {stat} [retstat]
|
||||
_block: ($) =>
|
||||
choice(
|
||||
seq(repeat1($.statement), optional($.return_statement)),
|
||||
seq(repeat($.statement), $.return_statement)
|
||||
),
|
||||
|
||||
statement: ($) =>
|
||||
choice(
|
||||
$.empty_statement,
|
||||
$.assignment_statement,
|
||||
$.compound_assignment_statement,
|
||||
$.function_call,
|
||||
$.label_statement,
|
||||
$.break_statement,
|
||||
$.goto_statement,
|
||||
$.do_statement,
|
||||
$.while_statement,
|
||||
$.shorthand_while_statement,
|
||||
$.repeat_statement,
|
||||
$.if_statement,
|
||||
$.shorthand_if_statement,
|
||||
$.for_statement,
|
||||
$.declaration,
|
||||
$.print_shorthand_statement,
|
||||
$.include_statement,
|
||||
),
|
||||
|
||||
// retstat ::= return [explist] [';']
|
||||
return_statement: ($) =>
|
||||
seq(
|
||||
'return',
|
||||
optional(alias($._expression_list, $.expression_list)),
|
||||
optional(';')
|
||||
),
|
||||
|
||||
empty_statement: (_) => ';',
|
||||
|
||||
assignment_statement: ($) =>
|
||||
seq(
|
||||
alias($._variable_assignment_varlist, $.variable_list),
|
||||
field('operator', '='),
|
||||
alias($._variable_assignment_explist, $.expression_list)
|
||||
),
|
||||
_variable_assignment_varlist: ($) =>
|
||||
list_seq(field('name', $.variable), ','),
|
||||
_variable_assignment_explist: ($) =>
|
||||
list_seq(field('value', $.expression), ','),
|
||||
|
||||
// PICO-8 compound assignment: var OP= expr (single statement, single line).
|
||||
compound_assignment_statement: ($) =>
|
||||
seq(
|
||||
field('name', $.variable),
|
||||
field('operator', choice(...COMPOUND_ASSIGN_OPERATORS)),
|
||||
field('value', $.expression)
|
||||
),
|
||||
|
||||
label_statement: ($) => seq('::', $.identifier, '::'),
|
||||
|
||||
break_statement: (_) => 'break',
|
||||
|
||||
goto_statement: ($) => seq('goto', $.identifier),
|
||||
|
||||
do_statement: ($) => seq('do', field('body', optional_block($)), 'end'),
|
||||
|
||||
while_statement: ($) =>
|
||||
seq(
|
||||
'while',
|
||||
field('condition', $.expression),
|
||||
'do',
|
||||
field('body', optional_block($)),
|
||||
'end'
|
||||
),
|
||||
|
||||
// PICO-8 single-line: while (cond) stmt
|
||||
shorthand_while_statement: ($) =>
|
||||
seq(
|
||||
'while',
|
||||
'(',
|
||||
field('condition', $.expression),
|
||||
')',
|
||||
field('body', $.statement)
|
||||
),
|
||||
|
||||
repeat_statement: ($) =>
|
||||
seq(
|
||||
'repeat',
|
||||
field('body', optional_block($)),
|
||||
'until',
|
||||
field('condition', $.expression)
|
||||
),
|
||||
|
||||
if_statement: ($) =>
|
||||
seq(
|
||||
'if',
|
||||
field('condition', $.expression),
|
||||
'then',
|
||||
field('consequence', optional_block($)),
|
||||
repeat(field('alternative', $.elseif_statement)),
|
||||
optional(field('alternative', $.else_statement)),
|
||||
'end'
|
||||
),
|
||||
elseif_statement: ($) =>
|
||||
seq(
|
||||
'elseif',
|
||||
field('condition', $.expression),
|
||||
'then',
|
||||
field('consequence', optional_block($))
|
||||
),
|
||||
else_statement: ($) => seq('else', field('body', optional_block($))),
|
||||
|
||||
// PICO-8 single-line: if (cond) stmt [else stmt]
|
||||
// prec.right resolves the dangling-else ambiguity in favor of greedy
|
||||
// attach to the nearest preceding shorthand `if`, matching PICO-8
|
||||
// semantics where shorthand if/else live on one line.
|
||||
shorthand_if_statement: ($) =>
|
||||
prec.right(seq(
|
||||
'if',
|
||||
'(',
|
||||
field('condition', $.expression),
|
||||
')',
|
||||
field('consequence', $.statement),
|
||||
optional(seq('else', field('alternative', $.statement)))
|
||||
)),
|
||||
|
||||
for_statement: ($) =>
|
||||
seq(
|
||||
'for',
|
||||
field('clause', choice($.for_generic_clause, $.for_numeric_clause)),
|
||||
'do',
|
||||
field('body', optional_block($)),
|
||||
'end'
|
||||
),
|
||||
for_generic_clause: ($) =>
|
||||
seq(
|
||||
alias($._name_list, $.variable_list),
|
||||
'in',
|
||||
alias($._expression_list, $.expression_list)
|
||||
),
|
||||
for_numeric_clause: ($) =>
|
||||
seq(
|
||||
field('name', $.identifier),
|
||||
field('operator', '='),
|
||||
field('start', $.expression),
|
||||
',',
|
||||
field('end', $.expression),
|
||||
optional(seq(',', field('step', $.expression)))
|
||||
),
|
||||
_name_list: ($) => name_list($),
|
||||
|
||||
declaration: ($) =>
|
||||
choice(
|
||||
$.function_declaration,
|
||||
field(
|
||||
'local_declaration',
|
||||
alias($._local_function_declaration, $.function_declaration)
|
||||
),
|
||||
field('local_declaration', $.variable_declaration),
|
||||
),
|
||||
function_declaration: ($) =>
|
||||
seq('function', field('name', $._function_name), $._function_body),
|
||||
_local_function_declaration: ($) =>
|
||||
seq('local', 'function', field('name', $.identifier), $._function_body),
|
||||
_function_name: ($) =>
|
||||
choice(
|
||||
$._function_name_prefix_expression,
|
||||
alias(
|
||||
$._function_name_method_index_expression,
|
||||
$.method_index_expression
|
||||
)
|
||||
),
|
||||
_function_name_prefix_expression: ($) =>
|
||||
choice(
|
||||
$.identifier,
|
||||
alias($._function_name_dot_index_expression, $.dot_index_expression)
|
||||
),
|
||||
_function_name_dot_index_expression: ($) =>
|
||||
seq(
|
||||
field('table', $._function_name_prefix_expression),
|
||||
'.',
|
||||
field('field', $.identifier)
|
||||
),
|
||||
_function_name_method_index_expression: ($) =>
|
||||
seq(
|
||||
field('table', $._function_name_prefix_expression),
|
||||
':',
|
||||
field('method', $.identifier)
|
||||
),
|
||||
|
||||
variable_declaration: ($) =>
|
||||
seq(
|
||||
'local',
|
||||
choice(
|
||||
alias($._att_name_list, $.variable_list),
|
||||
alias($._variable_assignment, $.assignment_statement)
|
||||
)
|
||||
),
|
||||
_variable_assignment: ($) =>
|
||||
seq(
|
||||
alias($._att_name_list, $.variable_list),
|
||||
field('operator', '='),
|
||||
alias($._variable_assignment_explist, $.expression_list)
|
||||
),
|
||||
|
||||
_att_name_list: ($) =>
|
||||
seq(
|
||||
optional(field('attribute', alias($._attrib, $.attribute))),
|
||||
list_seq(
|
||||
seq(
|
||||
field('name', $.identifier),
|
||||
optional(field('attribute', alias($._attrib, $.attribute)))
|
||||
),
|
||||
','
|
||||
),
|
||||
),
|
||||
_attrib: ($) => seq('<', $.identifier, '>'),
|
||||
|
||||
_expression_list: ($) => list_seq($.expression, ','),
|
||||
|
||||
// PICO-8 print shorthand: ? expr {, expr}
|
||||
print_shorthand_statement: ($) =>
|
||||
seq(
|
||||
field('directive', '?'),
|
||||
list_seq(field('argument', $.expression), ',')
|
||||
),
|
||||
|
||||
// PICO-8 include directive: #include path
|
||||
// Tokenized greedily as `#include` + whitespace so that the standalone
|
||||
// `#` (unary length operator) and identifier-starting `#x` continue to
|
||||
// parse as length-of-expression.
|
||||
include_statement: ($) =>
|
||||
seq(
|
||||
field('directive', alias(token(prec(2, /#include[ \t]+/)), '#include')),
|
||||
field('path', alias(/[^\n\r]*/, $.include_path))
|
||||
),
|
||||
|
||||
expression: ($) =>
|
||||
choice(
|
||||
$.nil,
|
||||
$.false,
|
||||
$.true,
|
||||
$.number,
|
||||
$.string,
|
||||
$.vararg_expression,
|
||||
$.function_definition,
|
||||
$.variable,
|
||||
$.function_call,
|
||||
$.parenthesized_expression,
|
||||
$.table_constructor,
|
||||
$.binary_expression,
|
||||
$.unary_expression
|
||||
),
|
||||
|
||||
nil: (_) => 'nil',
|
||||
false: (_) => 'false',
|
||||
true: (_) => 'true',
|
||||
|
||||
number: (_) => {
|
||||
function number_literal(digits, exponent_marker, exponent_digits) {
|
||||
return seq(
|
||||
choice(
|
||||
seq(optional(digits), optional('.'), digits),
|
||||
seq(digits, optional('.'), optional(digits))
|
||||
),
|
||||
optional(
|
||||
seq(
|
||||
choice(
|
||||
exponent_marker.toLowerCase(),
|
||||
exponent_marker.toUpperCase()
|
||||
),
|
||||
seq(optional(choice('-', '+')), exponent_digits)
|
||||
)
|
||||
)
|
||||
);
|
||||
}
|
||||
|
||||
const decimal_digits = /[0-9]+/;
|
||||
const decimal_literal = number_literal(decimal_digits, 'e', decimal_digits);
|
||||
|
||||
const hex_digits = /[a-fA-F0-9]+/;
|
||||
const hex_literal = seq(
|
||||
choice('0x', '0X'),
|
||||
number_literal(hex_digits, 'p', decimal_digits)
|
||||
);
|
||||
|
||||
const bin_digits = /[01]+/;
|
||||
const bin_literal = seq(choice('0b', '0B'), bin_digits);
|
||||
|
||||
return token(choice(decimal_literal, hex_literal, bin_literal));
|
||||
},
|
||||
|
||||
string: ($) => choice($._quote_string, $._block_string),
|
||||
|
||||
_quote_string: ($) =>
|
||||
choice(
|
||||
seq(
|
||||
field('start', alias('"', '"')),
|
||||
field(
|
||||
'content',
|
||||
optional(alias($._doublequote_string_content, $.string_content))
|
||||
),
|
||||
field('end', alias('"', '"'))
|
||||
),
|
||||
seq(
|
||||
field('start', alias("'", "'")),
|
||||
field(
|
||||
'content',
|
||||
optional(alias($._singlequote_string_content, $.string_content))
|
||||
),
|
||||
field('end', alias("'", "'"))
|
||||
)
|
||||
),
|
||||
|
||||
_doublequote_string_content: ($) =>
|
||||
repeat1(choice(token.immediate(prec(1, /[^"\\]+/)), $.escape_sequence)),
|
||||
|
||||
_singlequote_string_content: ($) =>
|
||||
repeat1(choice(token.immediate(prec(1, /[^'\\]+/)), $.escape_sequence)),
|
||||
|
||||
_block_string: ($) =>
|
||||
seq(
|
||||
field('start', alias($._block_string_start, '[[')),
|
||||
field('content', alias($._block_string_content, $.string_content)),
|
||||
field('end', alias($._block_string_end, ']]'))
|
||||
),
|
||||
|
||||
escape_sequence: () =>
|
||||
token.immediate(
|
||||
seq(
|
||||
'\\',
|
||||
choice(
|
||||
/[\nabfnrtv\\'"]/,
|
||||
/z\s*/,
|
||||
/[0-9]{1,3}/,
|
||||
/x[0-9a-fA-F]{2}/,
|
||||
/u\{[0-9a-fA-F]+\}/
|
||||
)
|
||||
)
|
||||
),
|
||||
|
||||
vararg_expression: (_) => '...',
|
||||
|
||||
function_definition: ($) => seq('function', $._function_body),
|
||||
_function_body: ($) =>
|
||||
seq(
|
||||
field('parameters', $.parameters),
|
||||
field('body', optional_block($)),
|
||||
'end'
|
||||
),
|
||||
parameters: ($) => seq('(', optional($._parameter_list), ')'),
|
||||
_parameter_list: ($) =>
|
||||
choice(
|
||||
seq(name_list($), optional(seq(',', $._vararg_parameter))),
|
||||
$._vararg_parameter
|
||||
),
|
||||
_vararg_parameter: ($) =>
|
||||
seq($.vararg_expression, optional(field('name', $.identifier))),
|
||||
|
||||
_prefix_expression: ($) =>
|
||||
prec(1, choice($.variable, $.function_call, $.parenthesized_expression)),
|
||||
|
||||
variable: ($) =>
|
||||
choice($.identifier, $.bracket_index_expression, $.dot_index_expression),
|
||||
bracket_index_expression: ($) =>
|
||||
seq(
|
||||
field('table', $._prefix_expression),
|
||||
'[',
|
||||
field('field', $.expression),
|
||||
']'
|
||||
),
|
||||
dot_index_expression: ($) =>
|
||||
seq(
|
||||
field('table', $._prefix_expression),
|
||||
'.',
|
||||
field('field', $.identifier)
|
||||
),
|
||||
|
||||
function_call: ($) =>
|
||||
seq(
|
||||
field('name', choice($._prefix_expression, $.method_index_expression)),
|
||||
field('arguments', $.arguments)
|
||||
),
|
||||
method_index_expression: ($) =>
|
||||
seq(
|
||||
field('table', $._prefix_expression),
|
||||
':',
|
||||
field('method', $.identifier)
|
||||
),
|
||||
arguments: ($) =>
|
||||
choice(
|
||||
seq('(', optional(list_seq($.expression, ',')), ')'),
|
||||
$.table_constructor,
|
||||
$.string
|
||||
),
|
||||
|
||||
parenthesized_expression: ($) => seq('(', $.expression, ')'),
|
||||
|
||||
table_constructor: ($) => seq('{', optional($._field_list), '}'),
|
||||
_field_list: ($) => list_seq($.field, $._field_sep, true),
|
||||
_field_sep: (_) => choice(',', ';'),
|
||||
field: ($) =>
|
||||
choice(
|
||||
seq(
|
||||
'[',
|
||||
field('name', $.expression),
|
||||
']',
|
||||
field('operator', '='),
|
||||
field('value', $.expression)
|
||||
),
|
||||
seq(field('name', $.identifier), '=', field('value', $.expression)),
|
||||
field('value', $.expression)
|
||||
),
|
||||
|
||||
binary_expression: ($) =>
|
||||
choice(
|
||||
...[
|
||||
['or', PREC.OR],
|
||||
['and', PREC.AND],
|
||||
['<', PREC.COMPARE],
|
||||
['<=', PREC.COMPARE],
|
||||
['==', PREC.COMPARE],
|
||||
['~=', PREC.COMPARE],
|
||||
['!=', PREC.COMPARE], // PICO-8 alias for ~=
|
||||
['>=', PREC.COMPARE],
|
||||
['>', PREC.COMPARE],
|
||||
['|', PREC.BIT_OR],
|
||||
['~', PREC.BIT_NOT], // bitwise xor (Lua 5.3 binary form)
|
||||
['^^', PREC.BIT_NOT], // PICO-8 bitwise xor
|
||||
['&', PREC.BIT_AND],
|
||||
['<<', PREC.BIT_SHIFT],
|
||||
['>>', PREC.BIT_SHIFT],
|
||||
['>>>', PREC.BIT_SHIFT], // PICO-8 logical shift right
|
||||
['<<>', PREC.BIT_SHIFT], // PICO-8 rotate left
|
||||
['>><', PREC.BIT_SHIFT], // PICO-8 rotate right
|
||||
['+', PREC.PLUS],
|
||||
['-', PREC.PLUS],
|
||||
['*', PREC.MULTI],
|
||||
['/', PREC.MULTI],
|
||||
['//', PREC.MULTI],
|
||||
['%', PREC.MULTI],
|
||||
['\\', PREC.MULTI], // PICO-8 integer divide
|
||||
].map(([operator, precedence]) =>
|
||||
prec.left(
|
||||
precedence,
|
||||
seq(
|
||||
field('left', $.expression),
|
||||
field('operator', operator),
|
||||
field('right', $.expression)
|
||||
)
|
||||
)
|
||||
),
|
||||
...[
|
||||
['..', PREC.CONCAT],
|
||||
['^', PREC.POWER],
|
||||
].map(([operator, precedence]) =>
|
||||
prec.right(
|
||||
precedence,
|
||||
seq(
|
||||
field('left', $.expression),
|
||||
field('operator', operator),
|
||||
field('right', $.expression)
|
||||
)
|
||||
)
|
||||
)
|
||||
),
|
||||
|
||||
unary_expression: ($) =>
|
||||
prec.left(
|
||||
PREC.UNARY,
|
||||
seq(
|
||||
// @ $ % are PICO-8 peek prefixes ( peek / peek4 / peek2 ).
|
||||
// % collides lexically with binary modulo; the GLR parser
|
||||
// resolves usage by surrounding context.
|
||||
field('operator', choice('not', '#', '-', '~', '@', '$', '%')),
|
||||
field('operand', $.expression),
|
||||
)
|
||||
),
|
||||
|
||||
identifier: (_) => {
|
||||
// PICO-8 dialect carves out !, ?, @, $ as operator tokens, so they
|
||||
// are not valid in identifiers ( upstream allowed them ).
|
||||
const identifier_start =
|
||||
/[^\p{Control}\s!?@$+\-*/%^#&~|<>=(){}\[\];:,.\\'"\d]/;
|
||||
const identifier_continue =
|
||||
/[^\p{Control}\s!?@$+\-*/%^#&~|<>=(){}\[\];:,.\\'"]*/;
|
||||
return token(seq(identifier_start, identifier_continue));
|
||||
},
|
||||
|
||||
comment: ($) =>
|
||||
choice(
|
||||
seq(
|
||||
field('start', '--'),
|
||||
field('content', alias(/[^\r\n]*/, $.comment_content))
|
||||
),
|
||||
seq(
|
||||
field('start', alias($._block_comment_start, '[[')),
|
||||
field('content', alias($._block_comment_content, $.comment_content)),
|
||||
field('end', alias($._block_comment_end, ']]'))
|
||||
)
|
||||
),
|
||||
},
|
||||
});
|
||||
@@ -0,0 +1,7 @@
|
||||
{
|
||||
"name": "tree-sitter-pico8-lua",
|
||||
"version": "0.0.1",
|
||||
"description": "tree-sitter grammar for the PICO-8 Lua dialect (forked from tree-sitter-lua)",
|
||||
"type": "module",
|
||||
"license": "MIT"
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,195 @@
|
||||
#include <stdio.h>
|
||||
#include "tree_sitter/alloc.h"
|
||||
#include "tree_sitter/parser.h"
|
||||
#include <wctype.h>
|
||||
|
||||
enum TokenType {
|
||||
BLOCK_COMMENT_START,
|
||||
BLOCK_COMMENT_CONTENT,
|
||||
BLOCK_COMMENT_END,
|
||||
|
||||
BLOCK_STRING_START,
|
||||
BLOCK_STRING_CONTENT,
|
||||
BLOCK_STRING_END,
|
||||
};
|
||||
|
||||
static inline void consume(TSLexer *lexer) { lexer->advance(lexer, false); }
|
||||
|
||||
static inline void skip(TSLexer *lexer) { lexer->advance(lexer, true); }
|
||||
|
||||
static inline bool consume_char(char c, TSLexer *lexer) {
|
||||
if (lexer->lookahead != c) {
|
||||
return false;
|
||||
}
|
||||
|
||||
consume(lexer);
|
||||
return true;
|
||||
}
|
||||
|
||||
static inline uint8_t consume_and_count_char(char c, TSLexer *lexer) {
|
||||
uint8_t count = 0;
|
||||
while (lexer->lookahead == c) {
|
||||
++count;
|
||||
consume(lexer);
|
||||
}
|
||||
return count;
|
||||
}
|
||||
|
||||
static inline void skip_whitespaces(TSLexer *lexer) {
|
||||
while (iswspace(lexer->lookahead)) {
|
||||
skip(lexer);
|
||||
}
|
||||
}
|
||||
|
||||
typedef struct {
|
||||
char ending_char;
|
||||
uint8_t level_count;
|
||||
} Scanner;
|
||||
|
||||
static inline void reset_state(Scanner *scanner) {
|
||||
scanner->ending_char = 0;
|
||||
scanner->level_count = 0;
|
||||
}
|
||||
|
||||
void *tree_sitter_pico8_lua_external_scanner_create() {
|
||||
Scanner *scanner = ts_calloc(1, sizeof(Scanner));
|
||||
return scanner;
|
||||
}
|
||||
|
||||
void tree_sitter_pico8_lua_external_scanner_destroy(void *payload) {
|
||||
Scanner *scanner = (Scanner *)payload;
|
||||
ts_free(scanner);
|
||||
}
|
||||
|
||||
unsigned tree_sitter_pico8_lua_external_scanner_serialize(void *payload, char *buffer) {
|
||||
Scanner *scanner = (Scanner *)payload;
|
||||
buffer[0] = scanner->ending_char;
|
||||
buffer[1] = (char)scanner->level_count;
|
||||
return 2;
|
||||
}
|
||||
|
||||
void tree_sitter_pico8_lua_external_scanner_deserialize(void *payload, const char *buffer, unsigned length) {
|
||||
Scanner *scanner = (Scanner *)payload;
|
||||
if (length == 0) return;
|
||||
scanner->ending_char = buffer[0];
|
||||
if (length == 1) return;
|
||||
scanner->level_count = buffer[1];
|
||||
}
|
||||
|
||||
static bool scan_block_start(Scanner *scanner, TSLexer *lexer) {
|
||||
if (consume_char('[', lexer)) {
|
||||
uint8_t level = consume_and_count_char('=', lexer);
|
||||
|
||||
if (consume_char('[', lexer)) {
|
||||
scanner->level_count = level;
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static bool scan_block_end(Scanner *scanner, TSLexer *lexer) {
|
||||
if (consume_char(']', lexer)) {
|
||||
uint8_t level = consume_and_count_char('=', lexer);
|
||||
|
||||
if (scanner->level_count == level && consume_char(']', lexer)) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static bool scan_block_content(Scanner *scanner, TSLexer *lexer) {
|
||||
while (lexer->lookahead != 0) {
|
||||
if (lexer->lookahead == ']') {
|
||||
lexer->mark_end(lexer);
|
||||
|
||||
if (scan_block_end(scanner, lexer)) {
|
||||
return true;
|
||||
}
|
||||
} else {
|
||||
consume(lexer);
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static bool scan_comment_start(Scanner *scanner, TSLexer *lexer) {
|
||||
if (consume_char('-', lexer) && consume_char('-', lexer)) {
|
||||
lexer->mark_end(lexer);
|
||||
|
||||
if (scan_block_start(scanner, lexer)) {
|
||||
lexer->mark_end(lexer);
|
||||
lexer->result_symbol = BLOCK_COMMENT_START;
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
static bool scan_comment_content(Scanner *scanner, TSLexer *lexer) {
|
||||
if (scanner->ending_char == 0) { // block comment
|
||||
if (scan_block_content(scanner, lexer)) {
|
||||
lexer->result_symbol = BLOCK_COMMENT_CONTENT;
|
||||
return true;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
while (lexer->lookahead != 0) {
|
||||
if (lexer->lookahead == scanner->ending_char) {
|
||||
reset_state(scanner);
|
||||
lexer->result_symbol = BLOCK_COMMENT_CONTENT;
|
||||
return true;
|
||||
}
|
||||
|
||||
consume(lexer);
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
bool tree_sitter_pico8_lua_external_scanner_scan(void *payload, TSLexer *lexer, const bool *valid_symbols) {
|
||||
Scanner *scanner = (Scanner *)payload;
|
||||
|
||||
if (valid_symbols[BLOCK_STRING_END] && scan_block_end(scanner, lexer)) {
|
||||
reset_state(scanner);
|
||||
lexer->result_symbol = BLOCK_STRING_END;
|
||||
return true;
|
||||
}
|
||||
|
||||
if (valid_symbols[BLOCK_STRING_CONTENT] && scan_block_content(scanner, lexer)) {
|
||||
lexer->result_symbol = BLOCK_STRING_CONTENT;
|
||||
return true;
|
||||
}
|
||||
|
||||
if (valid_symbols[BLOCK_COMMENT_END] && scanner->ending_char == 0 && scan_block_end(scanner, lexer)) {
|
||||
reset_state(scanner);
|
||||
lexer->result_symbol = BLOCK_COMMENT_END;
|
||||
return true;
|
||||
}
|
||||
|
||||
if (valid_symbols[BLOCK_COMMENT_CONTENT] && scan_comment_content(scanner, lexer)) {
|
||||
return true;
|
||||
}
|
||||
|
||||
skip_whitespaces(lexer);
|
||||
|
||||
if (valid_symbols[BLOCK_STRING_START] && scan_block_start(scanner, lexer)) {
|
||||
lexer->result_symbol = BLOCK_STRING_START;
|
||||
return true;
|
||||
}
|
||||
|
||||
if (valid_symbols[BLOCK_COMMENT_START]) {
|
||||
if (scan_comment_start(scanner, lexer)) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
@@ -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 size);
|
||||
extern void *(*ts_current_calloc)(size_t count, size_t size);
|
||||
extern void *(*ts_current_realloc)(void *ptr, size_t size);
|
||||
extern void (*ts_current_free)(void *ptr);
|
||||
|
||||
#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,291 @@
|
||||
#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(push)
|
||||
#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(pop)
|
||||
#elif defined(__GNUC__) || defined(__clang__)
|
||||
#pragma GCC diagnostic pop
|
||||
#endif
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif // TREE_SITTER_ARRAY_H_
|
||||
@@ -0,0 +1,266 @@
|
||||
#ifndef TREE_SITTER_PARSER_H_
|
||||
#define TREE_SITTER_PARSER_H_
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#define ts_builtin_sym_error ((TSSymbol)-1)
|
||||
#define ts_builtin_sym_end 0
|
||||
#define TREE_SITTER_SERIALIZATION_BUFFER_SIZE 1024
|
||||
|
||||
#ifndef TREE_SITTER_API_H_
|
||||
typedef uint16_t TSStateId;
|
||||
typedef uint16_t TSSymbol;
|
||||
typedef uint16_t TSFieldId;
|
||||
typedef struct TSLanguage TSLanguage;
|
||||
#endif
|
||||
|
||||
typedef struct {
|
||||
TSFieldId field_id;
|
||||
uint8_t child_index;
|
||||
bool inherited;
|
||||
} TSFieldMapEntry;
|
||||
|
||||
typedef struct {
|
||||
uint16_t index;
|
||||
uint16_t length;
|
||||
} TSFieldMapSlice;
|
||||
|
||||
typedef struct {
|
||||
bool visible;
|
||||
bool named;
|
||||
bool supertype;
|
||||
} TSSymbolMetadata;
|
||||
|
||||
typedef struct TSLexer TSLexer;
|
||||
|
||||
struct TSLexer {
|
||||
int32_t lookahead;
|
||||
TSSymbol result_symbol;
|
||||
void (*advance)(TSLexer *, bool);
|
||||
void (*mark_end)(TSLexer *);
|
||||
uint32_t (*get_column)(TSLexer *);
|
||||
bool (*is_at_included_range_start)(const TSLexer *);
|
||||
bool (*eof)(const TSLexer *);
|
||||
void (*log)(const TSLexer *, const char *, ...);
|
||||
};
|
||||
|
||||
typedef enum {
|
||||
TSParseActionTypeShift,
|
||||
TSParseActionTypeReduce,
|
||||
TSParseActionTypeAccept,
|
||||
TSParseActionTypeRecover,
|
||||
} TSParseActionType;
|
||||
|
||||
typedef union {
|
||||
struct {
|
||||
uint8_t type;
|
||||
TSStateId state;
|
||||
bool extra;
|
||||
bool repetition;
|
||||
} shift;
|
||||
struct {
|
||||
uint8_t type;
|
||||
uint8_t child_count;
|
||||
TSSymbol symbol;
|
||||
int16_t dynamic_precedence;
|
||||
uint16_t production_id;
|
||||
} reduce;
|
||||
uint8_t type;
|
||||
} TSParseAction;
|
||||
|
||||
typedef struct {
|
||||
uint16_t lex_state;
|
||||
uint16_t external_lex_state;
|
||||
} TSLexMode;
|
||||
|
||||
typedef union {
|
||||
TSParseAction action;
|
||||
struct {
|
||||
uint8_t count;
|
||||
bool reusable;
|
||||
} entry;
|
||||
} TSParseActionEntry;
|
||||
|
||||
typedef struct {
|
||||
int32_t start;
|
||||
int32_t end;
|
||||
} TSCharacterRange;
|
||||
|
||||
struct TSLanguage {
|
||||
uint32_t version;
|
||||
uint32_t symbol_count;
|
||||
uint32_t alias_count;
|
||||
uint32_t token_count;
|
||||
uint32_t external_token_count;
|
||||
uint32_t state_count;
|
||||
uint32_t large_state_count;
|
||||
uint32_t production_id_count;
|
||||
uint32_t field_count;
|
||||
uint16_t max_alias_sequence_length;
|
||||
const uint16_t *parse_table;
|
||||
const uint16_t *small_parse_table;
|
||||
const uint32_t *small_parse_table_map;
|
||||
const TSParseActionEntry *parse_actions;
|
||||
const char * const *symbol_names;
|
||||
const char * const *field_names;
|
||||
const TSFieldMapSlice *field_map_slices;
|
||||
const TSFieldMapEntry *field_map_entries;
|
||||
const TSSymbolMetadata *symbol_metadata;
|
||||
const TSSymbol *public_symbol_map;
|
||||
const uint16_t *alias_map;
|
||||
const TSSymbol *alias_sequences;
|
||||
const TSLexMode *lex_modes;
|
||||
bool (*lex_fn)(TSLexer *, TSStateId);
|
||||
bool (*keyword_lex_fn)(TSLexer *, TSStateId);
|
||||
TSSymbol keyword_capture_token;
|
||||
struct {
|
||||
const bool *states;
|
||||
const TSSymbol *symbol_map;
|
||||
void *(*create)(void);
|
||||
void (*destroy)(void *);
|
||||
bool (*scan)(void *, TSLexer *, const bool *symbol_whitelist);
|
||||
unsigned (*serialize)(void *, char *);
|
||||
void (*deserialize)(void *, const char *, unsigned);
|
||||
} external_scanner;
|
||||
const TSStateId *primary_state_ids;
|
||||
};
|
||||
|
||||
static inline bool set_contains(TSCharacterRange *ranges, uint32_t len, int32_t lookahead) {
|
||||
uint32_t index = 0;
|
||||
uint32_t size = len - index;
|
||||
while (size > 1) {
|
||||
uint32_t half_size = size / 2;
|
||||
uint32_t mid_index = index + half_size;
|
||||
TSCharacterRange *range = &ranges[mid_index];
|
||||
if (lookahead >= range->start && lookahead <= range->end) {
|
||||
return true;
|
||||
} else if (lookahead > range->end) {
|
||||
index = mid_index;
|
||||
}
|
||||
size -= half_size;
|
||||
}
|
||||
TSCharacterRange *range = &ranges[index];
|
||||
return (lookahead >= range->start && lookahead <= range->end);
|
||||
}
|
||||
|
||||
/*
|
||||
* Lexer Macros
|
||||
*/
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#define UNUSED __pragma(warning(suppress : 4101))
|
||||
#else
|
||||
#define UNUSED __attribute__((unused))
|
||||
#endif
|
||||
|
||||
#define START_LEXER() \
|
||||
bool result = false; \
|
||||
bool skip = false; \
|
||||
UNUSED \
|
||||
bool eof = false; \
|
||||
int32_t lookahead; \
|
||||
goto start; \
|
||||
next_state: \
|
||||
lexer->advance(lexer, skip); \
|
||||
start: \
|
||||
skip = false; \
|
||||
lookahead = lexer->lookahead;
|
||||
|
||||
#define ADVANCE(state_value) \
|
||||
{ \
|
||||
state = state_value; \
|
||||
goto next_state; \
|
||||
}
|
||||
|
||||
#define ADVANCE_MAP(...) \
|
||||
{ \
|
||||
static const uint16_t map[] = { __VA_ARGS__ }; \
|
||||
for (uint32_t i = 0; i < sizeof(map) / sizeof(map[0]); i += 2) { \
|
||||
if (map[i] == lookahead) { \
|
||||
state = map[i + 1]; \
|
||||
goto next_state; \
|
||||
} \
|
||||
} \
|
||||
}
|
||||
|
||||
#define SKIP(state_value) \
|
||||
{ \
|
||||
skip = true; \
|
||||
state = state_value; \
|
||||
goto next_state; \
|
||||
}
|
||||
|
||||
#define ACCEPT_TOKEN(symbol_value) \
|
||||
result = true; \
|
||||
lexer->result_symbol = symbol_value; \
|
||||
lexer->mark_end(lexer);
|
||||
|
||||
#define END_STATE() return result;
|
||||
|
||||
/*
|
||||
* Parse Table Macros
|
||||
*/
|
||||
|
||||
#define SMALL_STATE(id) ((id) - LARGE_STATE_COUNT)
|
||||
|
||||
#define STATE(id) id
|
||||
|
||||
#define ACTIONS(id) id
|
||||
|
||||
#define SHIFT(state_value) \
|
||||
{{ \
|
||||
.shift = { \
|
||||
.type = TSParseActionTypeShift, \
|
||||
.state = (state_value) \
|
||||
} \
|
||||
}}
|
||||
|
||||
#define SHIFT_REPEAT(state_value) \
|
||||
{{ \
|
||||
.shift = { \
|
||||
.type = TSParseActionTypeShift, \
|
||||
.state = (state_value), \
|
||||
.repetition = true \
|
||||
} \
|
||||
}}
|
||||
|
||||
#define SHIFT_EXTRA() \
|
||||
{{ \
|
||||
.shift = { \
|
||||
.type = TSParseActionTypeShift, \
|
||||
.extra = true \
|
||||
} \
|
||||
}}
|
||||
|
||||
#define REDUCE(symbol_name, children, precedence, prod_id) \
|
||||
{{ \
|
||||
.reduce = { \
|
||||
.type = TSParseActionTypeReduce, \
|
||||
.symbol = symbol_name, \
|
||||
.child_count = children, \
|
||||
.dynamic_precedence = precedence, \
|
||||
.production_id = prod_id \
|
||||
}, \
|
||||
}}
|
||||
|
||||
#define RECOVER() \
|
||||
{{ \
|
||||
.type = TSParseActionTypeRecover \
|
||||
}}
|
||||
|
||||
#define ACCEPT_INPUT() \
|
||||
{{ \
|
||||
.type = TSParseActionTypeAccept \
|
||||
}}
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif // TREE_SITTER_PARSER_H_
|
||||
@@ -0,0 +1,27 @@
|
||||
{
|
||||
"$schema": "https://tree-sitter.github.io/tree-sitter/assets/schemas/config.schema.json",
|
||||
"grammars": [
|
||||
{
|
||||
"name": "pico8_lua",
|
||||
"scope": "source.pico8-lua",
|
||||
"path": ".",
|
||||
"file-types": [
|
||||
"p8lua"
|
||||
],
|
||||
"injection-regex": "^pico-?8[-_ ]?lua$"
|
||||
}
|
||||
],
|
||||
"metadata": {
|
||||
"version": "0.0.1",
|
||||
"license": "MIT",
|
||||
"description": "PICO-8 Lua dialect grammar (forked from tree-sitter-lua)"
|
||||
},
|
||||
"bindings": {
|
||||
"c": true,
|
||||
"go": false,
|
||||
"node": true,
|
||||
"python": false,
|
||||
"rust": false,
|
||||
"swift": false
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user