mirror of
https://github.com/RustPython/Parser.git
synced 2025-07-15 00:55:22 +00:00
reorganize compiler crates
This commit is contained in:
parent
ffacac05bb
commit
53c48bf6b9
66 changed files with 12079 additions and 152 deletions
530
ast/src/unparse.rs
Normal file
530
ast/src/unparse.rs
Normal file
|
@ -0,0 +1,530 @@
|
|||
use crate::{
|
||||
Arg, Arguments, Boolop, Cmpop, Comprehension, Constant, ConversionFlag, Expr, ExprKind,
|
||||
Operator,
|
||||
};
|
||||
use std::fmt;
|
||||
|
||||
mod precedence {
|
||||
macro_rules! precedence {
|
||||
($($op:ident,)*) => {
|
||||
precedence!(@0, $($op,)*);
|
||||
};
|
||||
(@$i:expr, $op1:ident, $($op:ident,)*) => {
|
||||
pub const $op1: u8 = $i;
|
||||
precedence!(@$i + 1, $($op,)*);
|
||||
};
|
||||
(@$i:expr,) => {};
|
||||
}
|
||||
precedence!(
|
||||
TUPLE, TEST, OR, AND, NOT, CMP, // "EXPR" =
|
||||
BOR, BXOR, BAND, SHIFT, ARITH, TERM, FACTOR, POWER, AWAIT, ATOM,
|
||||
);
|
||||
pub const EXPR: u8 = BOR;
|
||||
}
|
||||
|
||||
#[repr(transparent)]
|
||||
struct Unparser<'a> {
|
||||
f: fmt::Formatter<'a>,
|
||||
}
|
||||
impl<'a> Unparser<'a> {
|
||||
fn new<'b>(f: &'b mut fmt::Formatter<'a>) -> &'b mut Unparser<'a> {
|
||||
unsafe { &mut *(f as *mut fmt::Formatter<'a> as *mut Unparser<'a>) }
|
||||
}
|
||||
|
||||
fn p(&mut self, s: &str) -> fmt::Result {
|
||||
self.f.write_str(s)
|
||||
}
|
||||
fn p_if(&mut self, cond: bool, s: &str) -> fmt::Result {
|
||||
if cond {
|
||||
self.f.write_str(s)?;
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
fn p_delim(&mut self, first: &mut bool, s: &str) -> fmt::Result {
|
||||
self.p_if(!std::mem::take(first), s)
|
||||
}
|
||||
fn write_fmt(&mut self, f: fmt::Arguments<'_>) -> fmt::Result {
|
||||
self.f.write_fmt(f)
|
||||
}
|
||||
|
||||
fn unparse_expr<U>(&mut self, ast: &Expr<U>, level: u8) -> fmt::Result {
|
||||
macro_rules! opprec {
|
||||
($opty:ident, $x:expr, $enu:path, $($var:ident($op:literal, $prec:ident)),*$(,)?) => {
|
||||
match $x {
|
||||
$(<$enu>::$var => (opprec!(@space $opty, $op), precedence::$prec),)*
|
||||
}
|
||||
};
|
||||
(@space bin, $op:literal) => {
|
||||
concat!(" ", $op, " ")
|
||||
};
|
||||
(@space un, $op:literal) => {
|
||||
$op
|
||||
};
|
||||
}
|
||||
macro_rules! group_if {
|
||||
($lvl:expr, $body:block) => {{
|
||||
let group = level > $lvl;
|
||||
self.p_if(group, "(")?;
|
||||
let ret = $body;
|
||||
self.p_if(group, ")")?;
|
||||
ret
|
||||
}};
|
||||
}
|
||||
match &ast.node {
|
||||
ExprKind::BoolOp { op, values } => {
|
||||
let (op, prec) = opprec!(bin, op, Boolop, And("and", AND), Or("or", OR));
|
||||
group_if!(prec, {
|
||||
let mut first = true;
|
||||
for val in values {
|
||||
self.p_delim(&mut first, op)?;
|
||||
self.unparse_expr(val, prec + 1)?;
|
||||
}
|
||||
})
|
||||
}
|
||||
ExprKind::NamedExpr { target, value } => {
|
||||
group_if!(precedence::TUPLE, {
|
||||
self.unparse_expr(target, precedence::ATOM)?;
|
||||
self.p(" := ")?;
|
||||
self.unparse_expr(value, precedence::ATOM)?;
|
||||
})
|
||||
}
|
||||
ExprKind::BinOp { left, op, right } => {
|
||||
let rassoc = matches!(op, Operator::Pow);
|
||||
let (op, prec) = opprec!(
|
||||
bin,
|
||||
op,
|
||||
Operator,
|
||||
Add("+", ARITH),
|
||||
Sub("-", ARITH),
|
||||
Mult("*", TERM),
|
||||
MatMult("@", TERM),
|
||||
Div("/", TERM),
|
||||
Mod("%", TERM),
|
||||
Pow("**", POWER),
|
||||
LShift("<<", SHIFT),
|
||||
RShift(">>", SHIFT),
|
||||
BitOr("|", BOR),
|
||||
BitXor("^", BXOR),
|
||||
BitAnd("&", BAND),
|
||||
FloorDiv("//", TERM),
|
||||
);
|
||||
group_if!(prec, {
|
||||
self.unparse_expr(left, prec + rassoc as u8)?;
|
||||
self.p(op)?;
|
||||
self.unparse_expr(right, prec + !rassoc as u8)?;
|
||||
})
|
||||
}
|
||||
ExprKind::UnaryOp { op, operand } => {
|
||||
let (op, prec) = opprec!(
|
||||
un,
|
||||
op,
|
||||
crate::Unaryop,
|
||||
Invert("~", FACTOR),
|
||||
Not("not ", NOT),
|
||||
UAdd("+", FACTOR),
|
||||
USub("-", FACTOR)
|
||||
);
|
||||
group_if!(prec, {
|
||||
self.p(op)?;
|
||||
self.unparse_expr(operand, prec)?;
|
||||
})
|
||||
}
|
||||
ExprKind::Lambda { args, body } => {
|
||||
group_if!(precedence::TEST, {
|
||||
let npos = args.args.len() + args.posonlyargs.len();
|
||||
self.p(if npos > 0 { "lambda " } else { "lambda" })?;
|
||||
self.unparse_args(args)?;
|
||||
write!(self, ": {}", **body)?;
|
||||
})
|
||||
}
|
||||
ExprKind::IfExp { test, body, orelse } => {
|
||||
group_if!(precedence::TEST, {
|
||||
self.unparse_expr(body, precedence::TEST + 1)?;
|
||||
self.p(" if ")?;
|
||||
self.unparse_expr(test, precedence::TEST + 1)?;
|
||||
self.p(" else ")?;
|
||||
self.unparse_expr(orelse, precedence::TEST)?;
|
||||
})
|
||||
}
|
||||
ExprKind::Dict { keys, values } => {
|
||||
self.p("{")?;
|
||||
let mut first = true;
|
||||
let (packed, unpacked) = values.split_at(keys.len());
|
||||
for (k, v) in keys.iter().zip(packed) {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
write!(self, "{}: {}", *k, *v)?;
|
||||
}
|
||||
for d in unpacked {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
write!(self, "**{}", *d)?;
|
||||
}
|
||||
self.p("}")?;
|
||||
}
|
||||
ExprKind::Set { elts } => {
|
||||
self.p("{")?;
|
||||
let mut first = true;
|
||||
for v in elts {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
self.unparse_expr(v, precedence::TEST)?;
|
||||
}
|
||||
self.p("}")?;
|
||||
}
|
||||
ExprKind::ListComp { elt, generators } => {
|
||||
self.p("[")?;
|
||||
self.unparse_expr(elt, precedence::TEST)?;
|
||||
self.unparse_comp(generators)?;
|
||||
self.p("]")?;
|
||||
}
|
||||
ExprKind::SetComp { elt, generators } => {
|
||||
self.p("{")?;
|
||||
self.unparse_expr(elt, precedence::TEST)?;
|
||||
self.unparse_comp(generators)?;
|
||||
self.p("}")?;
|
||||
}
|
||||
ExprKind::DictComp {
|
||||
key,
|
||||
value,
|
||||
generators,
|
||||
} => {
|
||||
self.p("{")?;
|
||||
self.unparse_expr(key, precedence::TEST)?;
|
||||
self.p(": ")?;
|
||||
self.unparse_expr(value, precedence::TEST)?;
|
||||
self.unparse_comp(generators)?;
|
||||
self.p("}")?;
|
||||
}
|
||||
ExprKind::GeneratorExp { elt, generators } => {
|
||||
self.p("(")?;
|
||||
self.unparse_expr(elt, precedence::TEST)?;
|
||||
self.unparse_comp(generators)?;
|
||||
self.p(")")?;
|
||||
}
|
||||
ExprKind::Await { value } => {
|
||||
group_if!(precedence::AWAIT, {
|
||||
self.p("await ")?;
|
||||
self.unparse_expr(value, precedence::ATOM)?;
|
||||
})
|
||||
}
|
||||
ExprKind::Yield { value } => {
|
||||
if let Some(value) = value {
|
||||
write!(self, "(yield {})", **value)?;
|
||||
} else {
|
||||
self.p("(yield)")?;
|
||||
}
|
||||
}
|
||||
ExprKind::YieldFrom { value } => {
|
||||
write!(self, "(yield from {})", **value)?;
|
||||
}
|
||||
ExprKind::Compare {
|
||||
left,
|
||||
ops,
|
||||
comparators,
|
||||
} => {
|
||||
group_if!(precedence::CMP, {
|
||||
let new_lvl = precedence::CMP + 1;
|
||||
self.unparse_expr(left, new_lvl)?;
|
||||
for (op, cmp) in ops.iter().zip(comparators) {
|
||||
let op = match op {
|
||||
Cmpop::Eq => " == ",
|
||||
Cmpop::NotEq => " != ",
|
||||
Cmpop::Lt => " < ",
|
||||
Cmpop::LtE => " <= ",
|
||||
Cmpop::Gt => " > ",
|
||||
Cmpop::GtE => " >= ",
|
||||
Cmpop::Is => " is ",
|
||||
Cmpop::IsNot => " is not ",
|
||||
Cmpop::In => " in ",
|
||||
Cmpop::NotIn => " not in ",
|
||||
};
|
||||
self.p(op)?;
|
||||
self.unparse_expr(cmp, new_lvl)?;
|
||||
}
|
||||
})
|
||||
}
|
||||
ExprKind::Call {
|
||||
func,
|
||||
args,
|
||||
keywords,
|
||||
} => {
|
||||
self.unparse_expr(func, precedence::ATOM)?;
|
||||
self.p("(")?;
|
||||
if let (
|
||||
[Expr {
|
||||
node: ExprKind::GeneratorExp { elt, generators },
|
||||
..
|
||||
}],
|
||||
[],
|
||||
) = (&**args, &**keywords)
|
||||
{
|
||||
// make sure a single genexp doesn't get double parens
|
||||
self.unparse_expr(elt, precedence::TEST)?;
|
||||
self.unparse_comp(generators)?;
|
||||
} else {
|
||||
let mut first = true;
|
||||
for arg in args {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
self.unparse_expr(arg, precedence::TEST)?;
|
||||
}
|
||||
for kw in keywords {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
if let Some(arg) = &kw.node.arg {
|
||||
self.p(arg)?;
|
||||
self.p("=")?;
|
||||
} else {
|
||||
self.p("**")?;
|
||||
}
|
||||
self.unparse_expr(&kw.node.value, precedence::TEST)?;
|
||||
}
|
||||
}
|
||||
self.p(")")?;
|
||||
}
|
||||
ExprKind::FormattedValue {
|
||||
value,
|
||||
conversion,
|
||||
format_spec,
|
||||
} => self.unparse_formatted(value, *conversion, format_spec.as_deref())?,
|
||||
ExprKind::JoinedStr { values } => self.unparse_joinedstr(values, false)?,
|
||||
ExprKind::Constant { value, kind } => {
|
||||
if let Some(kind) = kind {
|
||||
self.p(kind)?;
|
||||
}
|
||||
assert_eq!(f64::MAX_10_EXP, 308);
|
||||
let inf_str = "1e309";
|
||||
match value {
|
||||
Constant::Float(f) if f.is_infinite() => self.p(inf_str)?,
|
||||
Constant::Complex { real, imag }
|
||||
if real.is_infinite() || imag.is_infinite() =>
|
||||
{
|
||||
self.p(&value.to_string().replace("inf", inf_str))?
|
||||
}
|
||||
_ => fmt::Display::fmt(value, &mut self.f)?,
|
||||
}
|
||||
}
|
||||
ExprKind::Attribute { value, attr, .. } => {
|
||||
self.unparse_expr(value, precedence::ATOM)?;
|
||||
let period = if let ExprKind::Constant {
|
||||
value: Constant::Int(_),
|
||||
..
|
||||
} = &value.node
|
||||
{
|
||||
" ."
|
||||
} else {
|
||||
"."
|
||||
};
|
||||
self.p(period)?;
|
||||
self.p(attr)?;
|
||||
}
|
||||
ExprKind::Subscript { value, slice, .. } => {
|
||||
self.unparse_expr(value, precedence::ATOM)?;
|
||||
let mut lvl = precedence::TUPLE;
|
||||
if let ExprKind::Tuple { elts, .. } = &slice.node {
|
||||
if elts
|
||||
.iter()
|
||||
.any(|expr| matches!(expr.node, ExprKind::Starred { .. }))
|
||||
{
|
||||
lvl += 1
|
||||
}
|
||||
}
|
||||
self.p("[")?;
|
||||
self.unparse_expr(slice, lvl)?;
|
||||
self.p("]")?;
|
||||
}
|
||||
ExprKind::Starred { value, .. } => {
|
||||
self.p("*")?;
|
||||
self.unparse_expr(value, precedence::EXPR)?;
|
||||
}
|
||||
ExprKind::Name { id, .. } => self.p(id)?,
|
||||
ExprKind::List { elts, .. } => {
|
||||
self.p("[")?;
|
||||
let mut first = true;
|
||||
for elt in elts {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
self.unparse_expr(elt, precedence::TEST)?;
|
||||
}
|
||||
self.p("]")?;
|
||||
}
|
||||
ExprKind::Tuple { elts, .. } => {
|
||||
if elts.is_empty() {
|
||||
self.p("()")?;
|
||||
} else {
|
||||
group_if!(precedence::TUPLE, {
|
||||
let mut first = true;
|
||||
for elt in elts {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
self.unparse_expr(elt, precedence::TEST)?;
|
||||
}
|
||||
self.p_if(elts.len() == 1, ",")?;
|
||||
})
|
||||
}
|
||||
}
|
||||
ExprKind::Slice { lower, upper, step } => {
|
||||
if let Some(lower) = lower {
|
||||
self.unparse_expr(lower, precedence::TEST)?;
|
||||
}
|
||||
self.p(":")?;
|
||||
if let Some(upper) = upper {
|
||||
self.unparse_expr(upper, precedence::TEST)?;
|
||||
}
|
||||
if let Some(step) = step {
|
||||
self.p(":")?;
|
||||
self.unparse_expr(step, precedence::TEST)?;
|
||||
}
|
||||
}
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
||||
fn unparse_args<U>(&mut self, args: &Arguments<U>) -> fmt::Result {
|
||||
let mut first = true;
|
||||
let defaults_start = args.posonlyargs.len() + args.args.len() - args.defaults.len();
|
||||
for (i, arg) in args.posonlyargs.iter().chain(&args.args).enumerate() {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
self.unparse_arg(arg)?;
|
||||
if let Some(i) = i.checked_sub(defaults_start) {
|
||||
write!(self, "={}", &args.defaults[i])?;
|
||||
}
|
||||
self.p_if(i + 1 == args.posonlyargs.len(), ", /")?;
|
||||
}
|
||||
if args.vararg.is_some() || !args.kwonlyargs.is_empty() {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
self.p("*")?;
|
||||
}
|
||||
if let Some(vararg) = &args.vararg {
|
||||
self.unparse_arg(vararg)?;
|
||||
}
|
||||
let defaults_start = args.kwonlyargs.len() - args.kw_defaults.len();
|
||||
for (i, kwarg) in args.kwonlyargs.iter().enumerate() {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
self.unparse_arg(kwarg)?;
|
||||
if let Some(default) = i
|
||||
.checked_sub(defaults_start)
|
||||
.and_then(|i| args.kw_defaults.get(i))
|
||||
{
|
||||
write!(self, "={}", default)?;
|
||||
}
|
||||
}
|
||||
if let Some(kwarg) = &args.kwarg {
|
||||
self.p_delim(&mut first, ", ")?;
|
||||
self.p("**")?;
|
||||
self.unparse_arg(kwarg)?;
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
fn unparse_arg<U>(&mut self, arg: &Arg<U>) -> fmt::Result {
|
||||
self.p(&arg.node.arg)?;
|
||||
if let Some(ann) = &arg.node.annotation {
|
||||
write!(self, ": {}", **ann)?;
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
||||
fn unparse_comp<U>(&mut self, generators: &[Comprehension<U>]) -> fmt::Result {
|
||||
for comp in generators {
|
||||
self.p(if comp.is_async > 0 {
|
||||
" async for "
|
||||
} else {
|
||||
" for "
|
||||
})?;
|
||||
self.unparse_expr(&comp.target, precedence::TUPLE)?;
|
||||
self.p(" in ")?;
|
||||
self.unparse_expr(&comp.iter, precedence::TEST + 1)?;
|
||||
for cond in &comp.ifs {
|
||||
self.p(" if ")?;
|
||||
self.unparse_expr(cond, precedence::TEST + 1)?;
|
||||
}
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
||||
fn unparse_fstring_body<U>(&mut self, values: &[Expr<U>], is_spec: bool) -> fmt::Result {
|
||||
for value in values {
|
||||
self.unparse_fstring_elem(value, is_spec)?;
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
|
||||
fn unparse_formatted<U>(
|
||||
&mut self,
|
||||
val: &Expr<U>,
|
||||
conversion: usize,
|
||||
spec: Option<&Expr<U>>,
|
||||
) -> fmt::Result {
|
||||
let buffered = to_string_fmt(|f| Unparser::new(f).unparse_expr(val, precedence::TEST + 1));
|
||||
let brace = if buffered.starts_with('{') {
|
||||
// put a space to avoid escaping the bracket
|
||||
"{ "
|
||||
} else {
|
||||
"{"
|
||||
};
|
||||
self.p(brace)?;
|
||||
self.p(&buffered)?;
|
||||
drop(buffered);
|
||||
|
||||
if conversion != ConversionFlag::None as usize {
|
||||
self.p("!")?;
|
||||
let buf = &[conversion as u8];
|
||||
let c = std::str::from_utf8(buf).unwrap();
|
||||
self.p(c)?;
|
||||
}
|
||||
|
||||
if let Some(spec) = spec {
|
||||
self.p(":")?;
|
||||
self.unparse_fstring_elem(spec, true)?;
|
||||
}
|
||||
|
||||
self.p("}")?;
|
||||
|
||||
Ok(())
|
||||
}
|
||||
|
||||
fn unparse_fstring_elem<U>(&mut self, expr: &Expr<U>, is_spec: bool) -> fmt::Result {
|
||||
match &expr.node {
|
||||
ExprKind::Constant { value, .. } => {
|
||||
if let Constant::Str(s) = value {
|
||||
self.unparse_fstring_str(s)
|
||||
} else {
|
||||
unreachable!()
|
||||
}
|
||||
}
|
||||
ExprKind::JoinedStr { values } => self.unparse_joinedstr(values, is_spec),
|
||||
ExprKind::FormattedValue {
|
||||
value,
|
||||
conversion,
|
||||
format_spec,
|
||||
} => self.unparse_formatted(value, *conversion, format_spec.as_deref()),
|
||||
_ => unreachable!(),
|
||||
}
|
||||
}
|
||||
|
||||
fn unparse_fstring_str(&mut self, s: &str) -> fmt::Result {
|
||||
let s = s.replace('{', "{{").replace('}', "}}");
|
||||
self.p(&s)
|
||||
}
|
||||
|
||||
fn unparse_joinedstr<U>(&mut self, values: &[Expr<U>], is_spec: bool) -> fmt::Result {
|
||||
if is_spec {
|
||||
self.unparse_fstring_body(values, is_spec)
|
||||
} else {
|
||||
self.p("f")?;
|
||||
let body = to_string_fmt(|f| Unparser::new(f).unparse_fstring_body(values, is_spec));
|
||||
fmt::Display::fmt(&rustpython_common::str::repr(&body), &mut self.f)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl<U> fmt::Display for Expr<U> {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
Unparser::new(f).unparse_expr(self, precedence::TEST)
|
||||
}
|
||||
}
|
||||
|
||||
fn to_string_fmt(f: impl FnOnce(&mut fmt::Formatter) -> fmt::Result) -> String {
|
||||
use std::cell::Cell;
|
||||
struct Fmt<F>(Cell<Option<F>>);
|
||||
impl<F: FnOnce(&mut fmt::Formatter) -> fmt::Result> fmt::Display for Fmt<F> {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
self.0.take().unwrap()(f)
|
||||
}
|
||||
}
|
||||
Fmt(Cell::new(Some(f))).to_string()
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue