% This LaTeX document was generated using the LaTeX backend of PlDoc,
% The SWI-Prolog documentation system



\begin{summarylist}{ll}
\dcgsummary{alpha_to_lower}{1}{Read a letter (class =alpha=) and return it as a lowercase letter.}
\dcgsummary{atom}{1}{Generate codes of Atom.}
\dcgsummary{blank}{0}{Take next =space= character from input.}
\dcgsummary{blanks}{0}{Skip zero or more white-space characters.}
\dcgsummary{blanks_to_nl}{0}{Take a sequence of blank\Sidiv{}0 codes if blanks are followed by a newline or end of the input.}
\dcgsummary{csym}{1}{Recognise a C symbol according to the `csymf` and `csym` code type classification provided by the C library.}
\dcgsummary{digit}{1}{Number processing.}
\dcgsummary{digits}{1}{Number processing.}
\dcgsummary{eol}{0}{Matches end-of-line.}
\dcgsummary{eos}{0}{Matches end-of-input.}
\dcgsummary{float}{1}{Process a floating point number.}
\dcgsummary{integer}{1}{Number processing.}
\dcgsummary{nonblank}{1}{Code is the next non-blank (=graph=) character.}
\dcgsummary{nonblanks}{1}{Take all =graph= characters.}
\dcgsummary{number}{1}{Generate extract a number.}
\dcgsummary{prolog_var_name}{1}{Matches a Prolog variable name.}
\dcgsummary{remainder}{1}{Unify List with the remainder of the input.}
\dcgsummary{string}{1}{Take as few as possible tokens from the input, taking one more each time on backtracking.}
\dcgsummary{string_without}{2}{Take as many codes from the input until the next character code appears in the list EndCodes.}
\dcgsummary{white}{0}{Take next =white= character from input.}
\dcgsummary{whites}{0}{Skip white space _inside_ a line.}
\dcgsummary{xdigit}{1}{True if the next code is a hexdecimal digit with Weight.}
\dcgsummary{xdigits}{1}{List of weights of a sequence of hexadecimal codes.}
\dcgsummary{xinteger}{1}{Generate or extract an integer from a sequence of hexadecimal digits.}
\end{summarylist}