From 504c65aa83563bd0e76202a2b92b95442add27c5 Mon Sep 17 00:00:00 2001 From: Sergei Zharinov Date: Thu, 11 Dec 2025 18:38:23 -0300 Subject: [PATCH] fix: Update REFERENCE.md --- docs/REFERENCE.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/REFERENCE.md b/docs/REFERENCE.md index 47ad6719..6834c98d 100644 --- a/docs/REFERENCE.md +++ b/docs/REFERENCE.md @@ -14,7 +14,7 @@ Plotnik uses an NFA-based recursive cursor walk with backtracking. Understanding - **Root-anchored:** Matching starts at the root of the target tree and must match the entire structure (like `^...$` in regex, not a substring search) - **Backtracking:** When a branch fails, the engine backtracks and tries alternatives -- **Ordered choice:** In alternations `[A B C]`, branches are tried in order; first match wins (PEG semantics) +- **Ordered choice:** In alternations `[A B C]`, branches are tried in order; first match wins ### Trivia Handling