Expand description
Syn is a parsing library for parsing a stream of Rust tokens into a syntax tree of Rust source code.
Currently this library is geared toward use in Rust procedural macros, but contains some APIs that may be useful more generally.
-
Data structures — Syn provides a complete syntax tree that can represent any valid Rust source code. The syntax tree is rooted at
syn::File
which represents a full source file, but there are other entry points that may be useful to procedural macros includingsyn::Item
,syn::Expr
andsyn::Type
. -
Derives — Of particular interest to derive macros is
syn::DeriveInput
which is any of the three legal input items to a derive macro. An example below shows using this type in a library that can derive implementations of a user-defined trait. -
Parsing — Parsing in Syn is built around parser functions with the signature
fn(ParseStream) -> Result<T>
. Every syntax tree node defined by Syn is individually parsable and may be used as a building block for custom syntaxes, or you may dream up your own brand new syntax without involving any of our syntax tree types. -
Location information — Every token parsed by Syn is associated with a
Span
that tracks line and column information back to the source of that token. These spans allow a procedural macro to display detailed error messages pointing to all the right places in the user’s code. There is an example of this below. -
Feature flags — Functionality is aggressively feature gated so your procedural macros enable only what they need, and do not pay in compile time for all the rest.
Example of a derive macro
The canonical derive macro using Syn looks like this. We write an ordinary
Rust function tagged with a proc_macro_derive
attribute and the name of
the trait we are deriving. Any time that derive appears in the user’s code,
the Rust compiler passes their data structure as tokens into our macro. We
get to execute arbitrary Rust code to figure out what to do with those
tokens, then hand some tokens back to the compiler to compile into the
user’s crate.
[dependencies]
syn = "1.0"
quote = "1.0"
[lib]
proc-macro = true
use proc_macro::TokenStream;
use quote::quote;
use syn::{parse_macro_input, DeriveInput};
#[proc_macro_derive(MyMacro)]
pub fn my_macro(input: TokenStream) -> TokenStream {
// Parse the input tokens into a syntax tree
let input = parse_macro_input!(input as DeriveInput);
// Build the output, possibly using quasi-quotation
let expanded = quote! {
// ...
};
// Hand the output tokens back to the compiler
TokenStream::from(expanded)
}
The heapsize
example directory shows a complete working implementation
of a derive macro. It works on any Rust compiler 1.31+. The example derives
a HeapSize
trait which computes an estimate of the amount of heap memory
owned by a value.
pub trait HeapSize {
/// Total number of bytes of heap memory owned by `self`.
fn heap_size_of_children(&self) -> usize;
}
The derive macro allows users to write #[derive(HeapSize)]
on data
structures in their program.
#[derive(HeapSize)]
struct Demo<'a, T: ?Sized> {
a: Box<T>,
b: u8,
c: &'a str,
d: String,
}
Spans and error reporting
The token-based procedural macro API provides great control over where the
compiler’s error messages are displayed in user code. Consider the error the
user sees if one of their field types does not implement HeapSize
.
#[derive(HeapSize)]
struct Broken {
ok: String,
bad: std::thread::Thread,
}
By tracking span information all the way through the expansion of a
procedural macro as shown in the heapsize
example, token-based macros in
Syn are able to trigger errors that directly pinpoint the source of the
problem.
error[E0277]: the trait bound `std::thread::Thread: HeapSize` is not satisfied
--> src/main.rs:7:5
|
7 | bad: std::thread::Thread,
| ^^^^^^^^^^^^^^^^^^^^^^^^ the trait `HeapSize` is not implemented for `Thread`
Parsing a custom syntax
The lazy-static
example directory shows the implementation of a
functionlike!(...)
procedural macro in which the input tokens are parsed
using Syn’s parsing API.
The example reimplements the popular lazy_static
crate from crates.io as a
procedural macro.
lazy_static! {
static ref USERNAME: Regex = Regex::new("^[a-z0-9_-]{3,16}$").unwrap();
}
The implementation shows how to trigger custom warnings and error messages on the macro input.
warning: come on, pick a more creative name
--> src/main.rs:10:16
|
10 | static ref FOO: String = "lazy_static".to_owned();
| ^^^
Testing
When testing macros, we often care not just that the macro can be used
successfully but also that when the macro is provided with invalid input it
produces maximally helpful error messages. Consider using the trybuild
crate to write tests for errors that are emitted by your macro or errors
detected by the Rust compiler in the expanded code following misuse of the
macro. Such tests help avoid regressions from later refactors that
mistakenly make an error no longer trigger or be less helpful than it used
to be.
Debugging
When developing a procedural macro it can be helpful to look at what the
generated code looks like. Use cargo rustc -- -Zunstable-options --pretty=expanded
or the cargo expand
subcommand.
To show the expanded code for some crate that uses your procedural macro,
run cargo expand
from that crate. To show the expanded code for one of
your own test cases, run cargo expand --test the_test_case
where the last
argument is the name of the test file without the .rs
extension.
This write-up by Brandon W Maister discusses debugging in more detail: Debugging Rust’s new Custom Derive system.
Optional features
Syn puts a lot of functionality behind optional features in order to optimize compile time for the most common use cases. The following features are available.
derive
(enabled by default) — Data structures for representing the possible input to a derive macro, including structs and enums and types.full
— Data structures for representing the syntax tree of all valid Rust source code, including items and expressions.parsing
(enabled by default) — Ability to parse input tokens into a syntax tree node of a chosen type.printing
(enabled by default) — Ability to print a syntax tree node as tokens of Rust source code.visit
— Trait for traversing a syntax tree.visit-mut
— Trait for traversing and mutating in place a syntax tree.fold
— Trait for transforming an owned syntax tree.clone-impls
(enabled by default) — Clone impls for all syntax tree types.extra-traits
— Debug, Eq, PartialEq, Hash impls for all syntax tree types.proc-macro
(enabled by default) — Runtime dependency on the dynamic library libproc_macro from rustc toolchain.
Modules
parsing
parsing
fold
parsing
parsing
and printing
Span
of the complete contents of a syntax
tree node.visit
visit-mut
Macros
parsing
parsing
parsing
parsing
and proc-macro
parsing
and printing
quote!
macro but uses
type inference to figure out a return type for those tokens.parsing
and printing
parse_quote!
+ quote_spanned!
.Structs
full
or derive
extern "C"
.full
or derive
<K, V>
in HashMap<K, V>
.full
match
expression: 0...10 => { return true; }
.full
or derive
#[repr(transparent)]
.full
or derive
usize
in fn(usize) -> bool
.full
or derive
Item = u8
.full
full
or derive
for<'a, 'b, 'c>
.full
or derive
const LENGTH: usize
.full
or derive
Iterator<Item: Display>
.derive
proc_macro_derive
macro.derive
proc_macro_derive
macro.derive
proc_macro_derive
macro.derive
proc_macro_derive
macro.full
[a, b, c, d]
.full
a = compute()
.full
counter += 1
.full
async { ... }
.full
fut.await
.full
or derive
a + b
, a * b
.full
{ ... }
.full
box f
.full
break
, with an optional label to break and an optional
expression.full
or derive
invoke(a, b)
.full
or derive
foo as f64
.full
|a, b| a + b
.full
continue
, with an optional label.full
or derive
obj.k
) or unnamed tuple struct
field (obj.0
).full
for pat in expr { ... }
.full
full
if
expression with an optional else
block: if expr { ... } else { ... }
.full
or derive
vector[2]
.full
let
guard: let Some(x) = opt
.full
or derive
1
, "foo"
.full
loop { ... }
.full
format!("{}", q)
.full
match
expression: match n { Some(n) => {}, None => {} }
.full
x.foo::<T>(a, b)
.full
or derive
(a + b)
.full
or derive
std::mem::replace
possibly containing generic
parameters and a qualified self-type.full
1..2
, 1..
, ..2
, 1..=2
, ..=2
.full
&a
or &mut a
.full
[0u8; N]
.full
return
, with an optional value to be returned.full
Point { x: 1, y: 1 }
.full
expr?
.full
try { ... }
.full
(a, b, c, d)
.full
foo: f64
.full
or derive
!x
, *x
.full
unsafe { ... }
.full
while expr { ... }
.full
yield expr
.full
or derive
full
full
full
or derive
Point { x: f64, y: f64 }
.full
or derive
Some(T)
.full
full
extern
block.full
extern
block: static ext: u8
.full
extern
block: type void
.full
or derive
full
or derive
) and printing
Generics::split_for_impl
.full
full
full
full
full
or derive
full
const MAX: u16 = 65535
.full
enum Foo<A, B> { A(A), B(B) }
.full
extern crate
item: extern crate serde
.full
fn process(n: usize) -> Result<()> { ... }
.full
extern "C" { ... }
.full
impl<A> Trait for Data<A> { ... }
.full
macro_rules!
definitions.full
macro
keyword.full
mod m
or mod m { ... }
.full
static BIKE: Shed = Shed(42)
.full
struct Foo<A> { x: A }
.full
pub trait Iterator { ... }
.full
pub trait SharableIterator = Iterator + Sync
.full
type Result<T> = std::result::Result<T, MyError>
.full
union Foo<A, B> { x: A, y: B }
.full
use std::collections::HashMap
.full
for
, while
, or loop
.'a
.full
or derive
'a: 'b + 'c + 'd
.true
or false
.b'f'
.b"foo"
.'a'
.1f64
or 1.0e10f64
.1
or 1u16
."foo"
.full
let
binding: let x: u64 = s.parse()?
.full
or derive
println!("{}", mac)
.full
or derive
derive(Copy, Clone)
.full
or derive
feature = "nightly"
.full
::<>
explicit type parameters passed to a method call:
parse::<u64>()
.full
or derive
(A, B) -> C
in Fn(A,B) -> C
.full
box v
.full
ref mut binding @ SUBPATTERN
.full
0
.full
full
full
Color::Red
, optionally qualified with a
self-type.full
1..=2
.full
&mut var
.full
[0, 1, ..]
full
[a, b, ref i @ .., y, z]
.full
Variant { x, y, .. }
.full
(a, b)
.full
Variant(x, y, .., z)
.full
foo: f64
.full
_
.full
or derive
std::collections::HashMap
).full
or derive
full
or derive
where
clause (unsupported).full
or derive
where
clause: 'a: 'b + 'c
.full
or derive
where
clause: for<'c> Foo<'c>: Trait<'c>
.full
or derive
T
in <T as Display>::fmt
.full
self
argument of an associated method, whether taken by value
or by reference.full
unsafe fn initialize(&self)
.full
or derive
full
full
full
full
full
or derive
) and printing
TypeGenerics::as_turbofish
.full
or derive
[T; n]
.full
or derive
fn(usize) -> bool
.full
or derive
) and printing
Generics::split_for_impl
.full
or derive
full
or derive
impl Bound1 + Bound2 + Bound3
type where Bound
is a trait or
a lifetime.full
or derive
_
.full
or derive
full
or derive
!
.full
or derive
T: Into<String>
.full
or derive
full
or derive
std::slice::Iter
, optionally qualified with a
self-type as in <Vec<T> as SomeTrait>::Associated
.full
or derive
*const T
or *mut T
.full
or derive
&'a T
or &'a mut T
.full
or derive
[T]
.full
or derive
dyn Bound1 + Bound2 + Bound3
where Bound
is a
trait or a lifetime.full
or derive
(A, B, C, String)
.full
use
item: *
.full
use
item: {A, B, C}
.full
use
item: HashMap
.full
use
item: std::...
.full
use
item: HashMap as Map
.full
or derive
full
or derive
full
or derive
crate
.full
or derive
pub
.full
or derive
pub(self)
or
pub(super)
or pub(crate)
or pub(in some::module)
.full
or derive
where
clause in a definition: where T: Deserialize<'de>, D: 'static
.Enums
full
or derive
full
or derive
+
, +=
, &
.derive
full
or derive
full
or derive
full
n: usize
in fn f(n: usize)
.full
extern
block.full
or derive
'a
, T
, or Item = T
.T
.full
or derive
T: Into<String>
,
'a: 'b
, const LEN: usize
.full
full
full
or derive
m!(...)
or m!{...}
or m![...]
.full
or derive
full
or derive
full
or derive
full
full
or derive
full
full
or derive
full
r##"data"##
.full
or derive
?
in
?Sized
.full
full
or derive
full
or derive
full
or derive
*
, !
, -
.full
use
item: Type as Renamed
or *
.full
or derive
pub
or
pub(restricted)
.full
or derive
where
clause: T: Deserialize<'de>
.Functions
parsing
and proc-macro
parsing
parsing
and full
parsing
Type Definitions
full
or derive