-
-
Notifications
You must be signed in to change notification settings - Fork 264
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
fix: adjust tag association in optional and repeat expressions (#985)
- Loading branch information
Showing
11 changed files
with
154 additions
and
32 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,8 @@ | ||
expr = { | ||
SOI ~ | ||
#prefix=(STAR)? ~ #suffix=DOT? | ||
~ EOI | ||
} | ||
|
||
STAR={"*"} | ||
DOT={"."} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,42 @@ | ||
// Licensed under the Apache License, Version 2.0 | ||
// <LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0> or the MIT | ||
// license <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your | ||
// option. All files in the project carrying such notice may not be copied, | ||
// modified, or distributed except according to those terms. | ||
|
||
#![cfg_attr(not(feature = "std"), no_std)] | ||
extern crate alloc; | ||
extern crate pest; | ||
extern crate pest_derive; | ||
|
||
#[cfg(feature = "grammar-extras")] | ||
use pest::Parser; | ||
use pest_derive::Parser; | ||
|
||
#[derive(Parser)] | ||
#[grammar = "../tests/opt.pest"] | ||
struct TestOptParser; | ||
|
||
#[test] | ||
#[cfg(feature = "grammar-extras")] | ||
fn test_opt_tag() { | ||
let successful_parse = TestOptParser::parse(Rule::expr, "*"); | ||
assert!(successful_parse.is_ok()); | ||
let pairs = successful_parse.unwrap(); | ||
assert!(pairs.find_first_tagged("prefix").is_some()); | ||
assert!(pairs.find_first_tagged("suffix").is_none()); | ||
|
||
// Test with no STAR or DOT | ||
let parse_no_components = TestOptParser::parse(Rule::expr, ""); | ||
assert!(parse_no_components.is_ok()); | ||
let pairs_no_components = parse_no_components.unwrap(); | ||
assert!(pairs_no_components.find_first_tagged("prefix").is_none()); | ||
assert!(pairs_no_components.find_first_tagged("suffix").is_none()); | ||
|
||
// Test with only DOT | ||
let parse_only_dot = TestOptParser::parse(Rule::expr, "."); | ||
assert!(parse_only_dot.is_ok()); | ||
let pairs_only_dot = parse_only_dot.unwrap(); | ||
assert!(pairs_only_dot.find_first_tagged("prefix").is_none()); | ||
assert!(pairs_only_dot.find_first_tagged("suffix").is_some()); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters