liveBook · Manning

Negative lookahead assertion

A negative lookahead assertion is a regular-expression assertion that succeeds when its pattern does not match immediately after the current position without consuming characters.

How 2 Manning books explain it

Regular Expression Puzzles and AI Coding Assistants

A positive lookahead assertion is a regular-expression assertion that requires a subpattern to match immediately after the current position without consuming the checked text.

How it is used
Enforces exclusions while matching repeated words, ascending unary numbers, and constrained symbol sequences.
How deep it goes
Defines the assertion through worked backreference patterns and finite-state limits, rather than cataloging regex-engine syntax.
Examples
Uses duplicate-word text, unary-number sequences, and flawed AI-generated prime and Fibonacci-like regexes.
What you can do after
Evaluate/understand whether a negative-lookahead regex enforces its claimed exclusion and where finite matching machinery fails.

Read how Regular Expression Puzzles and AI Coding Assistants explains negative lookahead assertion →

Secrets of the JavaScript Ninja, Third Edition

A negative lookahead is a regular-expression assertion that succeeds when its specified pattern does not occur ahead of the current position.

How it is used
Uses a regex assertion to rule out a specified pattern ahead of the current position.
How deep it goes
Defines the assertion and gives its syntax, but supplies no negative-lookahead worked example.
Examples
Contrasts the negative syntax with positive-lookahead examples for armed-ninja matching and thousands grouping.
What you can do after
Understand how to recognize negative-lookahead syntax and interpret its exclusion test.

Read how Secrets of the JavaScript Ninja, Third Edition explains negative lookahead assertion →

What to know first

Related concepts

Questions about negative lookahead assertion

What is negative lookahead assertion?

A negative lookahead assertion is a regular-expression assertion that succeeds when its pattern does not match immediately after the current position without consuming characters.

Which Manning books explain negative lookahead assertion?

Regular Expression Puzzles and AI Coding Assistants and Secrets of the JavaScript Ninja, Third Edition.

What should I know before learning negative lookahead assertion?

Manning books that teach negative lookahead assertion usually introduce regex grouping and regular expression first.

What is the difference between negative lookahead assertion and non-capturing group?

A negative lookahead assertion is a regular-expression assertion that succeeds when its pattern does not match immediately after the current position without consuming characters. A non-capturing group is a parenthesized regular-expression subpattern that groups matching behavior without storing matched text as a capture.

What is negative lookahead assertion a kind of?

Negative lookahead assertion is a kind of assertion. A regular-expression assertion tests a condition at a position in the input without consuming characters as part of the match.

What is negative lookahead assertion part of?

Negative lookahead assertion is part of regular expression. A regular expression is a formal pattern notation that describes sets of strings and specifies how text can be matched, searched, or transformed.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.