1 //! Lexing, bridging to parser (which does the actual parsing) and
2 //! incremental reparsing.
8 use parser::SyntaxKind;
9 use text_tree_sink::TextTreeSink;
11 use crate::{syntax_node::GreenNode, AstNode, SyntaxError, SyntaxNode};
13 pub(crate) use crate::parsing::{lexer::*, reparsing::incremental_reparse};
15 pub(crate) fn parse_text(text: &str) -> (GreenNode, Vec<SyntaxError>) {
16 let (lexer_tokens, lexer_errors) = tokenize(text);
17 let parser_tokens = to_parser_tokens(text, &lexer_tokens);
19 let mut tree_sink = TextTreeSink::new(text, &lexer_tokens);
21 parser::parse_source_file(&parser_tokens, &mut tree_sink);
23 let (tree, mut parser_errors) = tree_sink.finish();
24 parser_errors.extend(lexer_errors);
29 /// Returns `text` parsed as a `T` provided there are no parse errors.
30 pub(crate) fn parse_text_as<T: AstNode>(
32 entry_point: parser::ParserEntryPoint,
34 let (lexer_tokens, lexer_errors) = tokenize(text);
35 if !lexer_errors.is_empty() {
39 let parser_tokens = to_parser_tokens(text, &lexer_tokens);
41 let mut tree_sink = TextTreeSink::new(text, &lexer_tokens);
43 // TextTreeSink assumes that there's at least some root node to which it can attach errors and
44 // tokens. We arbitrarily give it a SourceFile.
46 tree_sink.start_node(SyntaxKind::SOURCE_FILE);
47 parser::parse(&parser_tokens, &mut tree_sink, entry_point);
48 tree_sink.finish_node();
50 let (tree, parser_errors, eof) = tree_sink.finish_eof();
51 if !parser_errors.is_empty() || !eof {
55 SyntaxNode::new_root(tree).first_child().and_then(T::cast).ok_or(())
58 pub(crate) fn to_parser_tokens(text: &str, lexer_tokens: &[lexer::Token]) -> ::parser::Tokens {
60 let mut res = parser::Tokens::default();
61 let mut was_joint = true;
62 for t in lexer_tokens {
63 if t.kind.is_trivia() {
65 } else if t.kind == SyntaxKind::IDENT {
66 let token_text = &text[off..][..usize::from(t.len)];
68 SyntaxKind::from_contextual_keyword(token_text).unwrap_or(SyntaxKind::IDENT);
69 res.push_ident(contextual_kw);
71 res.push(was_joint, t.kind);
74 off += usize::from(t.len);