From 3eef0491a8ef904abdfe96ab97c566c794305d80 Mon Sep 17 00:00:00 2001
From: Andrey Makarov <ph.makarov@gmail.com>
Date: Mon, 14 Nov 2022 10:43:29 +0300
Subject: [PATCH] fix a few "broken link" warnings (#20837)

---
 compiler/concepts.nim      | 2 +-
 compiler/ic/bitabs.nim     | 2 +-
 compiler/typeallowed.nim   | 2 +-
 doc/manual_experimental.md | 2 +-
 lib/impure/re.nim          | 2 +-
 lib/pure/pegs.nim          | 2 +-
 6 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/compiler/concepts.nim b/compiler/concepts.nim
index 628e1d4be0..a810b3642b 100644
--- a/compiler/concepts.nim
+++ b/compiler/concepts.nim
@@ -316,7 +316,7 @@ proc conceptMatch*(c: PContext; concpt, arg: PType; bindings: var TIdTable; invo
   ## concept's requirements. If so, we return true and fill the 'bindings' with pairs of
   ## (typeVar, instance) pairs. ('typeVar' is usually simply written as a generic 'T'.)
   ## 'invocation' can be nil for atomic concepts. For non-atomic concepts, it contains the
-  ## 'C[S, T]' parent type that we look for. We need this because we need to store bindings
+  ## `C[S, T]` parent type that we look for. We need this because we need to store bindings
   ## for 'S' and 'T' inside 'bindings' on a successful match. It is very important that
   ## we do not add any bindings at all on an unsuccessful match!
   var m = MatchCon(inferred: @[], potentialImplementation: arg)
diff --git a/compiler/ic/bitabs.nim b/compiler/ic/bitabs.nim
index 8adab83880..a551310511 100644
--- a/compiler/ic/bitabs.nim
+++ b/compiler/ic/bitabs.nim
@@ -1,5 +1,5 @@
 ## A BiTable is a table that can be seen as an optimized pair
-## of (Table[LitId, Val], Table[Val, LitId]).
+## of `(Table[LitId, Val], Table[Val, LitId])`.
 
 import hashes, rodfiles
 
diff --git a/compiler/typeallowed.nim b/compiler/typeallowed.nim
index 37b5488659..18cfcf6b21 100644
--- a/compiler/typeallowed.nim
+++ b/compiler/typeallowed.nim
@@ -8,7 +8,7 @@
 #
 
 ## This module contains 'typeAllowed' and friends which check
-## for invalid types like 'openArray[var int]'.
+## for invalid types like `openArray[var int]`.
 
 import
   intsets, ast, renderer, options, semdata, types
diff --git a/doc/manual_experimental.md b/doc/manual_experimental.md
index 7486374784..0611f55a73 100644
--- a/doc/manual_experimental.md
+++ b/doc/manual_experimental.md
@@ -548,7 +548,7 @@ For example:
 
 
 The algorithm behind this analysis is described in
-the [view types algorithm].
+the [view types algorithm][Algorithm].
 
 
 View types
diff --git a/lib/impure/re.nim b/lib/impure/re.nim
index 8b9de0c68e..c647b94420 100644
--- a/lib/impure/re.nim
+++ b/lib/impure/re.nim
@@ -436,7 +436,7 @@ iterator findAll*(buf: cstring, pattern: Regex, start = 0, bufSize: int): string
 
 proc findAll*(s: string, pattern: Regex, start = 0): seq[string] {.inline.} =
   ## returns all matching `substrings` of `s` that match `pattern`.
-  ## If it does not match, @[] is returned.
+  ## If it does not match, `@[]` is returned.
   result = @[]
   for x in findAll(s, pattern, start): result.add x
 
diff --git a/lib/pure/pegs.nim b/lib/pure/pegs.nim
index 28a0677b95..5827b74448 100644
--- a/lib/pure/pegs.nim
+++ b/lib/pure/pegs.nim
@@ -1172,7 +1172,7 @@ iterator findAll*(s: string, pattern: Peg, start = 0): string =
 func findAll*(s: string, pattern: Peg, start = 0): seq[string] {.
   rtl, extern: "npegs$1".} =
   ## returns all matching *substrings* of `s` that match `pattern`.
-  ## If it does not match, @[] is returned.
+  ## If it does not match, `@[]` is returned.
   result = @[]
   for it in findAll(s, pattern, start): result.add it