mirror of
https://github.com/nushell/nushell
synced 2025-01-07 18:59:04 +00:00
8df748463d
* WIP * WIP * WIP * Tests are passing * make parser more resilient * lint
1922 lines
66 KiB
Rust
1922 lines
66 KiB
Rust
use std::path::Path;
|
|
|
|
use log::trace;
|
|
use nu_errors::{ArgumentError, ParseError};
|
|
use nu_protocol::hir::{
|
|
self, Binary, Block, ClassifiedBlock, ClassifiedCommand, ClassifiedPipeline, Commands,
|
|
Expression, ExternalRedirection, Flag, FlagKind, InternalCommand, Member, NamedArguments,
|
|
Operator, RangeOperator, SpannedExpression, Unit,
|
|
};
|
|
use nu_protocol::{NamedType, PositionalType, Signature, SyntaxShape, UnspannedPathMember};
|
|
use nu_source::{Span, Spanned, SpannedItem};
|
|
use num_bigint::BigInt;
|
|
|
|
//use crate::errors::{ParseError, ParseResult};
|
|
use crate::lite_parse::{lite_parse, LiteBlock, LiteCommand, LitePipeline};
|
|
use crate::path::expand_path;
|
|
use crate::signature::SignatureRegistry;
|
|
use bigdecimal::BigDecimal;
|
|
|
|
/// Parses a simple column path, one without a variable (implied or explicit) at the head
|
|
pub fn parse_simple_column_path(
|
|
lite_arg: &Spanned<String>,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
let mut delimiter = '.';
|
|
let mut inside_delimiter = false;
|
|
let mut output = vec![];
|
|
let mut current_part = String::new();
|
|
let mut start_index = 0;
|
|
let mut last_index = 0;
|
|
|
|
for (idx, c) in lite_arg.item.char_indices() {
|
|
last_index = idx;
|
|
if inside_delimiter {
|
|
if c == delimiter {
|
|
inside_delimiter = false;
|
|
}
|
|
} else if c == '\'' || c == '"' || c == '`' {
|
|
inside_delimiter = true;
|
|
delimiter = c;
|
|
} else if c == '.' {
|
|
let part_span = Span::new(
|
|
lite_arg.span.start() + start_index,
|
|
lite_arg.span.start() + idx,
|
|
);
|
|
|
|
if let Ok(row_number) = current_part.parse::<u64>() {
|
|
output.push(Member::Int(BigInt::from(row_number), part_span));
|
|
} else {
|
|
let trimmed = trim_quotes(¤t_part);
|
|
output.push(Member::Bare(trimmed.clone().spanned(part_span)));
|
|
}
|
|
current_part.clear();
|
|
// Note: I believe this is safe because of the delimiter we're using, but if we get fancy with
|
|
// unicode we'll need to change this
|
|
start_index = idx + '.'.len_utf8();
|
|
continue;
|
|
}
|
|
current_part.push(c);
|
|
}
|
|
|
|
if !current_part.is_empty() {
|
|
let part_span = Span::new(
|
|
lite_arg.span.start() + start_index,
|
|
lite_arg.span.start() + last_index + 1,
|
|
);
|
|
if let Ok(row_number) = current_part.parse::<u64>() {
|
|
output.push(Member::Int(BigInt::from(row_number), part_span));
|
|
} else {
|
|
let current_part = trim_quotes(¤t_part);
|
|
output.push(Member::Bare(current_part.spanned(part_span)));
|
|
}
|
|
}
|
|
|
|
(
|
|
SpannedExpression::new(Expression::simple_column_path(output), lite_arg.span),
|
|
None,
|
|
)
|
|
}
|
|
|
|
/// Parses a column path, adding in the preceding reference to $it if it's elided
|
|
pub fn parse_full_column_path(
|
|
lite_arg: &Spanned<String>,
|
|
registry: &dyn SignatureRegistry,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
let mut delimiter = '.';
|
|
let mut inside_delimiter = false;
|
|
let mut output = vec![];
|
|
let mut current_part = String::new();
|
|
let mut start_index = 0;
|
|
let mut last_index = 0;
|
|
let mut error = None;
|
|
|
|
let mut head = None;
|
|
|
|
for (idx, c) in lite_arg.item.char_indices() {
|
|
last_index = idx;
|
|
if inside_delimiter {
|
|
if c == delimiter {
|
|
inside_delimiter = false;
|
|
}
|
|
} else if c == '(' {
|
|
inside_delimiter = true;
|
|
delimiter = ')';
|
|
} else if c == '\'' || c == '"' {
|
|
inside_delimiter = true;
|
|
delimiter = c;
|
|
} else if c == '.' {
|
|
let part_span = Span::new(
|
|
lite_arg.span.start() + start_index,
|
|
lite_arg.span.start() + idx,
|
|
);
|
|
|
|
if head.is_none() && current_part.starts_with("$(") && current_part.ends_with(')') {
|
|
let (invoc, err) =
|
|
parse_invocation(¤t_part.clone().spanned(part_span), registry);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
head = Some(invoc.expr);
|
|
} else if head.is_none() && current_part.starts_with('$') {
|
|
// We have the variable head
|
|
head = Some(Expression::variable(current_part.clone(), part_span))
|
|
} else if let Ok(row_number) = current_part.parse::<u64>() {
|
|
output.push(
|
|
UnspannedPathMember::Int(BigInt::from(row_number)).into_path_member(part_span),
|
|
);
|
|
} else {
|
|
let current_part = trim_quotes(¤t_part);
|
|
output.push(
|
|
UnspannedPathMember::String(current_part.clone()).into_path_member(part_span),
|
|
);
|
|
}
|
|
current_part.clear();
|
|
// Note: I believe this is safe because of the delimiter we're using, but if we get fancy with
|
|
// unicode we'll need to change this
|
|
start_index = idx + '.'.len_utf8();
|
|
continue;
|
|
}
|
|
current_part.push(c);
|
|
}
|
|
|
|
if !current_part.is_empty() {
|
|
let part_span = Span::new(
|
|
lite_arg.span.start() + start_index,
|
|
lite_arg.span.start() + last_index + 1,
|
|
);
|
|
|
|
if head.is_none() {
|
|
if current_part.starts_with("$(") && current_part.ends_with(')') {
|
|
let (invoc, err) = parse_invocation(¤t_part.spanned(part_span), registry);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
head = Some(invoc.expr);
|
|
} else if current_part.starts_with('$') {
|
|
head = Some(Expression::variable(current_part, lite_arg.span));
|
|
} else if let Ok(row_number) = current_part.parse::<u64>() {
|
|
output.push(
|
|
UnspannedPathMember::Int(BigInt::from(row_number)).into_path_member(part_span),
|
|
);
|
|
} else {
|
|
let current_part = trim_quotes(¤t_part);
|
|
output.push(UnspannedPathMember::String(current_part).into_path_member(part_span));
|
|
}
|
|
} else if let Ok(row_number) = current_part.parse::<u64>() {
|
|
output.push(
|
|
UnspannedPathMember::Int(BigInt::from(row_number)).into_path_member(part_span),
|
|
);
|
|
} else {
|
|
let current_part = trim_quotes(¤t_part);
|
|
output.push(UnspannedPathMember::String(current_part).into_path_member(part_span));
|
|
}
|
|
}
|
|
|
|
if let Some(head) = head {
|
|
(
|
|
SpannedExpression::new(
|
|
Expression::path(SpannedExpression::new(head, lite_arg.span), output),
|
|
lite_arg.span,
|
|
),
|
|
error,
|
|
)
|
|
} else {
|
|
(
|
|
SpannedExpression::new(
|
|
Expression::path(
|
|
SpannedExpression::new(
|
|
Expression::variable("$it".into(), lite_arg.span),
|
|
lite_arg.span,
|
|
),
|
|
output,
|
|
),
|
|
lite_arg.span,
|
|
),
|
|
error,
|
|
)
|
|
}
|
|
}
|
|
|
|
fn trim_quotes(input: &str) -> String {
|
|
let mut chars = input.chars();
|
|
|
|
match (chars.next(), chars.next_back()) {
|
|
(Some('\''), Some('\'')) => chars.collect(),
|
|
(Some('"'), Some('"')) => chars.collect(),
|
|
(Some('`'), Some('`')) => chars.collect(),
|
|
_ => input.to_string(),
|
|
}
|
|
}
|
|
|
|
/// Parse a numeric range
|
|
fn parse_range(
|
|
lite_arg: &Spanned<String>,
|
|
registry: &dyn SignatureRegistry,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
let lite_arg_span_start = lite_arg.span.start();
|
|
let lite_arg_len = lite_arg.item.len();
|
|
let (dotdot_pos, operator_str, operator) = if let Some(pos) = lite_arg.item.find("..<") {
|
|
(pos, "..<", RangeOperator::RightExclusive)
|
|
} else if let Some(pos) = lite_arg.item.find("..") {
|
|
(pos, "..", RangeOperator::Inclusive)
|
|
} else {
|
|
return (
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("range", lite_arg.clone())),
|
|
);
|
|
};
|
|
|
|
let numbers: Vec<_> = lite_arg.item.split(operator_str).collect();
|
|
|
|
if numbers.len() != 2 {
|
|
return (
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("range", lite_arg.clone())),
|
|
);
|
|
}
|
|
|
|
let right_number_offset = operator_str.len();
|
|
|
|
let lhs = numbers[0].to_string().spanned(Span::new(
|
|
lite_arg_span_start,
|
|
lite_arg_span_start + dotdot_pos,
|
|
));
|
|
let rhs = numbers[1].to_string().spanned(Span::new(
|
|
lite_arg_span_start + dotdot_pos + right_number_offset,
|
|
lite_arg_span_start + lite_arg_len,
|
|
));
|
|
|
|
let left_hand_open = dotdot_pos == 0;
|
|
let right_hand_open = dotdot_pos == lite_arg_len - right_number_offset;
|
|
|
|
let left = if left_hand_open {
|
|
None
|
|
} else if let (left, None) = parse_arg(SyntaxShape::Number, registry, &lhs) {
|
|
Some(left)
|
|
} else {
|
|
return (
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("range", lhs)),
|
|
);
|
|
};
|
|
|
|
let right = if right_hand_open {
|
|
None
|
|
} else if let (right, None) = parse_arg(SyntaxShape::Number, registry, &rhs) {
|
|
Some(right)
|
|
} else {
|
|
return (
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("range", rhs)),
|
|
);
|
|
};
|
|
|
|
(
|
|
SpannedExpression::new(
|
|
Expression::range(
|
|
left,
|
|
operator.spanned(Span::new(
|
|
lite_arg_span_start + dotdot_pos,
|
|
lite_arg_span_start + dotdot_pos + right_number_offset,
|
|
)),
|
|
right,
|
|
),
|
|
lite_arg.span,
|
|
),
|
|
None,
|
|
)
|
|
}
|
|
|
|
/// Parse any allowed operator, including word-based operators
|
|
fn parse_operator(lite_arg: &Spanned<String>) -> (SpannedExpression, Option<ParseError>) {
|
|
let operator = match &lite_arg.item[..] {
|
|
"==" => Operator::Equal,
|
|
"!=" => Operator::NotEqual,
|
|
"<" => Operator::LessThan,
|
|
"<=" => Operator::LessThanOrEqual,
|
|
">" => Operator::GreaterThan,
|
|
">=" => Operator::GreaterThanOrEqual,
|
|
"=~" => Operator::Contains,
|
|
"!~" => Operator::NotContains,
|
|
"+" => Operator::Plus,
|
|
"-" => Operator::Minus,
|
|
"*" => Operator::Multiply,
|
|
"/" => Operator::Divide,
|
|
"in" => Operator::In,
|
|
"not-in" => Operator::NotIn,
|
|
"mod" => Operator::Modulo,
|
|
"&&" => Operator::And,
|
|
"||" => Operator::Or,
|
|
_ => {
|
|
return (
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("operator", lite_arg.clone())),
|
|
);
|
|
}
|
|
};
|
|
|
|
(
|
|
SpannedExpression::new(Expression::operator(operator), lite_arg.span),
|
|
None,
|
|
)
|
|
}
|
|
|
|
/// Parse a unit type, eg '10kb'
|
|
fn parse_unit(lite_arg: &Spanned<String>) -> (SpannedExpression, Option<ParseError>) {
|
|
let unit_groups = [
|
|
(Unit::Byte, vec!["b", "B"]),
|
|
(Unit::Kilobyte, vec!["kb", "KB", "Kb", "kB"]),
|
|
(Unit::Megabyte, vec!["mb", "MB", "Mb", "mB"]),
|
|
(Unit::Gigabyte, vec!["gb", "GB", "Gb", "gB"]),
|
|
(Unit::Terabyte, vec!["tb", "TB", "Tb", "tB"]),
|
|
(Unit::Petabyte, vec!["pb", "PB", "Pb", "pB"]),
|
|
(Unit::Nanosecond, vec!["ns"]),
|
|
(Unit::Microsecond, vec!["us"]),
|
|
(Unit::Millisecond, vec!["ms"]),
|
|
(Unit::Second, vec!["sec"]),
|
|
(Unit::Minute, vec!["min"]),
|
|
(Unit::Hour, vec!["hr"]),
|
|
(Unit::Day, vec!["day"]),
|
|
(Unit::Week, vec!["wk"]),
|
|
(Unit::Month, vec!["mon"]),
|
|
(Unit::Year, vec!["yr"]),
|
|
];
|
|
|
|
for unit_group in unit_groups.iter() {
|
|
for unit in unit_group.1.iter() {
|
|
if lite_arg.item.ends_with(unit) {
|
|
let mut lhs = lite_arg.item.clone();
|
|
|
|
for _ in 0..unit.len() {
|
|
lhs.pop();
|
|
}
|
|
|
|
// these units are allowed to be signed
|
|
if let Ok(x) = lhs.parse::<i64>() {
|
|
let lhs_span =
|
|
Span::new(lite_arg.span.start(), lite_arg.span.start() + lhs.len());
|
|
let unit_span =
|
|
Span::new(lite_arg.span.start() + lhs.len(), lite_arg.span.end());
|
|
return (
|
|
SpannedExpression::new(
|
|
Expression::unit(x.spanned(lhs_span), unit_group.0.spanned(unit_span)),
|
|
lite_arg.span,
|
|
),
|
|
None,
|
|
);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
(
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("unit", lite_arg.clone())),
|
|
)
|
|
}
|
|
|
|
fn parse_invocation(
|
|
lite_arg: &Spanned<String>,
|
|
registry: &dyn SignatureRegistry,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
// We have a command invocation
|
|
let string: String = lite_arg
|
|
.item
|
|
.chars()
|
|
.skip(2)
|
|
.take(lite_arg.item.len() - 3)
|
|
.collect();
|
|
|
|
// We haven't done much with the inner string, so let's go ahead and work with it
|
|
let (lite_block, err) = lite_parse(&string, lite_arg.span.start() + 2);
|
|
if err.is_some() {
|
|
return (garbage(lite_arg.span), err);
|
|
};
|
|
|
|
let classified_block = classify_block(&lite_block, registry);
|
|
let err = classified_block.failed;
|
|
|
|
(
|
|
SpannedExpression::new(
|
|
Expression::Invocation(classified_block.block),
|
|
lite_arg.span,
|
|
),
|
|
err,
|
|
)
|
|
}
|
|
|
|
fn parse_variable(
|
|
lite_arg: &Spanned<String>,
|
|
registry: &dyn SignatureRegistry,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
if lite_arg.item == "$it" {
|
|
trace!("parsing $it");
|
|
parse_full_column_path(lite_arg, registry)
|
|
} else {
|
|
(
|
|
SpannedExpression::new(
|
|
Expression::variable(lite_arg.item.clone(), lite_arg.span),
|
|
lite_arg.span,
|
|
),
|
|
None,
|
|
)
|
|
}
|
|
}
|
|
/// Parses the given lite_arg starting with dollar returning
|
|
/// a expression starting with $
|
|
/// Currently either Variable, Invocation, FullColumnPath
|
|
fn parse_dollar_expr(
|
|
lite_arg: &Spanned<String>,
|
|
registry: &dyn SignatureRegistry,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
trace!("Parsing dollar expression: {:?}", lite_arg.item);
|
|
if lite_arg.item == "$true" {
|
|
(
|
|
SpannedExpression::new(Expression::boolean(true), lite_arg.span),
|
|
None,
|
|
)
|
|
} else if lite_arg.item == "$false" {
|
|
(
|
|
SpannedExpression::new(Expression::boolean(false), lite_arg.span),
|
|
None,
|
|
)
|
|
} else if lite_arg.item.ends_with(')') {
|
|
//Return invocation
|
|
trace!("Parsing invocation expression");
|
|
parse_invocation(lite_arg, registry)
|
|
} else if lite_arg.item.contains('.') {
|
|
trace!("Parsing path expression");
|
|
parse_full_column_path(lite_arg, registry)
|
|
} else {
|
|
trace!("Parsing variable expression");
|
|
parse_variable(lite_arg, registry)
|
|
}
|
|
}
|
|
|
|
#[derive(Debug)]
|
|
enum FormatCommand {
|
|
Text(Spanned<String>),
|
|
Column(Spanned<String>),
|
|
}
|
|
|
|
fn format(input: &str, start: usize) -> (Vec<FormatCommand>, Option<ParseError>) {
|
|
let original_start = start;
|
|
let mut output = vec![];
|
|
let mut error = None;
|
|
|
|
let mut loop_input = input.chars().peekable();
|
|
let mut start = start;
|
|
let mut end = start;
|
|
loop {
|
|
let mut before = String::new();
|
|
|
|
let mut found_start = false;
|
|
while let Some(c) = loop_input.next() {
|
|
end += 1;
|
|
if c == '{' {
|
|
if let Some(x) = loop_input.peek() {
|
|
if *x == '{' {
|
|
found_start = true;
|
|
end += 1;
|
|
let _ = loop_input.next();
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
before.push(c);
|
|
}
|
|
|
|
if !before.is_empty() {
|
|
if found_start {
|
|
output.push(FormatCommand::Text(
|
|
before.to_string().spanned(Span::new(start, end - 2)),
|
|
));
|
|
} else {
|
|
output.push(FormatCommand::Text(before.spanned(Span::new(start, end))));
|
|
break;
|
|
}
|
|
}
|
|
// Look for column as we're now at one
|
|
let mut column = String::new();
|
|
start = end;
|
|
|
|
let mut previous_c = ' ';
|
|
let mut found_end = false;
|
|
while let Some(c) = loop_input.next() {
|
|
end += 1;
|
|
if c == '}' && previous_c == '}' {
|
|
let _ = column.pop();
|
|
found_end = true;
|
|
break;
|
|
}
|
|
previous_c = c;
|
|
column.push(c);
|
|
}
|
|
|
|
if !column.is_empty() {
|
|
if found_end {
|
|
output.push(FormatCommand::Column(
|
|
column.to_string().spanned(Span::new(start, end - 2)),
|
|
));
|
|
} else {
|
|
output.push(FormatCommand::Column(
|
|
column.to_string().spanned(Span::new(start, end)),
|
|
));
|
|
|
|
if error.is_none() {
|
|
error = Some(ParseError::argument_error(
|
|
input.spanned(Span::new(original_start, end)),
|
|
ArgumentError::MissingValueForName("unclosed {{ }}".to_string()),
|
|
));
|
|
}
|
|
}
|
|
}
|
|
|
|
if found_start && !found_end {
|
|
error = Some(ParseError::argument_error(
|
|
input.spanned(Span::new(original_start, end)),
|
|
ArgumentError::MissingValueForName("unclosed {{ }}".to_string()),
|
|
));
|
|
}
|
|
|
|
if before.is_empty() && column.is_empty() {
|
|
break;
|
|
}
|
|
|
|
start = end;
|
|
}
|
|
|
|
(output, error)
|
|
}
|
|
|
|
/// Parses an interpolated string, one that has expressions inside of it
|
|
fn parse_interpolated_string(
|
|
registry: &dyn SignatureRegistry,
|
|
lite_arg: &Spanned<String>,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
trace!("Parse_interpolated_string");
|
|
let inner_string = trim_quotes(&lite_arg.item);
|
|
let mut error = None;
|
|
|
|
let (format_result, err) = format(&inner_string, lite_arg.span.start() + 1);
|
|
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
|
|
let mut output = vec![];
|
|
|
|
for f in format_result {
|
|
match f {
|
|
FormatCommand::Text(t) => {
|
|
output.push(SpannedExpression {
|
|
expr: Expression::Literal(hir::Literal::String(t.item)),
|
|
span: t.span,
|
|
});
|
|
}
|
|
FormatCommand::Column(c) => {
|
|
let (o, err) = parse_full_column_path(&c, registry);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
output.push(o);
|
|
}
|
|
}
|
|
}
|
|
|
|
let block = vec![Commands {
|
|
span: lite_arg.span,
|
|
list: vec![ClassifiedCommand::Internal(InternalCommand {
|
|
name: "build-string".to_owned(),
|
|
name_span: lite_arg.span,
|
|
args: hir::Call {
|
|
head: Box::new(SpannedExpression {
|
|
expr: Expression::Synthetic(hir::Synthetic::String("build-string".to_owned())),
|
|
span: lite_arg.span,
|
|
}),
|
|
external_redirection: ExternalRedirection::Stdout,
|
|
named: None,
|
|
positional: Some(output),
|
|
span: lite_arg.span,
|
|
},
|
|
})],
|
|
}];
|
|
|
|
let call = SpannedExpression {
|
|
expr: Expression::Invocation(Block::new(vec![], block, lite_arg.span)),
|
|
span: lite_arg.span,
|
|
};
|
|
|
|
(call, error)
|
|
}
|
|
|
|
/// Parses the given argument using the shape as a guide for how to correctly parse the argument
|
|
fn parse_external_arg(
|
|
registry: &dyn SignatureRegistry,
|
|
lite_arg: &Spanned<String>,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
if lite_arg.item.starts_with('$') {
|
|
return parse_dollar_expr(&lite_arg, registry);
|
|
}
|
|
|
|
if lite_arg.item.starts_with('`') && lite_arg.item.len() > 1 && lite_arg.item.ends_with('`') {
|
|
// This is an interpolated string
|
|
parse_interpolated_string(registry, &lite_arg)
|
|
} else {
|
|
(
|
|
SpannedExpression::new(Expression::string(lite_arg.item.clone()), lite_arg.span),
|
|
None,
|
|
)
|
|
}
|
|
}
|
|
|
|
fn parse_list(
|
|
lite_block: &LiteBlock,
|
|
registry: &dyn SignatureRegistry,
|
|
) -> (Vec<SpannedExpression>, Option<ParseError>) {
|
|
let mut error = None;
|
|
|
|
if lite_block.block.is_empty() {
|
|
return (vec![], None);
|
|
}
|
|
let lite_pipeline = &lite_block.block[0];
|
|
let mut output = vec![];
|
|
for lite_pipeline in &lite_pipeline.pipelines {
|
|
for lite_inner in &lite_pipeline.commands {
|
|
for part in &lite_inner.parts {
|
|
let item = if part.ends_with(',') {
|
|
let mut str: String = part.item.clone();
|
|
str.pop();
|
|
str.spanned(Span::new(part.span.start(), part.span.end() - 1))
|
|
} else {
|
|
part.clone()
|
|
};
|
|
let (part, err) = parse_arg(SyntaxShape::Any, registry, &item);
|
|
output.push(part);
|
|
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
(output, error)
|
|
}
|
|
|
|
fn verify_and_strip(
|
|
contents: &Spanned<String>,
|
|
left: char,
|
|
right: char,
|
|
) -> (String, Option<ParseError>) {
|
|
let mut chars = contents.item.chars();
|
|
|
|
match (chars.next(), chars.next_back()) {
|
|
(Some(l), Some(r)) if l == left && r == right => {
|
|
let output: String = chars.collect();
|
|
(output, None)
|
|
}
|
|
_ => (
|
|
String::new(),
|
|
Some(ParseError::mismatch(
|
|
format!("value in {} {}", left, right),
|
|
contents.clone(),
|
|
)),
|
|
),
|
|
}
|
|
}
|
|
|
|
fn parse_table(
|
|
lite_block: &LiteBlock,
|
|
registry: &dyn SignatureRegistry,
|
|
span: Span,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
let mut error = None;
|
|
let mut output = vec![];
|
|
|
|
// Header
|
|
let lite_group = &lite_block.block[0];
|
|
let lite_pipeline = &lite_group.pipelines[0];
|
|
let lite_inner = &lite_pipeline.commands[0];
|
|
|
|
let (string, err) = verify_and_strip(&lite_inner.parts[0], '[', ']');
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
|
|
let (lite_header, err) = lite_parse(&string, lite_inner.parts[0].span.start() + 1);
|
|
if err.is_some() {
|
|
return (garbage(lite_inner.span()), err);
|
|
}
|
|
|
|
let (headers, err) = parse_list(&lite_header, registry);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
|
|
// Cells
|
|
let lite_rows = &lite_group.pipelines[1];
|
|
let lite_cells = &lite_rows.commands[0];
|
|
|
|
for arg in &lite_cells.parts {
|
|
let (string, err) = verify_and_strip(&arg, '[', ']');
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
let (lite_cell, err) = lite_parse(&string, arg.span.start() + 1);
|
|
if err.is_some() {
|
|
return (garbage(arg.span), err);
|
|
}
|
|
let (inner_cell, err) = parse_list(&lite_cell, registry);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
output.push(inner_cell);
|
|
}
|
|
|
|
(
|
|
SpannedExpression::new(Expression::Table(headers, output), span),
|
|
error,
|
|
)
|
|
}
|
|
|
|
/// Parses the given argument using the shape as a guide for how to correctly parse the argument
|
|
fn parse_arg(
|
|
expected_type: SyntaxShape,
|
|
registry: &dyn SignatureRegistry,
|
|
lite_arg: &Spanned<String>,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
if lite_arg.item.starts_with('$') && !lite_arg.item.contains("..") {
|
|
return parse_dollar_expr(&lite_arg, registry);
|
|
}
|
|
|
|
match expected_type {
|
|
SyntaxShape::Number => {
|
|
if let Ok(x) = lite_arg.item.parse::<BigInt>() {
|
|
(
|
|
SpannedExpression::new(Expression::integer(x), lite_arg.span),
|
|
None,
|
|
)
|
|
} else if let Ok(x) = lite_arg.item.parse::<BigDecimal>() {
|
|
(
|
|
SpannedExpression::new(Expression::decimal(x), lite_arg.span),
|
|
None,
|
|
)
|
|
} else {
|
|
(
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("number", lite_arg.clone())),
|
|
)
|
|
}
|
|
}
|
|
SyntaxShape::Int => {
|
|
if let Ok(x) = lite_arg.item.parse::<BigInt>() {
|
|
(
|
|
SpannedExpression::new(Expression::integer(x), lite_arg.span),
|
|
None,
|
|
)
|
|
} else {
|
|
(
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("int", lite_arg.clone())),
|
|
)
|
|
}
|
|
}
|
|
SyntaxShape::String => {
|
|
if lite_arg.item.starts_with('`')
|
|
&& lite_arg.item.len() > 1
|
|
&& lite_arg.item.ends_with('`')
|
|
{
|
|
// This is an interpolated string
|
|
parse_interpolated_string(registry, &lite_arg)
|
|
} else {
|
|
let trimmed = trim_quotes(&lite_arg.item);
|
|
(
|
|
SpannedExpression::new(Expression::string(trimmed), lite_arg.span),
|
|
None,
|
|
)
|
|
}
|
|
}
|
|
SyntaxShape::Pattern => {
|
|
let trimmed = trim_quotes(&lite_arg.item);
|
|
let expanded = expand_path(&trimmed).to_string();
|
|
(
|
|
SpannedExpression::new(Expression::pattern(expanded), lite_arg.span),
|
|
None,
|
|
)
|
|
}
|
|
|
|
SyntaxShape::Range => parse_range(&lite_arg, registry),
|
|
SyntaxShape::Operator => parse_operator(&lite_arg),
|
|
SyntaxShape::Unit => parse_unit(&lite_arg),
|
|
SyntaxShape::Path => {
|
|
let trimmed = trim_quotes(&lite_arg.item);
|
|
let expanded = expand_path(&trimmed).to_string();
|
|
let path = Path::new(&expanded);
|
|
(
|
|
SpannedExpression::new(Expression::FilePath(path.to_path_buf()), lite_arg.span),
|
|
None,
|
|
)
|
|
}
|
|
SyntaxShape::ColumnPath => parse_simple_column_path(lite_arg),
|
|
SyntaxShape::FullColumnPath => parse_full_column_path(lite_arg, registry),
|
|
SyntaxShape::Any => {
|
|
let shapes = vec![
|
|
SyntaxShape::Int,
|
|
SyntaxShape::Number,
|
|
SyntaxShape::Range,
|
|
SyntaxShape::Unit,
|
|
SyntaxShape::Block,
|
|
SyntaxShape::Table,
|
|
SyntaxShape::String,
|
|
];
|
|
for shape in shapes.iter() {
|
|
if let (s, None) = parse_arg(*shape, registry, lite_arg) {
|
|
return (s, None);
|
|
}
|
|
}
|
|
(
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("any shape", lite_arg.clone())),
|
|
)
|
|
}
|
|
SyntaxShape::Table => {
|
|
let mut chars = lite_arg.item.chars();
|
|
|
|
match (chars.next(), chars.next_back()) {
|
|
(Some('['), Some(']')) => {
|
|
// We have a literal row
|
|
let string: String = chars.collect();
|
|
|
|
// We haven't done much with the inner string, so let's go ahead and work with it
|
|
let (lite_block, err) = lite_parse(&string, lite_arg.span.start() + 1);
|
|
if err.is_some() {
|
|
return (garbage(lite_arg.span), err);
|
|
}
|
|
let lite_groups = &lite_block.block;
|
|
|
|
if lite_groups.is_empty() {
|
|
return (
|
|
SpannedExpression::new(Expression::List(vec![]), lite_arg.span),
|
|
None,
|
|
);
|
|
}
|
|
if lite_groups[0].pipelines.len() == 1 {
|
|
let (items, err) = parse_list(&lite_block, registry);
|
|
(
|
|
SpannedExpression::new(Expression::List(items), lite_arg.span),
|
|
err,
|
|
)
|
|
} else if lite_groups[0].pipelines.len() == 2 {
|
|
parse_table(&lite_block, registry, lite_arg.span)
|
|
} else {
|
|
(
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch(
|
|
"list or table",
|
|
"unknown".to_string().spanned(lite_arg.span),
|
|
)),
|
|
)
|
|
}
|
|
}
|
|
_ => (
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("table", lite_arg.clone())),
|
|
),
|
|
}
|
|
}
|
|
SyntaxShape::Block | SyntaxShape::Math => {
|
|
// Blocks have one of two forms: the literal block and the implied block
|
|
// To parse a literal block, we need to detect that what we have is itself a block
|
|
let mut chars = lite_arg.item.chars();
|
|
|
|
match (chars.next(), chars.next_back()) {
|
|
(Some('{'), Some('}')) => {
|
|
// We have a literal block
|
|
let string: String = chars.collect();
|
|
|
|
// We haven't done much with the inner string, so let's go ahead and work with it
|
|
let (lite_block, err) = lite_parse(&string, lite_arg.span.start() + 1);
|
|
if err.is_some() {
|
|
return (garbage(lite_arg.span), err);
|
|
}
|
|
|
|
let classified_block = classify_block(&lite_block, registry);
|
|
let error = classified_block.failed;
|
|
|
|
(
|
|
SpannedExpression::new(
|
|
Expression::Block(classified_block.block),
|
|
lite_arg.span,
|
|
),
|
|
error,
|
|
)
|
|
}
|
|
_ => {
|
|
// We have an implied block, but we can't parse this here
|
|
// it needed to have been parsed up higher where we have control over more than one arg
|
|
(
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("block", lite_arg.clone())),
|
|
)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod test {
|
|
use super::*;
|
|
|
|
#[derive(Clone, Debug)]
|
|
struct MockRegistry {}
|
|
|
|
impl MockRegistry {
|
|
fn new() -> Self {
|
|
MockRegistry {}
|
|
}
|
|
}
|
|
|
|
impl SignatureRegistry for MockRegistry {
|
|
fn has(&self, _name: &str) -> bool {
|
|
false
|
|
}
|
|
|
|
fn get(&self, _name: &str) -> Option<nu_protocol::Signature> {
|
|
None
|
|
}
|
|
|
|
fn clone_box(&self) -> Box<dyn SignatureRegistry> {
|
|
Box::new(self.clone())
|
|
}
|
|
}
|
|
|
|
#[test]
|
|
fn parse_integer() -> Result<(), ParseError> {
|
|
let raw = "32".to_string();
|
|
let input = raw.clone().spanned(Span::new(0, raw.len()));
|
|
let registry = MockRegistry::new();
|
|
let result = parse_arg(SyntaxShape::Int, ®istry, &input);
|
|
assert_eq!(result.1, None);
|
|
assert_eq!(result.0.expr, Expression::integer(BigInt::from(32)));
|
|
Ok(())
|
|
}
|
|
|
|
#[test]
|
|
fn parse_number() -> Result<(), ParseError> {
|
|
let registry = MockRegistry::new();
|
|
|
|
let raw = "-32.2".to_string();
|
|
let input = raw.clone().spanned(Span::new(0, raw.len()));
|
|
let result = parse_arg(SyntaxShape::Number, ®istry, &input);
|
|
assert_eq!(result.1, None);
|
|
assert_eq!(
|
|
result.0.expr,
|
|
Expression::decimal(BigDecimal::new(BigInt::from(-322), 1))
|
|
);
|
|
|
|
let raw = "32.2".to_string();
|
|
let input = raw.clone().spanned(Span::new(0, raw.len()));
|
|
let result = parse_arg(SyntaxShape::Number, ®istry, &input);
|
|
assert_eq!(result.1, None);
|
|
assert_eq!(
|
|
result.0.expr,
|
|
Expression::decimal(BigDecimal::new(BigInt::from(322), 1))
|
|
);
|
|
|
|
let raw = "36893488147419103232.54".to_string();
|
|
let input = raw.clone().spanned(Span::new(0, raw.len()));
|
|
let result = parse_arg(SyntaxShape::Number, ®istry, &input);
|
|
assert_eq!(result.1, None);
|
|
assert_eq!(
|
|
result.0.expr,
|
|
Expression::decimal(BigDecimal::new(
|
|
BigInt::from(3689348814741910323254 as i128),
|
|
2
|
|
))
|
|
);
|
|
|
|
let raw = "-34".to_string();
|
|
let input = raw.clone().spanned(Span::new(0, raw.len()));
|
|
let result = parse_arg(SyntaxShape::Number, ®istry, &input);
|
|
assert_eq!(result.1, None);
|
|
assert_eq!(result.0.expr, Expression::integer(BigInt::from(-34)));
|
|
|
|
let raw = "34".to_string();
|
|
let input = raw.clone().spanned(Span::new(0, raw.len()));
|
|
let result = parse_arg(SyntaxShape::Number, ®istry, &input);
|
|
assert_eq!(result.1, None);
|
|
assert_eq!(result.0.expr, Expression::integer(BigInt::from(34)));
|
|
|
|
let raw = "36893488147419103232".to_string();
|
|
let input = raw.clone().spanned(Span::new(0, raw.len()));
|
|
let result = parse_arg(SyntaxShape::Number, ®istry, &input);
|
|
assert_eq!(result.1, None);
|
|
assert_eq!(
|
|
result.0.expr,
|
|
Expression::integer(BigInt::from(36893488147419103232 as u128))
|
|
);
|
|
|
|
Ok(())
|
|
}
|
|
}
|
|
|
|
/// Match the available flags in a signature with what the user provided. This will check both long-form flags (--long) and shorthand flags (-l)
|
|
/// This also allows users to provide a group of shorthand flags (-la) that correspond to multiple shorthand flags at once.
|
|
fn get_flags_from_flag(
|
|
signature: &nu_protocol::Signature,
|
|
cmd: &Spanned<String>,
|
|
arg: &Spanned<String>,
|
|
) -> (Vec<(String, NamedType)>, Option<ParseError>) {
|
|
if arg.item.starts_with('-') {
|
|
// It's a flag (or set of flags)
|
|
let mut output = vec![];
|
|
let mut error = None;
|
|
|
|
let remainder: String = arg.item.chars().skip(1).collect();
|
|
|
|
if remainder.starts_with('-') {
|
|
// Long flag expected
|
|
let remainder: String = remainder.chars().skip(1).collect();
|
|
if let Some((named_type, _)) = signature.named.get(&remainder) {
|
|
output.push((remainder.clone(), named_type.clone()));
|
|
} else {
|
|
error = Some(ParseError::argument_error(
|
|
cmd.clone(),
|
|
ArgumentError::UnexpectedFlag(arg.clone()),
|
|
));
|
|
}
|
|
} else {
|
|
// Short flag(s) expected
|
|
let mut starting_pos = arg.span.start() + 1;
|
|
for c in remainder.chars() {
|
|
let mut found = false;
|
|
for (full_name, named_arg) in signature.named.iter() {
|
|
if Some(c) == named_arg.0.get_short() {
|
|
found = true;
|
|
output.push((full_name.clone(), named_arg.0.clone()));
|
|
break;
|
|
}
|
|
}
|
|
|
|
if !found {
|
|
error = Some(ParseError::argument_error(
|
|
cmd.clone(),
|
|
ArgumentError::UnexpectedFlag(
|
|
arg.item
|
|
.clone()
|
|
.spanned(Span::new(starting_pos, starting_pos + c.len_utf8())),
|
|
),
|
|
));
|
|
}
|
|
|
|
starting_pos += c.len_utf8();
|
|
}
|
|
}
|
|
|
|
(output, error)
|
|
} else {
|
|
// It's not a flag, so don't bother with it
|
|
(vec![], None)
|
|
}
|
|
}
|
|
|
|
/// This is a bit of a "fix-up" of previously parsed areas. In cases where we're in shorthand mode (eg in the `where` command), we need
|
|
/// to use the original source to parse a column path. Without it, we'll lose a little too much information to parse it correctly. As we'll
|
|
/// only know we were on the left-hand side of an expression after we do the full math parse, we need to do this step after rather than during
|
|
/// the initial parse.
|
|
fn shorthand_reparse(
|
|
left: SpannedExpression,
|
|
orig_left: Option<Spanned<String>>,
|
|
registry: &dyn SignatureRegistry,
|
|
shorthand_mode: bool,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
// If we're in shorthand mode, we need to reparse the left-hand side if possible
|
|
if shorthand_mode {
|
|
if let Some(orig_left) = orig_left {
|
|
parse_arg(SyntaxShape::FullColumnPath, registry, &orig_left)
|
|
} else {
|
|
(left, None)
|
|
}
|
|
} else {
|
|
(left, None)
|
|
}
|
|
}
|
|
|
|
fn parse_parenthesized_expression(
|
|
lite_arg: &Spanned<String>,
|
|
registry: &dyn SignatureRegistry,
|
|
shorthand_mode: bool,
|
|
) -> (SpannedExpression, Option<ParseError>) {
|
|
let mut chars = lite_arg.item.chars();
|
|
|
|
match (chars.next(), chars.next_back()) {
|
|
(Some('('), Some(')')) => {
|
|
// We have a literal row
|
|
let string: String = chars.collect();
|
|
|
|
// We haven't done much with the inner string, so let's go ahead and work with it
|
|
let (lite_block, err) = lite_parse(&string, lite_arg.span.start() + 1);
|
|
if err.is_some() {
|
|
return (garbage(lite_arg.span), err);
|
|
}
|
|
|
|
if lite_block.block.len() != 1 {
|
|
return (
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("math expression", lite_arg.clone())),
|
|
);
|
|
}
|
|
|
|
let mut lite_pipeline = lite_block.block[0].clone();
|
|
|
|
let mut collection = vec![];
|
|
for lite_pipeline in lite_pipeline.pipelines.iter_mut() {
|
|
for lite_cmd in lite_pipeline.commands.iter_mut() {
|
|
collection.append(&mut lite_cmd.parts);
|
|
}
|
|
}
|
|
let (_, expr, err) =
|
|
parse_math_expression(0, &collection[..], registry, shorthand_mode);
|
|
(expr, err)
|
|
}
|
|
_ => (
|
|
garbage(lite_arg.span),
|
|
Some(ParseError::mismatch("table", lite_arg.clone())),
|
|
),
|
|
}
|
|
}
|
|
|
|
fn parse_possibly_parenthesized(
|
|
lite_arg: &Spanned<String>,
|
|
registry: &dyn SignatureRegistry,
|
|
shorthand_mode: bool,
|
|
) -> (
|
|
(Option<Spanned<String>>, SpannedExpression),
|
|
Option<ParseError>,
|
|
) {
|
|
if lite_arg.item.starts_with('(') {
|
|
let (lhs, err) = parse_parenthesized_expression(lite_arg, registry, shorthand_mode);
|
|
((None, lhs), err)
|
|
} else {
|
|
let (lhs, err) = parse_arg(SyntaxShape::Any, registry, lite_arg);
|
|
((Some(lite_arg.clone()), lhs), err)
|
|
}
|
|
}
|
|
|
|
/// Handle parsing math expressions, complete with working with the precedence of the operators
|
|
fn parse_math_expression(
|
|
incoming_idx: usize,
|
|
lite_args: &[Spanned<String>],
|
|
registry: &dyn SignatureRegistry,
|
|
shorthand_mode: bool,
|
|
) -> (usize, SpannedExpression, Option<ParseError>) {
|
|
// Precedence parsing is included
|
|
// Short_hand mode means that the left-hand side of an expression can point to a column-path. To make this possible,
|
|
// we parse as normal, but then go back and when we detect a left-hand side, reparse that value if it's a string
|
|
|
|
let mut idx = 0;
|
|
let mut error = None;
|
|
|
|
let mut working_exprs = vec![];
|
|
let mut prec = vec![];
|
|
|
|
let (lhs_working_expr, err) =
|
|
parse_possibly_parenthesized(&lite_args[idx], registry, shorthand_mode);
|
|
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
working_exprs.push(lhs_working_expr);
|
|
|
|
idx += 1;
|
|
|
|
prec.push(0);
|
|
|
|
while idx < lite_args.len() {
|
|
let (op, err) = parse_arg(SyntaxShape::Operator, registry, &lite_args[idx]);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
idx += 1;
|
|
|
|
if idx < lite_args.len() {
|
|
trace!(
|
|
"idx: {} working_exprs: {:#?} prec: {:?}",
|
|
idx,
|
|
working_exprs,
|
|
prec
|
|
);
|
|
|
|
let (rhs_working_expr, err) =
|
|
parse_possibly_parenthesized(&lite_args[idx], registry, shorthand_mode);
|
|
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
|
|
let next_prec = op.precedence();
|
|
|
|
if !prec.is_empty() && next_prec > *prec.last().expect("this shouldn't happen") {
|
|
prec.push(next_prec);
|
|
working_exprs.push((None, op));
|
|
working_exprs.push(rhs_working_expr);
|
|
} else {
|
|
while !prec.is_empty()
|
|
&& *prec.last().expect("This shouldn't happen") >= next_prec
|
|
&& next_prec > 0 // Not garbage
|
|
&& working_exprs.len() >= 3
|
|
{
|
|
// Pop 3 and create and expression, push and repeat
|
|
trace!(
|
|
"idx: {} working_exprs: {:#?} prec: {:?}",
|
|
idx,
|
|
working_exprs,
|
|
prec
|
|
);
|
|
let (_, right) = working_exprs.pop().expect("This shouldn't be possible");
|
|
let (_, op) = working_exprs.pop().expect("This shouldn't be possible");
|
|
let (orig_left, left) =
|
|
working_exprs.pop().expect("This shouldn't be possible");
|
|
|
|
// If we're in shorthand mode, we need to reparse the left-hand side if possibe
|
|
let (left, err) = shorthand_reparse(left, orig_left, registry, shorthand_mode);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
|
|
let span = Span::new(left.span.start(), right.span.end());
|
|
working_exprs.push((
|
|
None,
|
|
SpannedExpression {
|
|
expr: Expression::Binary(Box::new(Binary { left, op, right })),
|
|
span,
|
|
},
|
|
));
|
|
prec.pop();
|
|
}
|
|
working_exprs.push((None, op));
|
|
working_exprs.push(rhs_working_expr);
|
|
prec.push(next_prec);
|
|
}
|
|
|
|
idx += 1;
|
|
} else {
|
|
if error.is_none() {
|
|
error = Some(ParseError::argument_error(
|
|
lite_args[idx - 1].clone(),
|
|
ArgumentError::MissingMandatoryPositional("right hand side".into()),
|
|
));
|
|
}
|
|
working_exprs.push((None, garbage(op.span)));
|
|
working_exprs.push((None, garbage(op.span)));
|
|
prec.push(0);
|
|
}
|
|
}
|
|
|
|
while working_exprs.len() >= 3 {
|
|
// Pop 3 and create and expression, push and repeat
|
|
let (_, right) = working_exprs.pop().expect("This shouldn't be possible");
|
|
let (_, op) = working_exprs.pop().expect("This shouldn't be possible");
|
|
let (orig_left, left) = working_exprs.pop().expect("This shouldn't be possible");
|
|
|
|
let (left, err) = shorthand_reparse(left, orig_left, registry, shorthand_mode);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
|
|
let span = Span::new(left.span.start(), right.span.end());
|
|
working_exprs.push((
|
|
None,
|
|
SpannedExpression {
|
|
expr: Expression::Binary(Box::new(Binary { left, op, right })),
|
|
span,
|
|
},
|
|
));
|
|
}
|
|
|
|
let (orig_left, left) = working_exprs.pop().expect("This shouldn't be possible");
|
|
let (left, err) = shorthand_reparse(left, orig_left, registry, shorthand_mode);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
|
|
(incoming_idx + idx, left, error)
|
|
}
|
|
|
|
/// Handles parsing the positional arguments as a batch
|
|
/// This allows us to check for times where multiple arguments are treated as one shape, as is the case with SyntaxShape::Math
|
|
fn parse_positional_argument(
|
|
idx: usize,
|
|
lite_cmd: &LiteCommand,
|
|
positional_type: &PositionalType,
|
|
remaining_positionals: usize,
|
|
registry: &dyn SignatureRegistry,
|
|
) -> (usize, SpannedExpression, Option<ParseError>) {
|
|
let mut idx = idx;
|
|
let mut error = None;
|
|
let arg = match positional_type {
|
|
PositionalType::Mandatory(_, SyntaxShape::Math)
|
|
| PositionalType::Optional(_, SyntaxShape::Math) => {
|
|
// A condition can take up multiple arguments, as we build the operation as <arg> <operator> <arg>
|
|
// We need to do this here because in parse_arg, we have access to only one arg at a time
|
|
|
|
if idx < lite_cmd.parts.len() {
|
|
if lite_cmd.parts[idx].item.starts_with('{') {
|
|
// It's an explicit math expression, so parse it deeper in
|
|
let (arg, err) = parse_arg(SyntaxShape::Math, registry, &lite_cmd.parts[idx]);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
arg
|
|
} else {
|
|
let end_idx = if (lite_cmd.parts.len() - 1) > remaining_positionals {
|
|
lite_cmd.parts.len() - remaining_positionals
|
|
} else {
|
|
lite_cmd.parts.len()
|
|
};
|
|
|
|
let (new_idx, arg, err) =
|
|
parse_math_expression(idx, &lite_cmd.parts[idx..end_idx], registry, true);
|
|
|
|
let span = arg.span;
|
|
let mut commands = hir::Commands::new(span);
|
|
commands.push(ClassifiedCommand::Expr(Box::new(arg)));
|
|
|
|
let block = hir::Block::new(vec![], vec![commands], span);
|
|
|
|
let arg = SpannedExpression::new(Expression::Block(block), span);
|
|
|
|
idx = new_idx - 1;
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
arg
|
|
}
|
|
} else {
|
|
if error.is_none() {
|
|
error = Some(ParseError::argument_error(
|
|
lite_cmd.parts[0].clone(),
|
|
ArgumentError::MissingMandatoryPositional("condition".into()),
|
|
))
|
|
}
|
|
garbage(lite_cmd.span())
|
|
}
|
|
}
|
|
PositionalType::Mandatory(_, shape) | PositionalType::Optional(_, shape) => {
|
|
let (arg, err) = parse_arg(*shape, registry, &lite_cmd.parts[idx]);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
arg
|
|
}
|
|
};
|
|
|
|
(idx, arg, error)
|
|
}
|
|
|
|
/// Does a full parse of an internal command using the lite-ly parse command as a starting point
|
|
/// This main focus at this level is to understand what flags were passed in, what positional arguments were passed in, what rest arguments were passed in
|
|
/// and to ensure that the basic requirements in terms of number of each were met.
|
|
fn parse_internal_command(
|
|
lite_cmd: &LiteCommand,
|
|
registry: &dyn SignatureRegistry,
|
|
signature: &Signature,
|
|
mut idx: usize,
|
|
) -> (InternalCommand, Option<ParseError>) {
|
|
// This is a known internal command, so we need to work with the arguments and parse them according to the expected types
|
|
|
|
let (name, name_span) = (
|
|
lite_cmd.parts[0..(idx + 1)]
|
|
.iter()
|
|
.map(|x| x.item.clone())
|
|
.collect::<Vec<String>>()
|
|
.join(" "),
|
|
Span::new(
|
|
lite_cmd.parts[0].span.start(),
|
|
lite_cmd.parts[idx].span.end(),
|
|
),
|
|
);
|
|
|
|
let mut internal_command = InternalCommand::new(name, name_span, lite_cmd.span());
|
|
internal_command.args.set_initial_flags(&signature);
|
|
|
|
let mut current_positional = 0;
|
|
let mut named = NamedArguments::new();
|
|
let mut positional = vec![];
|
|
let mut error = None;
|
|
idx += 1; // Start where the arguments begin
|
|
|
|
while idx < lite_cmd.parts.len() {
|
|
if lite_cmd.parts[idx].item.starts_with('-') && lite_cmd.parts[idx].item.len() > 1 {
|
|
let (named_types, err) =
|
|
get_flags_from_flag(&signature, &lite_cmd.parts[0], &lite_cmd.parts[idx]);
|
|
|
|
if err.is_none() {
|
|
for (full_name, named_type) in &named_types {
|
|
match named_type {
|
|
NamedType::Mandatory(_, shape) | NamedType::Optional(_, shape) => {
|
|
if idx == lite_cmd.parts.len() {
|
|
// Oops, we're missing the argument to our named argument
|
|
if error.is_none() {
|
|
error = Some(ParseError::argument_error(
|
|
lite_cmd.parts[0].clone(),
|
|
ArgumentError::MissingValueForName(format!("{:?}", shape)),
|
|
));
|
|
}
|
|
} else {
|
|
idx += 1;
|
|
if lite_cmd.parts.len() > idx {
|
|
let (arg, err) =
|
|
parse_arg(*shape, registry, &lite_cmd.parts[idx]);
|
|
named.insert_mandatory(
|
|
full_name.clone(),
|
|
lite_cmd.parts[idx - 1].span,
|
|
arg,
|
|
);
|
|
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
} else if error.is_none() {
|
|
error = Some(ParseError::argument_error(
|
|
lite_cmd.parts[0].clone(),
|
|
ArgumentError::MissingValueForName(full_name.to_owned()),
|
|
));
|
|
}
|
|
}
|
|
}
|
|
NamedType::Switch(_) => {
|
|
named.insert_switch(
|
|
full_name.clone(),
|
|
Some(Flag::new(FlagKind::Longhand, lite_cmd.parts[idx].span)),
|
|
);
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
positional.push(garbage(lite_cmd.parts[idx].span));
|
|
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
}
|
|
} else if signature.positional.len() > current_positional {
|
|
let arg = {
|
|
let (new_idx, expr, err) = parse_positional_argument(
|
|
idx,
|
|
&lite_cmd,
|
|
&signature.positional[current_positional].0,
|
|
signature.positional.len() - current_positional - 1,
|
|
registry,
|
|
);
|
|
idx = new_idx;
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
expr
|
|
};
|
|
|
|
positional.push(arg);
|
|
current_positional += 1;
|
|
} else if let Some((rest_type, _)) = &signature.rest_positional {
|
|
let (arg, err) = parse_arg(*rest_type, registry, &lite_cmd.parts[idx]);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
|
|
positional.push(arg);
|
|
current_positional += 1;
|
|
} else {
|
|
positional.push(garbage(lite_cmd.parts[idx].span));
|
|
|
|
if error.is_none() {
|
|
error = Some(ParseError::argument_error(
|
|
lite_cmd.parts[0].clone(),
|
|
ArgumentError::UnexpectedArgument(lite_cmd.parts[idx].clone()),
|
|
));
|
|
}
|
|
}
|
|
|
|
idx += 1;
|
|
}
|
|
|
|
// Count the required positional arguments and ensure these have been met
|
|
let mut required_arg_count = 0;
|
|
for positional_arg in &signature.positional {
|
|
if let PositionalType::Mandatory(_, _) = positional_arg.0 {
|
|
required_arg_count += 1;
|
|
}
|
|
}
|
|
if positional.len() < required_arg_count && error.is_none() {
|
|
// to make "command -h" work even if required arguments are missing
|
|
if !named.named.contains_key("help") {
|
|
let (_, name) = &signature.positional[positional.len()];
|
|
error = Some(ParseError::argument_error(
|
|
lite_cmd.parts[0].clone(),
|
|
ArgumentError::MissingMandatoryPositional(name.to_owned()),
|
|
));
|
|
}
|
|
}
|
|
|
|
if !named.is_empty() {
|
|
internal_command.args.named = Some(named);
|
|
}
|
|
|
|
if !positional.is_empty() {
|
|
internal_command.args.positional = Some(positional);
|
|
}
|
|
|
|
(internal_command, error)
|
|
}
|
|
|
|
/// Convert a lite-ly parsed pipeline into a fully classified pipeline, ready to be evaluated.
|
|
/// This conversion does error-recovery, so the result is allowed to be lossy. A lossy unit is designated as garbage.
|
|
/// Errors are returned as part of a side-car error rather than a Result to allow both error and lossy result simultaneously.
|
|
fn classify_pipeline(
|
|
lite_pipeline: &LitePipeline,
|
|
registry: &dyn SignatureRegistry,
|
|
) -> (ClassifiedPipeline, Option<ParseError>) {
|
|
let mut commands = Commands::new(lite_pipeline.span());
|
|
let mut error = None;
|
|
|
|
let mut iter = lite_pipeline.commands.iter().peekable();
|
|
while let Some(lite_cmd) = iter.next() {
|
|
if lite_cmd.parts.is_empty() {
|
|
continue;
|
|
}
|
|
if lite_cmd.parts[0].item.starts_with('^') {
|
|
let name = lite_cmd.parts[0]
|
|
.clone()
|
|
.map(|v| v.chars().skip(1).collect::<String>());
|
|
// TODO this is the same as the `else` branch below, only the name differs. Find a way
|
|
// to share this functionality.
|
|
let mut args = vec![];
|
|
|
|
let (name, err) = parse_arg(SyntaxShape::String, registry, &name);
|
|
let name_span = name.span;
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
args.push(name);
|
|
|
|
for lite_arg in &lite_cmd.parts[1..] {
|
|
let (expr, err) = parse_external_arg(registry, lite_arg);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
args.push(expr);
|
|
}
|
|
|
|
commands.push(ClassifiedCommand::Internal(InternalCommand {
|
|
name: "run_external".to_string(),
|
|
name_span,
|
|
args: hir::Call {
|
|
head: Box::new(SpannedExpression {
|
|
expr: Expression::string("run_external".to_string()),
|
|
span: name_span,
|
|
}),
|
|
positional: Some(args),
|
|
named: None,
|
|
span: name_span,
|
|
external_redirection: if iter.peek().is_none() {
|
|
ExternalRedirection::None
|
|
} else {
|
|
ExternalRedirection::Stdout
|
|
},
|
|
},
|
|
}))
|
|
} else if lite_cmd.parts[0].item == "=" {
|
|
let expr = if lite_cmd.parts.len() > 1 {
|
|
let (_, expr, err) =
|
|
parse_math_expression(0, &lite_cmd.parts[1..], registry, false);
|
|
error = error.or(err);
|
|
expr
|
|
} else {
|
|
error = error.or_else(|| {
|
|
Some(ParseError::argument_error(
|
|
lite_cmd.parts[0].clone(),
|
|
ArgumentError::MissingMandatoryPositional("an expression".into()),
|
|
))
|
|
});
|
|
garbage(lite_cmd.span())
|
|
};
|
|
commands.push(ClassifiedCommand::Expr(Box::new(expr)))
|
|
} else {
|
|
if lite_cmd.parts.len() > 1 {
|
|
// Check if it's a sub-command
|
|
if let Some(signature) = registry.get(&format!(
|
|
"{} {}",
|
|
lite_cmd.parts[0].item, lite_cmd.parts[1].item
|
|
)) {
|
|
let (mut internal_command, err) =
|
|
parse_internal_command(&lite_cmd, registry, &signature, 1);
|
|
|
|
error = error.or(err);
|
|
internal_command.args.external_redirection = if iter.peek().is_none() {
|
|
ExternalRedirection::None
|
|
} else {
|
|
ExternalRedirection::Stdout
|
|
};
|
|
commands.push(ClassifiedCommand::Internal(internal_command));
|
|
continue;
|
|
}
|
|
}
|
|
|
|
// Check if it's an internal command
|
|
if let Some(signature) = registry.get(&lite_cmd.parts[0].item) {
|
|
let (mut internal_command, err) =
|
|
parse_internal_command(&lite_cmd, registry, &signature, 0);
|
|
|
|
error = error.or(err);
|
|
internal_command.args.external_redirection = if iter.peek().is_none() {
|
|
ExternalRedirection::None
|
|
} else {
|
|
ExternalRedirection::Stdout
|
|
};
|
|
commands.push(ClassifiedCommand::Internal(internal_command));
|
|
continue;
|
|
}
|
|
|
|
let name = lite_cmd.parts[0].clone().map(|v| {
|
|
let trimmed = trim_quotes(&v);
|
|
expand_path(&trimmed).to_string()
|
|
});
|
|
|
|
let mut args = vec![];
|
|
|
|
let (name, err) = parse_arg(SyntaxShape::String, registry, &name);
|
|
let name_span = name.span;
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
args.push(name);
|
|
|
|
for lite_arg in &lite_cmd.parts[1..] {
|
|
let (expr, err) = parse_external_arg(registry, lite_arg);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
args.push(expr);
|
|
}
|
|
|
|
commands.push(ClassifiedCommand::Internal(InternalCommand {
|
|
name: "run_external".to_string(),
|
|
name_span,
|
|
args: hir::Call {
|
|
head: Box::new(SpannedExpression {
|
|
expr: Expression::string("run_external".to_string()),
|
|
span: name_span,
|
|
}),
|
|
positional: Some(args),
|
|
named: None,
|
|
span: name_span,
|
|
external_redirection: if iter.peek().is_none() {
|
|
ExternalRedirection::None
|
|
} else {
|
|
ExternalRedirection::Stdout
|
|
},
|
|
},
|
|
}))
|
|
}
|
|
}
|
|
|
|
(ClassifiedPipeline::new(commands), error)
|
|
}
|
|
|
|
type SpannedKeyValue = (Spanned<String>, Spanned<String>);
|
|
|
|
fn expand_shorthand_forms(
|
|
lite_pipeline: &LitePipeline,
|
|
) -> (LitePipeline, Option<SpannedKeyValue>, Option<ParseError>) {
|
|
if !lite_pipeline.commands.is_empty() {
|
|
if lite_pipeline.commands[0].parts[0].item == "=" {
|
|
(lite_pipeline.clone(), None, None)
|
|
} else if lite_pipeline.commands[0].parts[0].contains('=') {
|
|
let assignment: Vec<_> = lite_pipeline.commands[0].parts[0].split('=').collect();
|
|
if assignment.len() != 2 {
|
|
(
|
|
lite_pipeline.clone(),
|
|
None,
|
|
Some(ParseError::mismatch(
|
|
"environment variable assignment",
|
|
lite_pipeline.commands[0].parts[0].clone(),
|
|
)),
|
|
)
|
|
} else {
|
|
let original_span = lite_pipeline.commands[0].parts[0].span;
|
|
let env_value = trim_quotes(assignment[1]);
|
|
|
|
let (variable_name, value) = (assignment[0], env_value);
|
|
let mut lite_pipeline = lite_pipeline.clone();
|
|
|
|
if !lite_pipeline.commands[0].parts.len() > 1 {
|
|
let mut new_lite_command_parts = lite_pipeline.commands[0].parts.clone();
|
|
new_lite_command_parts.remove(0);
|
|
|
|
lite_pipeline.commands[0].parts = new_lite_command_parts;
|
|
|
|
(
|
|
lite_pipeline,
|
|
Some((
|
|
variable_name.to_string().spanned(original_span),
|
|
value.spanned(original_span),
|
|
)),
|
|
None,
|
|
)
|
|
} else {
|
|
(
|
|
lite_pipeline.clone(),
|
|
None,
|
|
Some(ParseError::mismatch(
|
|
"a command following variable",
|
|
lite_pipeline.commands[0].parts[0].clone(),
|
|
)),
|
|
)
|
|
}
|
|
}
|
|
} else {
|
|
(lite_pipeline.clone(), None, None)
|
|
}
|
|
} else {
|
|
(lite_pipeline.clone(), None, None)
|
|
}
|
|
}
|
|
|
|
pub fn classify_block(lite_block: &LiteBlock, registry: &dyn SignatureRegistry) -> ClassifiedBlock {
|
|
let mut command_list = vec![];
|
|
|
|
let mut error = None;
|
|
for lite_group in &lite_block.block {
|
|
for lite_pipeline in &lite_group.pipelines {
|
|
let (lite_pipeline, vars, err) = expand_shorthand_forms(lite_pipeline);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
|
|
let (pipeline, err) = classify_pipeline(&lite_pipeline, registry);
|
|
|
|
let pipeline = if let Some(vars) = vars {
|
|
let span = pipeline.commands.span;
|
|
let block = hir::Block::new(vec![], vec![pipeline.commands.clone()], span);
|
|
let mut call = hir::Call::new(
|
|
Box::new(SpannedExpression {
|
|
expr: Expression::string("with-env".to_string()),
|
|
span,
|
|
}),
|
|
span,
|
|
);
|
|
call.positional = Some(vec![
|
|
SpannedExpression {
|
|
expr: Expression::List(vec![
|
|
SpannedExpression {
|
|
expr: Expression::string(vars.0.item),
|
|
span: vars.0.span,
|
|
},
|
|
SpannedExpression {
|
|
expr: Expression::string(vars.1.item),
|
|
span: vars.1.span,
|
|
},
|
|
]),
|
|
span: Span::new(vars.0.span.start(), vars.1.span.end()),
|
|
},
|
|
SpannedExpression {
|
|
expr: Expression::Block(block),
|
|
span,
|
|
},
|
|
]);
|
|
let classified_with_env = ClassifiedCommand::Internal(InternalCommand {
|
|
name: "with-env".to_string(),
|
|
name_span: Span::unknown(),
|
|
args: call,
|
|
});
|
|
ClassifiedPipeline {
|
|
commands: Commands {
|
|
list: vec![classified_with_env],
|
|
span,
|
|
},
|
|
}
|
|
} else {
|
|
pipeline
|
|
};
|
|
|
|
command_list.push(pipeline.commands);
|
|
if error.is_none() {
|
|
error = err;
|
|
}
|
|
}
|
|
}
|
|
let block = Block::new(vec![], command_list, lite_block.span());
|
|
|
|
ClassifiedBlock::new(block, error)
|
|
}
|
|
|
|
/// Easy shorthand function to create a garbage expression at the given span
|
|
pub fn garbage(span: Span) -> SpannedExpression {
|
|
SpannedExpression::new(Expression::Garbage, span)
|
|
}
|
|
|
|
#[test]
|
|
fn unit_parse_byte_units() -> Result<(), ParseError> {
|
|
struct TestCase {
|
|
string: String,
|
|
value: i64,
|
|
unit: Unit,
|
|
};
|
|
|
|
let cases = [
|
|
TestCase {
|
|
string: String::from("108b"),
|
|
value: 108,
|
|
unit: Unit::Byte,
|
|
},
|
|
TestCase {
|
|
string: String::from("0B"),
|
|
value: 0,
|
|
unit: Unit::Byte,
|
|
},
|
|
TestCase {
|
|
string: String::from("10kb"),
|
|
value: 10,
|
|
unit: Unit::Kilobyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("16KB"),
|
|
value: 16,
|
|
unit: Unit::Kilobyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("99kB"),
|
|
value: 99,
|
|
unit: Unit::Kilobyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("27Kb"),
|
|
value: 27,
|
|
unit: Unit::Kilobyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("11Mb"),
|
|
value: 11,
|
|
unit: Unit::Megabyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("27mB"),
|
|
value: 27,
|
|
unit: Unit::Megabyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("811Gb"),
|
|
value: 811,
|
|
unit: Unit::Gigabyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("27gB"),
|
|
value: 27,
|
|
unit: Unit::Gigabyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("11Tb"),
|
|
value: 11,
|
|
unit: Unit::Terabyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("1027tB"),
|
|
value: 1027,
|
|
unit: Unit::Terabyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("11Pb"),
|
|
value: 11,
|
|
unit: Unit::Petabyte,
|
|
},
|
|
TestCase {
|
|
string: String::from("27pB"),
|
|
value: 27,
|
|
unit: Unit::Petabyte,
|
|
},
|
|
];
|
|
|
|
for case in cases.iter() {
|
|
let input_len = case.string.len();
|
|
let value_len = case.value.to_string().len();
|
|
let input = case.string.clone().spanned(Span::new(0, input_len));
|
|
let result = parse_unit(&input);
|
|
assert_eq!(result.1, None);
|
|
assert_eq!(
|
|
result.0.expr,
|
|
Expression::unit(
|
|
Spanned {
|
|
span: Span::new(0, value_len),
|
|
item: case.value
|
|
},
|
|
Spanned {
|
|
span: Span::new(value_len, input_len),
|
|
item: case.unit
|
|
}
|
|
)
|
|
);
|
|
}
|
|
Ok(())
|
|
}
|