mirror of
https://github.com/apache/datafusion-sqlparser-rs.git
synced 2025-08-30 18:57:21 +00:00
Correct typos in parser.rs (#838)
This commit is contained in:
parent
a8a8e65b7c
commit
eb67d489bb
1 changed files with 4 additions and 4 deletions
|
@ -57,7 +57,7 @@ macro_rules! return_ok_if_some {
|
|||
}
|
||||
|
||||
#[cfg(feature = "std")]
|
||||
/// Implemenation [`RecursionCounter`] if std is available
|
||||
/// Implementation [`RecursionCounter`] if std is available
|
||||
mod recursion {
|
||||
use core::sync::atomic::{AtomicUsize, Ordering};
|
||||
use std::rc::Rc;
|
||||
|
@ -121,7 +121,7 @@ mod recursion {
|
|||
|
||||
#[cfg(not(feature = "std"))]
|
||||
mod recursion {
|
||||
/// Implemenation [`RecursionCounter`] if std is NOT available (and does not
|
||||
/// Implementation [`RecursionCounter`] if std is NOT available (and does not
|
||||
/// guard against stack overflow).
|
||||
///
|
||||
/// Has the same API as the std RecursionCounter implementation
|
||||
|
@ -209,7 +209,7 @@ pub struct Parser<'a> {
|
|||
/// Additional options that allow you to mix & match behavior otherwise
|
||||
/// constrained to certain dialects (e.g. trailing commas)
|
||||
options: ParserOptions,
|
||||
/// ensure the stack does not overflow by limiting recusion depth
|
||||
/// ensure the stack does not overflow by limiting recursion depth
|
||||
recursion_counter: RecursionCounter,
|
||||
}
|
||||
|
||||
|
@ -360,7 +360,7 @@ impl<'a> Parser<'a> {
|
|||
Ok(stmts)
|
||||
}
|
||||
|
||||
/// Convience method to parse a string with one or more SQL
|
||||
/// Convenience method to parse a string with one or more SQL
|
||||
/// statements into produce an Abstract Syntax Tree (AST).
|
||||
///
|
||||
/// Example
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue