Merge pull request #935 from fadushin/doc-build-fix

Fixed doc build

These changes are made under both the "Apache 2.0" and the "GNU Lesser General
Public License 2.1 or later" license terms (dual license).

SPDX-License-Identifier: Apache-2.0 OR LGPL-2.1-or-later

libs/estdlib/src/lists.erl

@@ -124,7 +124,7 @@ delete(E, [H | T], Accum) ->
 %% @equiv lists:reverse(L, [])
 %% @doc Erlang/OTP implementation of this function actually handles few simple
 %% cases and calls lists:reverse/2 for the more genertic case. Consequently,
-%% calling `lists:reverse/1` without a list or with an improper list of two
+%% calling `lists:reverse/1' without a list or with an improper list of two
 %% elements will fail with a function clause exception on Erlang/OTP and with a
 %% badarg exception with this implementation.
 %% @end
@@ -143,15 +143,15 @@ reverse(_L) ->
 %%
 %% If L is not a proper list, the function fails with badarg.
 %%
-%% Following Erlang/OTP tradition, `lists:reverse/1,2` is a nif. It computes
+%% Following Erlang/OTP tradition, `lists:reverse/1,2' is a nif. It computes
 %% the length and then allocates memory for the list at once (2 * n terms).
 %%
 %% While this is much faster with AtomVM as allocations are expensive with
 %% default heap growth strategy, it can consume more memory until the list
 %% passed is garbage collected, as opposed to a recursive implementation where
 %% the process garbage collect part of the input list during the reversal.
 %%
-%% Consequently, tail-recursive implementations calling `lists:reverse/2`
+%% Consequently, tail-recursive implementations calling `lists:reverse/2'
 %% can be as expensive or more expensive in memory than list comprehensions or
 %% non-tail recursive versions depending on the number of terms saved on the
 %% stack between calls.