summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/source/latex/l3experimental/l3str/l3regex.dtx
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2013-07-12 22:54:42 +0000
committerKarl Berry <karl@freefriends.org>2013-07-12 22:54:42 +0000
commit60ede63177ff54dd8d1934012fbecce179a633ee (patch)
tree9dbd9e4608c9a0caa9864fedf49f0a2aea36fedf /Master/texmf-dist/source/latex/l3experimental/l3str/l3regex.dtx
parentc2d4fa6f59f3c566ccd85e3b250f0a27485bbaea (diff)
l3 (12jul13)
git-svn-id: svn://tug.org/texlive/trunk@31181 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/source/latex/l3experimental/l3str/l3regex.dtx')
-rw-r--r--Master/texmf-dist/source/latex/l3experimental/l3str/l3regex.dtx26
1 files changed, 13 insertions, 13 deletions
diff --git a/Master/texmf-dist/source/latex/l3experimental/l3str/l3regex.dtx b/Master/texmf-dist/source/latex/l3experimental/l3str/l3regex.dtx
index 7260ca7667f..1ab8905e6aa 100644
--- a/Master/texmf-dist/source/latex/l3experimental/l3str/l3regex.dtx
+++ b/Master/texmf-dist/source/latex/l3experimental/l3str/l3regex.dtx
@@ -35,7 +35,7 @@
%
%<*driver|package>
\RequirePackage{expl3}
-\GetIdInfo$Id: l3regex.dtx 4455 2013-01-22 20:38:19Z bruno $
+\GetIdInfo$Id: l3regex.dtx 4482 2013-04-24 21:05:12Z joseph $
{L3 Experimental regular expressions}
%</driver|package>
%<*driver>
@@ -752,7 +752,7 @@
% integer \meta{position}, with $\texttt{min_pos} - 1 \leq
% \meta{position} \leq \texttt{max_pos}$. The lowest and highest
% positions correspond to imaginary begin and end markers (with
-% inacessible category code and character code).
+% inaccessible category code and character code).
% \item \emph{Query}: the token list to which we apply the regular
% expression.
% \item \emph{State}: each state of the \textsc{nfa} is labelled by an
@@ -767,7 +767,7 @@
% unique id for all the steps of the matching algorithm.
% \end{itemize}
%
-% To acheive a good performance, we abuse \TeX{}'s registers in two
+% To achieve a good performance, we abuse \TeX{}'s registers in two
% ways. We access registers directly by number rather than tying them
% to control sequence using \cs{int_new:N} and other allocation
% functions. And we store integers in \tn{dimen} registers in scaled
@@ -913,7 +913,7 @@
%
% \begin{macro}[int]{\@@_item_reverse:n}
% This function makes showing regular expressions easier, and lets us
-% define |\D| in terms of |\d| for instance. There is a subtelty: the
+% define |\D| in terms of |\d| for instance. There is a subtlety: the
% end of the query is marked by $-2$, and will thus match |\D| and
% other negated properties; this case is caught by another part of
% the code.
@@ -1596,7 +1596,7 @@
% \begin{variable}{\l_@@_catcodes_bool}
% We wish to allow constructions such as |\c[^BE](..\cL[a-z]..)|,
% where the outer catcode test applies to the whole group, but is
-% superseeded by the inner catcode test. For this to work, we need to
+% superseded by the inner catcode test. For this to work, we need to
% keep track of lists of allowed category codes:
% \cs{l_@@_catcodes_int} and \cs{l_@@_default_catcodes_int} are
% bitmaps, sums of $4^c$, for all allowed catcodes $c$. The latter is
@@ -2018,7 +2018,7 @@
% \end{macrocode}
% \end{macro}
%
-% \subsubsection{Quantifers}
+% \subsubsection{Quantifiers}
%
% \begin{macro}[int]{\@@_compile_quantifier:w}
% This looks ahead and finds any quantifier (special character equal
@@ -2436,7 +2436,7 @@
% \begin{macro}[aux]{\@@_compile_[:}
% In a class, left brackets might introduce a \textsc{posix} character
% class, or mean nothing. Immediately following |\c|\meta{category},
-% we must insert the apropriate catcode test, then parse the class; we
+% we must insert the appropriate catcode test, then parse the class; we
% pre-expand the catcode as an optimization. Otherwise (modes $0$,
% $-2$ and $-6$) just parse the class. The mode is updated later.
% \begin{macrocode}
@@ -2614,7 +2614,7 @@
% using \pkg{l3tl-build} within a \TeX{} group, which automatically
% makes sure that options (case-sensitivity and default catcode) are
% reset at the end of the group. The argument |#1| is
-% \cs{@@_group:nnnN} or a variant thereof. A small subtelty to
+% \cs{@@_group:nnnN} or a variant thereof. A small subtlety to
% support |\cL(abc)| as a shorthand for |(\cLa\cLb\cLc)|: exit any
% pending catcode test, save the category code at the start of the
% group as the default catcode for that group, and make sure that the
@@ -3093,7 +3093,7 @@
%
% \begin{macro}[aux]{\@@_show_one:n}
% Every part of the final message go through this function, which adds
-% one line to the output, with the apropriate prefix.
+% one line to the output, with the appropriate prefix.
% \begin{macrocode}
\cs_new_protected:Npn \@@_show_one:n #1
{
@@ -4082,7 +4082,7 @@
% \tn{toks} register for the target state of the transition, to be
% retrieved when matching at the next position. When a thread
% succeeds, this property list is copied to
-% \cs{l_@@_success_submatches_prop}: only the last sucessful thread
+% \cs{l_@@_success_submatches_prop}: only the last successful thread
% will remain there.
% \begin{macrocode}
\prop_new:N \l_@@_current_submatches_prop
@@ -4184,7 +4184,7 @@
% First store the query into \tn{toks} and \tn{muskip} registers (see
% \cs{@@_query_set:nnn}). Then initialize the variables that should
% be set once for each user function (even for multiple
-% matches). Namely, the overall matching is not yet sucessful; none of
+% matches). Namely, the overall matching is not yet successful; none of
% the states should be marked as visited (\tn{dimen} registers), and
% we start at step $0$; we pretend that there was a previous match
% ending at the start of the query, which was not empty (to avoid
@@ -4226,7 +4226,7 @@
% \cs{@@_match_once:}. First initialize some variables: set the
% conditional which detects identical empty matches; this match
% attempt starts at the previous \texttt{success_pos}, is not yet
-% sucessful, and has no submatches yet; clear the array of active
+% successful, and has no submatches yet; clear the array of active
% threads, and put the starting state $0$ in it. We are then almost
% ready to read our first token in the query, but we actually start
% one position earlier than the start, and \texttt{get} that token, so
@@ -5927,7 +5927,7 @@
% This is not technically a message, but seems related enough to go
% there. The arguments are: |#1| is the minimum number of repetitions;
% |#2| is the number of allowed extra repetitions ($-1$ for infinite
-% number), and |#3| tells us aboud lazyness.
+% number), and |#3| tells us about lazyness.
% \begin{macrocode}
\cs_new:Npn \@@_msg_repeated:nnN #1#2#3
{