1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
use crate::parse_recovery::{ParseRecovery, ParseRecoveryTokenSet, RecoveryResult};
use crate::parsed_syntax::ParsedSyntax::{Absent, Present};
use crate::prelude::*;
use biome_rowan::TextRange;
/// Syntax that is either present in the source tree or absent.
///
/// This type is commonly used as the return type of parse functions with the following types
///
///
/// ## Parse Rule conventions
///
/// * A parse rule must return [ParsedSyntax::Present] if it is able to parse a node or at least parts of it. For example,
/// the `parse_for_statement` should return [ParsedSyntax::Present] for `for (` even tough many of the required children are missing
/// because it is still able to parse parts of the for statement.
/// * A parse rule must return [ParsedSyntax::Absent] if the expected node isn't present in the source code.
/// In most cases, this means if the first expected token isn't present, for example,
/// if the `for` keyword isn't present when parsing a for statement.
/// However, it can be possible for rules to recover even if the first token doesn't match. One example
/// is when parsing an assignment target that has an optional default. The rule can recover even
/// if the assignment target is missing as long as the cursor is then positioned at an `=` token.
/// The rule must then return [ParsedSyntax::Present] with the partial parsed node.
/// * A parse rule must not eat any tokens when it returns [ParsedSyntax::Absent]
/// * A parse rule must not add any errors when it returns [ParsedSyntax::Absent]
///
/// This is a custom enum over using `Option` because [ParsedSyntax::Absent] values must be handled by the caller.
#[derive(Debug, PartialEq, Eq)]
#[must_use = "this `ParsedSyntax` may be an `Absent` variant, which should be handled"]
pub enum ParsedSyntax {
/// A syntax that isn't present in the source code. Used when a parse rule can't match the current
/// token of the parser.
Absent,
/// A completed syntax node with all or some of its children.
Present(CompletedMarker),
}
impl ParsedSyntax {
/// Converts from `ParsedSyntax` to `Option<CompletedMarker>`.
///
/// Converts `self` into an `Option<CompletedMarker>`, consuming `self`
#[inline]
pub fn ok(self) -> Option<CompletedMarker> {
match self {
Absent => None,
Present(marker) => Some(marker),
}
}
/// Calls `op` if the syntax is present and otherwise returns [ParsedSyntax::Absent]
#[inline]
pub fn and_then<F>(self, op: F) -> ParsedSyntax
where
F: FnOnce(CompletedMarker) -> ParsedSyntax,
{
match self {
Absent => Absent,
Present(marker) => op(marker),
}
}
/// Calls `op` if the syntax is absent ond otherwise returns [ParsedSyntax::Present]
#[inline]
pub fn or_else<F>(self, op: F) -> ParsedSyntax
where
F: FnOnce() -> ParsedSyntax,
{
match self {
Absent => op(),
t => t,
}
}
/// Returns `true` if the parsed syntax is [ParsedSyntax::Present]
#[inline]
#[must_use]
pub fn is_present(&self) -> bool {
matches!(self, Present(_))
}
/// Returns `true` if the parsed syntax is [ParsedSyntax::Absent]
#[inline]
#[must_use]
pub fn is_absent(&self) -> bool {
matches!(self, Absent)
}
/// It returns the contained [ParsedSyntax::Present] value, consuming the `self` value
///
/// # Panics
///
/// Panics if the current syntax is [ParsedSyntax::Absent]
#[inline]
#[track_caller]
pub fn unwrap(self) -> CompletedMarker {
match self {
Absent => {
panic!("Called `unwrap` on an `Absent` syntax");
}
Present(marker) => marker,
}
}
/// Returns the contained [ParsedSyntax::Present] value or passed default
#[allow(unused)]
#[inline]
pub fn unwrap_or(self, default: CompletedMarker) -> CompletedMarker {
match self {
Absent => default,
Present(marker) => marker,
}
}
/// Returns the contained [ParsedSyntax::Present] value or computes it from a clojure.
#[inline]
#[allow(unused)]
pub fn unwrap_or_else<F>(self, default: F) -> CompletedMarker
where
F: FnOnce() -> CompletedMarker,
{
match self {
Absent => default(),
Present(marker) => marker,
}
}
/// Returns the contained [ParsedSyntax::Present] value, consuming the self value.
///
/// # Panics
///
/// Panics if the value is an [ParsedSyntax::Absent] with a custom panic message provided by msg.
#[inline]
#[track_caller]
pub fn expect(self, msg: &str) -> CompletedMarker {
match self {
Present(marker) => marker,
Absent => panic!("{}", msg),
}
}
/// Maps a [ParsedSyntax::Present] `ParsedSyntax` by applying a function to a contained [ParsedSyntax::Present] value,
/// leaving an [ParsedSyntax::Absent] value untouched.
///
/// This function can be used to compose the results of two functions.
pub fn map<F>(self, mapper: F) -> ParsedSyntax
where
F: FnOnce(CompletedMarker) -> CompletedMarker,
{
match self {
Absent => Absent,
Present(element) => Present(mapper(element)),
}
}
/// Returns the kind of the syntax if it is present or [None] otherwise
#[inline]
pub fn kind<P>(&self, p: &P) -> Option<P::Kind>
where
P: Parser,
{
match self {
Absent => None,
Present(marker) => Some(marker.kind(p)),
}
}
/// Adds a diagnostic at the current parser position if the syntax is present and return its marker.
#[inline]
pub fn add_diagnostic_if_present<P, E, D>(
self,
p: &mut P,
error_builder: E,
) -> Option<CompletedMarker>
where
P: Parser,
E: FnOnce(&P, TextRange) -> D,
D: ToDiagnostic<P>,
{
match self {
Present(syntax) => {
let range = syntax.range(p);
let range = TextRange::new(range.start(), range.end());
let diagnostic = error_builder(p, range);
p.error(diagnostic);
Some(syntax)
}
Absent => None,
}
}
/// It returns the syntax if present or adds a diagnostic at the current parser position.
#[inline]
pub fn or_add_diagnostic<P, E, D>(self, p: &mut P, error_builder: E) -> Option<CompletedMarker>
where
P: Parser,
E: FnOnce(&P, TextRange) -> D,
D: ToDiagnostic<P>,
{
match self {
Present(syntax) => Some(syntax),
Absent => {
let diagnostic = error_builder(p, p.cur_range());
p.error(diagnostic);
None
}
}
}
/// It creates and returns a marker preceding this parsed syntax if it is present or starts
/// a new marker and adds an error to the current parser position.
/// See [CompletedMarker.precede]
#[inline]
pub fn precede_or_add_diagnostic<P, E, D>(self, p: &mut P, error_builder: E) -> Marker
where
P: Parser,
E: FnOnce(&P, TextRange) -> D,
D: ToDiagnostic<P>,
{
match self {
Present(completed) => completed.precede(p),
Absent => {
let diagnostic = error_builder(p, p.cur_range());
p.error(diagnostic);
p.start()
}
}
}
/// Creates a new marker that precedes this syntax or starts a new marker
#[inline]
pub fn precede<P>(self, p: &mut P) -> Marker
where
P: Parser,
{
match self {
Present(marker) => marker.precede(p),
Absent => p.start(),
}
}
/// Returns this Syntax if it is present in the source text or tries to recover the
/// parser if the syntax is absent. The recovery...
///
/// * eats all unexpected tokens into a `Bogus*` node until the parser reaches one
/// of the "safe tokens" configured in the [ParseRecoveryTokenSet].
/// * creates an error using the passed in error builder and adds it to the parsing diagnostics.
///
/// The error recovery can fail if the parser is located at the EOF token or if the parser
/// is already at a valid position according to the [ParseRecoveryTokenSet].
pub fn or_recover_with_token_set<P, E>(
self,
p: &mut P,
recovery: &ParseRecoveryTokenSet<P::Kind>,
error_builder: E,
) -> RecoveryResult
where
P: Parser,
E: FnOnce(&P, TextRange) -> ParseDiagnostic,
{
match self {
Present(syntax) => Ok(syntax),
Absent => match recovery.recover(p) {
Ok(recovered) => {
let diagnostic = error_builder(p, recovered.range(p));
p.error(diagnostic);
Ok(recovered)
}
Err(recovery_error) => {
let diagnostic = error_builder(p, p.cur_range());
p.error(diagnostic);
Err(recovery_error)
}
},
}
}
/// Returns this Syntax if it is present in the source text or tries to recover the
/// parser if the syntax is absent. The recovery...
///
/// * eats all unexpected tokens into a `Bogus*` node until the parser reaches one
/// of the "safe tokens" configured in the [ParseRecovery].
/// * creates an error using the passed in error builder and adds it to the parsing diagnostics.
///
/// The error recovery can fail if the parser is located at the EOF token or if the parser
/// is already at a valid position according to the [ParseRecovery].
pub fn or_recover<'source, P, E, R>(
self,
p: &mut P,
recovery: &R,
error_builder: E,
) -> RecoveryResult
where
P: Parser,
R: ParseRecovery<Parser<'source> = P>,
E: FnOnce(&P, TextRange) -> ParseDiagnostic,
{
match self {
Present(syntax) => Ok(syntax),
Absent => match recovery.recover(p) {
Ok(recovered) => {
let diagnostic = error_builder(p, recovered.range(p));
p.error(diagnostic);
Ok(recovered)
}
Err(recovery_error) => {
let diagnostic = error_builder(p, p.cur_range());
p.error(diagnostic);
Err(recovery_error)
}
},
}
}
}
impl From<CompletedMarker> for ParsedSyntax {
fn from(marker: CompletedMarker) -> Self {
Present(marker)
}
}
impl From<Option<CompletedMarker>> for ParsedSyntax {
fn from(option: Option<CompletedMarker>) -> Self {
match option {
Some(completed) => Present(completed),
None => Absent,
}
}
}