This way, we can keep of the order in which the rules were given, for resolving reduce/reduce conflicts.
72 lines
2.4 KiB
C++
72 lines
2.4 KiB
C++
#include "tree_sitter/compiler.h"
|
|
|
|
namespace tree_sitter {
|
|
namespace examples {
|
|
using namespace tree_sitter::rules;
|
|
|
|
static rule_ptr comma_sep(const rule_ptr &element) {
|
|
return choice({
|
|
seq({
|
|
element,
|
|
repeat(seq({ str(","), element })),
|
|
}),
|
|
blank(),
|
|
});
|
|
}
|
|
|
|
Grammar javascript() {
|
|
return Grammar({
|
|
{ "program", repeat(sym("statement")) },
|
|
{ "terminator", choice({ str(";"), str("\n") }) },
|
|
{ "statement", choice({
|
|
sym("if"),
|
|
seq({ sym("expression"), _sym("terminator") }),
|
|
seq({ sym("assignment"), _sym("terminator") }) }) },
|
|
{ "if", seq({
|
|
str("if"),
|
|
str("("),
|
|
sym("expression"),
|
|
str(")"),
|
|
sym("block")
|
|
}) },
|
|
{ "block", seq({
|
|
str("{"),
|
|
repeat(sym("statement")),
|
|
str("}")
|
|
}) },
|
|
{ "assignment", seq({
|
|
str("var"),
|
|
sym("identifier"),
|
|
str("="),
|
|
sym("expression") })},
|
|
{ "expression", choice({
|
|
sym("literal") }) },
|
|
{ "literal", choice({
|
|
sym("object"),
|
|
sym("array"),
|
|
sym("string"),
|
|
sym("number"),
|
|
sym("true"),
|
|
sym("false"),
|
|
sym("null"), }) },
|
|
{ "object", seq({
|
|
str("{"),
|
|
comma_sep(err(seq({
|
|
sym("string"),
|
|
str(":"),
|
|
sym("expression") }))),
|
|
str("}"), }) },
|
|
{ "array", seq({
|
|
str("["),
|
|
comma_sep(err(sym("expression"))),
|
|
str("]") }) },
|
|
{ "string", pattern("\"([^\"]|\\\\\")+\"") },
|
|
{ "identifier", pattern("[\\w_$]+") },
|
|
{ "number", pattern("\\d+(.\\d+)?") },
|
|
{ "null", str("null") },
|
|
{ "true", str("true") },
|
|
{ "false", str("false") },
|
|
});
|
|
}
|
|
}
|
|
}
|