The Elegant Parser
This report summarizes scanner evidence for pest-parser/pest, a Rust project with 5,415 GitHub stars. SynthScan examined 73,682 lines of code across 130 source files, recording 203 pattern matches distributed across 3 syntactic categories. The legacy adjusted pattern signal is 2.7 (Low pattern signal); it is not an authorship estimate.
Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.
Use each vector to guide manual verification of the underlying findings.
Payload schema: 1.0.0 · Engine: 2.0.0 · Scoring: heuristic-density-v1 · Scan date: 2026-10-31.
Can maintainers explain intent, assumptions, and trade-offs? 202 finding(s).
Are imports declared and package/API names verified? 1 finding(s).
Are wrappers, guards, and repeated structures necessary? 0 finding(s).
Which changes need focused human review? 203 finding(s).
This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.
Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.
This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.
The scanner identified 203 distinct pattern matches across 3 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.
Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | pest/tests/json.rs | 1 | // pest. The Elegant Parser | COMMENT |
| LOW | pest/tests/calculator.rs | 1 | // pest. The Elegant Parser | COMMENT |
| LOW | pest/src/prec_climber.rs | 21 | /// Macro for more convenient const fn definition of `prec_climber::PrecClimber`. | COMMENT |
| LOW | pest/src/prec_climber.rs | 121 | next: Option<Box<Operator<R>>>, | COMMENT |
| LOW | pest/src/prec_climber.rs | 181 | /// | COMMENT |
| LOW | pest/src/prec_climber.rs | 221 | /// Creates a new `PrecClimber` from the `Operator`s contained in `ops`. Every entry in the | COMMENT |
| LOW | pest/src/prec_climber.rs | 281 | /// | COMMENT |
| LOW | pest/src/error.rs | 181 | /// # #[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)] | COMMENT |
| LOW | pest/src/error.rs | 241 | /// # enum Rule { | COMMENT |
| LOW | pest/src/error.rs | 301 | /// | COMMENT |
| LOW | pest/src/error.rs | 321 | /// pos | COMMENT |
| LOW | pest/src/error.rs | 341 | /// # open_paren, | COMMENT |
| LOW | pest/src/error.rs | 361 | self.inner.line.as_str() | COMMENT |
| LOW | pest/src/error.rs | 381 | /// # open_paren, | COMMENT |
| LOW | pest/src/error.rs | 701 | /// [`Cow::Borrowed`] reference to [`message`]. If [`ErrorVariant`] is [`ParsingError`], a | COMMENT |
| LOW | pest/src/token.rs | 1 | // pest. The Elegant Parser | COMMENT |
| LOW | pest/src/lib.rs | 1 | // pest. The Elegant Parser | COMMENT |
| LOW | pest/src/lib.rs | 21 | //! complex languages. | COMMENT |
| LOW | pest/src/lib.rs | 41 | //! [GitHub Discussions]: https://github.com/pest-parser/pest/discussions | COMMENT |
| LOW | pest/src/lib.rs | 61 | //! struct MyParser; | COMMENT |
| LOW | pest/src/lib.rs | 81 | //! ```text | COMMENT |
| LOW | pest/src/lib.rs | 101 | //! #### Modifiers | COMMENT |
| LOW | pest/src/lib.rs | 121 | //! rules behave atomically. | COMMENT |
| LOW | pest/src/lib.rs | 141 | //! b = ${ a ~ "b" } | COMMENT |
| LOW | pest/src/lib.rs | 161 | //! Parsing both `"ab"` and `"a b"` produce the token pairs `c(a())`. | COMMENT |
| LOW | pest/src/lib.rs | 181 | //! 2. Non-terminals | COMMENT |
| LOW | pest/src/lib.rs | 201 | //! Matching is greedy, without backtracking. Note the difference in behavior for | COMMENT |
| LOW | pest/src/lib.rs | 221 | //! tokens (e.g. identifier) that matches any word. In order to match a keyword, | COMMENT |
| LOW | pest/src/lib.rs | 241 | //! * `DROP` - drops the top of the stack (fails to match if the stack is empty) | COMMENT |
| LOW | pest/src/lib.rs | 261 | //! is effectively transformed into this one behind the scenes: | COMMENT |
| LOW | pest/src/lib.rs | 281 | //! ```ignore | COMMENT |
| LOW | pest/src/lib.rs | 301 | //! `PEEK[start..end]` and `PEEK_ALL` allow to peek deeper into the stack. The syntax works exactly | COMMENT |
| LOW | pest/src/lib.rs | 321 | //! All rules defined or used in the grammar populate a generated `enum` called `Rule`. This | COMMENT |
| LOW | pest/src/parser_state.rs | 41 | /// attempts to match its inner expression. | COMMENT |
| LOW | pest/src/parser_state.rs | 61 | /// The current atomicity of a [`ParserState`]. | COMMENT |
| LOW | pest/src/parser_state.rs | 81 | COMMENT | |
| LOW | pest/src/parser_state.rs | 101 | /// A refused entry fails the parse with "call limit reached", even if an | COMMENT |
| LOW | pest/src/parser_state.rs | 341 | Self::Span(s) => BorrowedOrArc::Borrowed(s.as_str()), | COMMENT |
| LOW | pest/src/parser_state.rs | 521 | fn default() -> Self { | COMMENT |
| LOW | pest/src/parser_state.rs | 541 | /// `End` state. | COMMENT |
| LOW | pest/src/parser_state.rs | 561 | /// we track those rules (which we've tried to parse at the same max pos) at this helper struct. | COMMENT |
| LOW | pest/src/parser_state.rs | 661 | /// Returns a reference to the current `Position` of the `ParserState`. | COMMENT |
| LOW | pest/src/parser_state.rs | 681 | COMMENT | |
| LOW | pest/src/parser_state.rs | 721 | COMMENT | |
| LOW | pest/src/parser_state.rs | 761 | // Pair's position will only be known after running the closure. | COMMENT |
| LOW | pest/src/parser_state.rs | 861 | new_state.queue.truncate(index); | COMMENT |
| LOW | pest/src/parser_state.rs | 881 | /// } | COMMENT |
| LOW | pest/src/parser_state.rs | 961 | } | COMMENT |
| LOW | pest/src/parser_state.rs | 981 | /// | COMMENT |
| LOW | pest/src/parser_state.rs | 1021 | /// | COMMENT |
| LOW | pest/src/parser_state.rs | 1061 | COMMENT | |
| LOW | pest/src/parser_state.rs | 1121 | .try_add_new_token(token, start_position, current_pos, false); | COMMENT |
| LOW | pest/src/parser_state.rs | 1161 | Ok(self) | COMMENT |
| LOW | pest/src/parser_state.rs | 1201 | } else { | COMMENT |
| LOW | pest/src/parser_state.rs | 1221 | /// assert_eq!(result.as_ref().unwrap().position().pos(), 0); | COMMENT |
| LOW | pest/src/parser_state.rs | 1241 | /// # Examples | COMMENT |
| LOW | pest/src/parser_state.rs | 1281 | /// The provided `range` is interpreted as inclusive. | COMMENT |
| LOW | pest/src/parser_state.rs | 1321 | /// if successful, or `Err` with the updated `Box<ParserState>` otherwise. | COMMENT |
| LOW | pest/src/parser_state.rs | 1341 | /// ``` | COMMENT |
| LOW | pest/src/parser_state.rs | 1361 | /// | COMMENT |
| 139 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | meta/src/validator/stack_loops.rs | 134 | /// Certainly no entries. | COMMENT |
| MEDIUM | meta/src/validator/stack_loops.rs | 139 | /// Certainly at least one entry. | COMMENT |
| MEDIUM | meta/src/validator/stack_loops.rs | 243 | /// Certainly succeeds without consuming input, whatever the input: `Some(stack after)`. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | grammars/benches/main.i18n.json | 8707 | "placeholder": "输入计算机名称", | CODE |