swc/macros/ast_node/Cargo.toml

[package]
name = "ast_node"
version = "0.1.0"
authors = ["강동윤 <kdy1@outlook.kr>"]

[lib]
proc-macro = true

[dependencies]
swc_macros_common = { path = "../common" }
pmutil = "0.1"
proc-macro2 = { version = "0.2", features = ["nightly"] }
quote = "0.4"

[dependencies.syn]
version = "0.12"
features = ["derive", "fold", "parsing", "printing"]


[dev-dependencies]
swc_macros = { path = "../" }
swc_common = { path = "../../common" }
initial commit 2017-12-22 15:51:36 +03:00			`[package]`
			`name = "ast_node"`
			`version = "0.1.0"`
			`authors = ["강동윤 <kdy1@outlook.kr>"]`

			`[lib]`
			`proc-macro = true`

			`[dependencies]`
			`swc_macros_common = { path = "../common" }`
ECMAScript parser (#1) - Parser and lexer for lastest ecma spec https://tc39.github.io/ecma262 - Lexer is currently very inefficient - Use https://github.com/tc39/test262-parser-tests/ for testing. - Implement proc-macro based ast folder and assert_eq_ignore_span! based on it. - Some utilities for proc macro at /macros/common 2018-01-12 10:53:06 +03:00			`pmutil = "0.1"`
[WIP] Make ast nodes contain span * `struct Expr` + `enum ExprKind` -> `enum Expr` `Expr` / `ExprKind` approach does not work well with recursive processing based on the type system because we can't access common fields like span while processing child node like `MemberExpr`. As ast processing is inherently recursive, we should use a recursive-friendly approach. * `#[derive(FromVariants)]` It creates lots of `From<T>` to help using ast enums as a real sum type. * `#[derive(Spanned)]` Inspired by https://docs.rs/syn/0.12.13/syn/spanned/trait.Spanned.html It does not handle attributes yet. * Parser is not updated yet. 2018-03-03 13:00:57 +03:00			`proc-macro2 = { version = "0.2", features = ["nightly"] }`
Make rls work rust-analysis chokes with `Option<Box<Expr>>` style fields. Rls only shows a warning on the crate with that fields, but ICEs on dependent crates. This can be workarounded by using `Option<(Box<Expr>)>`. Also, using multiple glob imports is bad for rls. So this commit deglobs them. 2018-02-03 13:56:23 +03:00			`quote = "0.4"`
initial commit 2017-12-22 15:51:36 +03:00
			`[dependencies.syn]`
ECMAScript parser (#1) - Parser and lexer for lastest ecma spec https://tc39.github.io/ecma262 - Lexer is currently very inefficient - Use https://github.com/tc39/test262-parser-tests/ for testing. - Implement proc-macro based ast folder and assert_eq_ignore_span! based on it. - Some utilities for proc macro at /macros/common 2018-01-12 10:53:06 +03:00			`version = "0.12"`
			`features = ["derive", "fold", "parsing", "printing"]`
initial commit 2017-12-22 15:51:36 +03:00

ECMAScript parser (#1) - Parser and lexer for lastest ecma spec https://tc39.github.io/ecma262 - Lexer is currently very inefficient - Use https://github.com/tc39/test262-parser-tests/ for testing. - Implement proc-macro based ast folder and assert_eq_ignore_span! based on it. - Some utilities for proc macro at /macros/common 2018-01-12 10:53:06 +03:00			`[dev-dependencies]`
			`swc_macros = { path = "../" }`
			`swc_common = { path = "../../common" }`