diff options
| author | Georgi Lyubenov <godzbanebane@gmail.com> | 2023-01-08 17:26:26 +0200 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2023-01-09 21:11:07 -0500 |
| commit | 2e926b887067aacb866740a878dc386ab74713da (patch) | |
| tree | 1e65e503d7bb781169f19894423486dadda6eddd | |
| parent | 4724e8d1a66fa0a821d322d9d2d90db7d7604916 (diff) | |
| download | haskell-2e926b887067aacb866740a878dc386ab74713da.tar.gz | |
Fix outdated link to Happy section on sequences
| -rw-r--r-- | compiler/GHC/Parser.y | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/compiler/GHC/Parser.y b/compiler/GHC/Parser.y index 1d081d1071..7cc43b7273 100644 --- a/compiler/GHC/Parser.y +++ b/compiler/GHC/Parser.y @@ -540,8 +540,9 @@ importdecls This might seem like an awfully roundabout way to declare a list; plus, to add insult to injury you have to reverse the results at the end. The answer is that left recursion prevents us from running out of stack space when parsing long -sequences. See: https://www.haskell.org/happy/doc/html/sec-sequences.html for -more guidance. +sequences. See: +https://haskell-happy.readthedocs.io/en/latest/using.html#parsing-sequences +for more guidance. By adding/removing branches, you can affect what lists are accepted. Here are the most common patterns, rewritten as regular expressions for clarity: |