diff options
author | Wilco Kusee <[email protected]> | 2019-03-02 19:20:26 +0000 |
---|---|---|
committer | Wilco Kusee <[email protected]> | 2019-03-02 19:30:13 +0000 |
commit | d3a252b559489fa4fb21d9b5d1ddf83fe8e825d7 (patch) | |
tree | 80323490e7c0b963d15694bb9600e5b889098630 /crates/ra_mbe/src/mbe_parser.rs | |
parent | 592b906604d60a86af74c5dbb3bf40b2ddcf8061 (diff) |
Replace option with result in mbe
Diffstat (limited to 'crates/ra_mbe/src/mbe_parser.rs')
-rw-r--r-- | crates/ra_mbe/src/mbe_parser.rs | 33 |
1 files changed, 17 insertions, 16 deletions
diff --git a/crates/ra_mbe/src/mbe_parser.rs b/crates/ra_mbe/src/mbe_parser.rs index 58e2533f1..ee1b11091 100644 --- a/crates/ra_mbe/src/mbe_parser.rs +++ b/crates/ra_mbe/src/mbe_parser.rs | |||
@@ -1,40 +1,41 @@ | |||
1 | /// This module parses a raw `tt::TokenStream` into macro-by-example token | 1 | /// This module parses a raw `tt::TokenStream` into macro-by-example token |
2 | /// stream. This is a *mostly* identify function, expect for handling of | 2 | /// stream. This is a *mostly* identify function, expect for handling of |
3 | /// `$var:tt_kind` and `$(repeat),*` constructs. | 3 | /// `$var:tt_kind` and `$(repeat),*` constructs. |
4 | use crate::{MacroRulesError, Result}; | ||
4 | use crate::tt_cursor::TtCursor; | 5 | use crate::tt_cursor::TtCursor; |
5 | 6 | ||
6 | pub(crate) fn parse(tt: &tt::Subtree) -> Option<crate::MacroRules> { | 7 | pub(crate) fn parse(tt: &tt::Subtree) -> Result<crate::MacroRules> { |
7 | let mut parser = TtCursor::new(tt); | 8 | let mut parser = TtCursor::new(tt); |
8 | let mut rules = Vec::new(); | 9 | let mut rules = Vec::new(); |
9 | while !parser.is_eof() { | 10 | while !parser.is_eof() { |
10 | rules.push(parse_rule(&mut parser)?); | 11 | rules.push(parse_rule(&mut parser)?); |
11 | if parser.expect_char(';') == None { | 12 | if let Err(e) = parser.expect_char(';') { |
12 | if !parser.is_eof() { | 13 | if !parser.is_eof() { |
13 | return None; | 14 | return Err(e); |
14 | } | 15 | } |
15 | break; | 16 | break; |
16 | } | 17 | } |
17 | } | 18 | } |
18 | Some(crate::MacroRules { rules }) | 19 | Ok(crate::MacroRules { rules }) |
19 | } | 20 | } |
20 | 21 | ||
21 | fn parse_rule(p: &mut TtCursor) -> Option<crate::Rule> { | 22 | fn parse_rule(p: &mut TtCursor) -> Result<crate::Rule> { |
22 | let lhs = parse_subtree(p.eat_subtree()?)?; | 23 | let lhs = parse_subtree(p.eat_subtree()?)?; |
23 | p.expect_char('=')?; | 24 | p.expect_char('=')?; |
24 | p.expect_char('>')?; | 25 | p.expect_char('>')?; |
25 | let mut rhs = parse_subtree(p.eat_subtree()?)?; | 26 | let mut rhs = parse_subtree(p.eat_subtree()?)?; |
26 | rhs.delimiter = crate::Delimiter::None; | 27 | rhs.delimiter = crate::Delimiter::None; |
27 | Some(crate::Rule { lhs, rhs }) | 28 | Ok(crate::Rule { lhs, rhs }) |
28 | } | 29 | } |
29 | 30 | ||
30 | fn parse_subtree(tt: &tt::Subtree) -> Option<crate::Subtree> { | 31 | fn parse_subtree(tt: &tt::Subtree) -> Result<crate::Subtree> { |
31 | let mut token_trees = Vec::new(); | 32 | let mut token_trees = Vec::new(); |
32 | let mut p = TtCursor::new(tt); | 33 | let mut p = TtCursor::new(tt); |
33 | while let Some(tt) = p.eat() { | 34 | while let Ok(tt) = p.eat() { |
34 | let child: crate::TokenTree = match tt { | 35 | let child: crate::TokenTree = match tt { |
35 | tt::TokenTree::Leaf(leaf) => match leaf { | 36 | tt::TokenTree::Leaf(leaf) => match leaf { |
36 | tt::Leaf::Punct(tt::Punct { char: '$', .. }) => { | 37 | tt::Leaf::Punct(tt::Punct { char: '$', .. }) => { |
37 | if p.at_ident().is_some() { | 38 | if p.at_ident().is_ok() { |
38 | crate::Leaf::from(parse_var(&mut p)?).into() | 39 | crate::Leaf::from(parse_var(&mut p)?).into() |
39 | } else { | 40 | } else { |
40 | parse_repeat(&mut p)?.into() | 41 | parse_repeat(&mut p)?.into() |
@@ -52,15 +53,15 @@ fn parse_subtree(tt: &tt::Subtree) -> Option<crate::Subtree> { | |||
52 | }; | 53 | }; |
53 | token_trees.push(child); | 54 | token_trees.push(child); |
54 | } | 55 | } |
55 | Some(crate::Subtree { token_trees, delimiter: tt.delimiter }) | 56 | Ok(crate::Subtree { token_trees, delimiter: tt.delimiter }) |
56 | } | 57 | } |
57 | 58 | ||
58 | fn parse_var(p: &mut TtCursor) -> Option<crate::Var> { | 59 | fn parse_var(p: &mut TtCursor) -> Result<crate::Var> { |
59 | let ident = p.eat_ident().unwrap(); | 60 | let ident = p.eat_ident().unwrap(); |
60 | let text = ident.text.clone(); | 61 | let text = ident.text.clone(); |
61 | let kind = if p.at_char(':') { | 62 | let kind = if p.at_char(':') { |
62 | p.bump(); | 63 | p.bump(); |
63 | if let Some(ident) = p.eat_ident() { | 64 | if let Ok(ident) = p.eat_ident() { |
64 | Some(ident.text.clone()) | 65 | Some(ident.text.clone()) |
65 | } else { | 66 | } else { |
66 | p.rev_bump(); | 67 | p.rev_bump(); |
@@ -69,10 +70,10 @@ fn parse_var(p: &mut TtCursor) -> Option<crate::Var> { | |||
69 | } else { | 70 | } else { |
70 | None | 71 | None |
71 | }; | 72 | }; |
72 | Some(crate::Var { text, kind }) | 73 | Ok(crate::Var { text, kind }) |
73 | } | 74 | } |
74 | 75 | ||
75 | fn parse_repeat(p: &mut TtCursor) -> Option<crate::Repeat> { | 76 | fn parse_repeat(p: &mut TtCursor) -> Result<crate::Repeat> { |
76 | let subtree = p.eat_subtree().unwrap(); | 77 | let subtree = p.eat_subtree().unwrap(); |
77 | let mut subtree = parse_subtree(subtree)?; | 78 | let mut subtree = parse_subtree(subtree)?; |
78 | subtree.delimiter = crate::Delimiter::None; | 79 | subtree.delimiter = crate::Delimiter::None; |
@@ -86,8 +87,8 @@ fn parse_repeat(p: &mut TtCursor) -> Option<crate::Repeat> { | |||
86 | '*' => crate::RepeatKind::ZeroOrMore, | 87 | '*' => crate::RepeatKind::ZeroOrMore, |
87 | '+' => crate::RepeatKind::OneOrMore, | 88 | '+' => crate::RepeatKind::OneOrMore, |
88 | '?' => crate::RepeatKind::ZeroOrOne, | 89 | '?' => crate::RepeatKind::ZeroOrOne, |
89 | _ => return None, | 90 | _ => return Err(MacroRulesError::ParseError), |
90 | }; | 91 | }; |
91 | p.bump(); | 92 | p.bump(); |
92 | Some(crate::Repeat { subtree, kind, separator }) | 93 | Ok(crate::Repeat { subtree, kind, separator }) |
93 | } | 94 | } |