AI Slop Code Risk Monitor

pest-parser/pest

SlopCodeMonitor badge for pest-parser/pest Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).

The Elegant Parser

2.7 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

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.

2.7
Adjusted Signal
2.7
Raw Pattern Score
100%
Time Factor
2026-10-26
Last Push
5.4K
Stars
Rust
Language
73.7K
Lines of Code
130
Files
203
Pattern Hits
2026-10-31
Scan Date
0.00
HC Hit Rate

Risk Review · Payload v1

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.

Cognitive Ownership Risk 12.5/100 · LOW

Can maintainers explain intent, assumptions, and trade-offs? 202 finding(s).

Hallucinated Dependency & Supply Chain Risk 0.1/100 · LOW

Are imports declared and package/API names verified? 1 finding(s).

Agent Over-Engineering Ratio 0.0/100 · LOW

Are wrappers, guards, and repeated structures necessary? 0 finding(s).

PR Review Velocity Impact 13.2/100 · LOW

Which changes need focused human review? 203 finding(s).

What These Metrics Mean

Adjusted Signal
Legacy pattern score normalized per 1,000 scanned lines and multiplied by the repository-level time factor. It is not an estimate of AI authorship.
Raw Pattern Score
Sum of severity- and context-weighted pattern findings before applying the time factor.
Time Factor
A coarse multiplier based on repository last-push metadata. It does not identify when individual code was written.
Pattern Hits
Count of configured pattern findings. Review each location and surrounding code before acting.
HC Hit Rate
High- and critical-severity findings per scanned file. Severity is a configured detector weight, not proof of a vulnerability or authorship.
Lines / Files
Scan coverage denominators used by the legacy normalized score.

Pattern-Signal History

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.

Severity Breakdown

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.

CRITICAL 0HIGH 0MEDIUM 3LOW 200

Directory Score Breakdown

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.

Pattern Findings

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.

Over-Commented Block199 hits · 188 pts
SeverityFileLineSnippetContext
LOWpest/tests/json.rs1// pest. The Elegant ParserCOMMENT
LOWpest/tests/calculator.rs1// pest. The Elegant ParserCOMMENT
LOWpest/src/prec_climber.rs21/// Macro for more convenient const fn definition of `prec_climber::PrecClimber`.COMMENT
LOWpest/src/prec_climber.rs121 next: Option<Box<Operator<R>>>,COMMENT
LOWpest/src/prec_climber.rs181 ///COMMENT
LOWpest/src/prec_climber.rs221 /// Creates a new `PrecClimber` from the `Operator`s contained in `ops`. Every entry in theCOMMENT
LOWpest/src/prec_climber.rs281 ///COMMENT
LOWpest/src/error.rs181 /// # #[derive(Clone, Copy, Debug, Eq, Hash, Ord, PartialEq, PartialOrd)]COMMENT
LOWpest/src/error.rs241 /// # enum Rule {COMMENT
LOWpest/src/error.rs301 ///COMMENT
LOWpest/src/error.rs321 /// posCOMMENT
LOWpest/src/error.rs341 /// # open_paren,COMMENT
LOWpest/src/error.rs361 self.inner.line.as_str()COMMENT
LOWpest/src/error.rs381 /// # open_paren,COMMENT
LOWpest/src/error.rs701 /// [`Cow::Borrowed`] reference to [`message`]. If [`ErrorVariant`] is [`ParsingError`], aCOMMENT
LOWpest/src/token.rs1// pest. The Elegant ParserCOMMENT
LOWpest/src/lib.rs1// pest. The Elegant ParserCOMMENT
LOWpest/src/lib.rs21//! complex languages.COMMENT
LOWpest/src/lib.rs41//! [GitHub Discussions]: https://github.com/pest-parser/pest/discussionsCOMMENT
LOWpest/src/lib.rs61//! struct MyParser;COMMENT
LOWpest/src/lib.rs81//! ```textCOMMENT
LOWpest/src/lib.rs101//! #### ModifiersCOMMENT
LOWpest/src/lib.rs121//! rules behave atomically.COMMENT
LOWpest/src/lib.rs141//! b = ${ a ~ "b" }COMMENT
LOWpest/src/lib.rs161//! Parsing both `"ab"` and `"a b"` produce the token pairs `c(a())`.COMMENT
LOWpest/src/lib.rs181//! 2. Non-terminalsCOMMENT
LOWpest/src/lib.rs201//! Matching is greedy, without backtracking. Note the difference in behavior forCOMMENT
LOWpest/src/lib.rs221//! tokens (e.g. identifier) that matches any word. In order to match a keyword,COMMENT
LOWpest/src/lib.rs241//! * `DROP` - drops the top of the stack (fails to match if the stack is empty)COMMENT
LOWpest/src/lib.rs261//! is effectively transformed into this one behind the scenes:COMMENT
LOWpest/src/lib.rs281//! ```ignoreCOMMENT
LOWpest/src/lib.rs301//! `PEEK[start..end]` and `PEEK_ALL` allow to peek deeper into the stack. The syntax works exactlyCOMMENT
LOWpest/src/lib.rs321//! All rules defined or used in the grammar populate a generated `enum` called `Rule`. ThisCOMMENT
LOWpest/src/parser_state.rs41 /// attempts to match its inner expression.COMMENT
LOWpest/src/parser_state.rs61/// The current atomicity of a [`ParserState`].COMMENT
LOWpest/src/parser_state.rs81COMMENT
LOWpest/src/parser_state.rs101/// A refused entry fails the parse with "call limit reached", even if anCOMMENT
LOWpest/src/parser_state.rs341 Self::Span(s) => BorrowedOrArc::Borrowed(s.as_str()),COMMENT
LOWpest/src/parser_state.rs521 fn default() -> Self {COMMENT
LOWpest/src/parser_state.rs541 /// `End` state.COMMENT
LOWpest/src/parser_state.rs561 /// we track those rules (which we've tried to parse at the same max pos) at this helper struct.COMMENT
LOWpest/src/parser_state.rs661 /// Returns a reference to the current `Position` of the `ParserState`.COMMENT
LOWpest/src/parser_state.rs681COMMENT
LOWpest/src/parser_state.rs721COMMENT
LOWpest/src/parser_state.rs761 // Pair's position will only be known after running the closure.COMMENT
LOWpest/src/parser_state.rs861 new_state.queue.truncate(index);COMMENT
LOWpest/src/parser_state.rs881 /// }COMMENT
LOWpest/src/parser_state.rs961 }COMMENT
LOWpest/src/parser_state.rs981 ///COMMENT
LOWpest/src/parser_state.rs1021 ///COMMENT
LOWpest/src/parser_state.rs1061COMMENT
LOWpest/src/parser_state.rs1121 .try_add_new_token(token, start_position, current_pos, false);COMMENT
LOWpest/src/parser_state.rs1161 Ok(self)COMMENT
LOWpest/src/parser_state.rs1201 } else {COMMENT
LOWpest/src/parser_state.rs1221 /// assert_eq!(result.as_ref().unwrap().position().pos(), 0);COMMENT
LOWpest/src/parser_state.rs1241 /// # ExamplesCOMMENT
LOWpest/src/parser_state.rs1281 /// The provided `range` is interpreted as inclusive.COMMENT
LOWpest/src/parser_state.rs1321 /// if successful, or `Err` with the updated `Box<ParserState>` otherwise.COMMENT
LOWpest/src/parser_state.rs1341 /// ```COMMENT
LOWpest/src/parser_state.rs1361 ///COMMENT
139 more matches not shown…
AI Slop Vocabulary3 hits · 9 pts
SeverityFileLineSnippetContext
MEDIUMmeta/src/validator/stack_loops.rs134 /// Certainly no entries.COMMENT
MEDIUMmeta/src/validator/stack_loops.rs139 /// Certainly at least one entry.COMMENT
MEDIUMmeta/src/validator/stack_loops.rs243 /// Certainly succeeds without consuming input, whatever the input: `Some(stack after)`.COMMENT
Fake / Example Data1 hit · 1 pts
SeverityFileLineSnippetContext
LOWgrammars/benches/main.i18n.json8707 "placeholder": "输入计算机名称",CODE