diff options
Diffstat (limited to 'contrib/bc/manuals/dc/EP.1')
| -rw-r--r-- | contrib/bc/manuals/dc/EP.1 | 1177 |
1 files changed, 684 insertions, 493 deletions
diff --git a/contrib/bc/manuals/dc/EP.1 b/contrib/bc/manuals/dc/EP.1 index 1dd0da3235e7..ad6277c249b0 100644 --- a/contrib/bc/manuals/dc/EP.1 +++ b/contrib/bc/manuals/dc/EP.1 @@ -25,18 +25,18 @@ .\" ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE .\" POSSIBILITY OF SUCH DAMAGE. .\" -.TH "DC" "1" "March 2021" "Gavin D. Howard" "General Commands Manual" +.TH "DC" "1" "April 2021" "Gavin D. Howard" "General Commands Manual" .SH Name .PP dc - arbitrary-precision decimal reverse-Polish notation calculator .SH SYNOPSIS .PP -\f[B]dc\f[R] [\f[B]-hiPvVx\f[R]] [\f[B]--version\f[R]] +\f[B]dc\f[R] [\f[B]-hiPRvVx\f[R]] [\f[B]--version\f[R]] [\f[B]--help\f[R]] [\f[B]--interactive\f[R]] [\f[B]--no-prompt\f[R]] -[\f[B]--extended-register\f[R]] [\f[B]-e\f[R] \f[I]expr\f[R]] -[\f[B]--expression\f[R]=\f[I]expr\f[R]\&...] [\f[B]-f\f[R] -\f[I]file\f[R]\&...] [\f[B]--file\f[R]=\f[I]file\f[R]\&...] -[\f[I]file\f[R]\&...] +[\f[B]--no-read-prompt\f[R]] [\f[B]--extended-register\f[R]] +[\f[B]-e\f[R] \f[I]expr\f[R]] [\f[B]--expression\f[R]=\f[I]expr\f[R]...] +[\f[B]-f\f[R] \f[I]file\f[R]...] [\f[B]--file\f[R]=\f[I]file\f[R]...] +[\f[I]file\f[R]...] .SH DESCRIPTION .PP dc(1) is an arbitrary-precision calculator. @@ -70,79 +70,100 @@ argument or define the environment variable \f[B]DC_EXPR_EXIT\f[R]. .SH OPTIONS .PP The following are the options that dc(1) accepts. -.TP +.PP \f[B]-h\f[R], \f[B]--help\f[R] -Prints a usage message and quits. -.TP +.PP +: Prints a usage message and quits. +.PP \f[B]-v\f[R], \f[B]-V\f[R], \f[B]--version\f[R] -Print the version information (copyright header) and exit. -.TP +.PP +: Print the version information (copyright header) and exit. +.PP \f[B]-i\f[R], \f[B]--interactive\f[R] -Forces interactive mode. +.PP +: Forces interactive mode. (See the \f[B]INTERACTIVE MODE\f[R] section.) -.RS +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]-P\f[R], \f[B]--no-prompt\f[R] -This option is a no-op. -.RS .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP +: This option is a no-op. +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi +.PP +\f[B]-R\f[R], \f[B]--no-read-prompt\f[R] +.PP +: This option is a no-op. +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi +.PP \f[B]-x\f[R] \f[B]--extended-register\f[R] -Enables extended register mode. +.PP +: Enables extended register mode. See the \f[I]Extended Register Mode\f[R] subsection of the \f[B]REGISTERS\f[R] section for more information. -.RS +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]-e\f[R] \f[I]expr\f[R], \f[B]--expression\f[R]=\f[I]expr\f[R] -Evaluates \f[I]expr\f[R]. +.PP +: Evaluates \f[I]expr\f[R]. If multiple expressions are given, they are evaluated in order. If files are given as well (see below), the expressions and files are evaluated in the order given. This means that if a file is given before an expression, the file is read in and evaluated first. -.RS -.PP -If this option is given on the command-line (i.e., not in -\f[B]DC_ENV_ARGS\f[R], see the \f[B]ENVIRONMENT VARIABLES\f[R] section), -then after processing all expressions and files, dc(1) will exit, unless -\f[B]-\f[R] (\f[B]stdin\f[R]) was given as an argument at least once to -\f[B]-f\f[R] or \f[B]--file\f[R], whether on the command-line or in -\f[B]DC_ENV_ARGS\f[R]. -However, if any other \f[B]-e\f[R], \f[B]--expression\f[R], -\f[B]-f\f[R], or \f[B]--file\f[R] arguments are given after -\f[B]-f-\f[R] or equivalent is given, dc(1) will give a fatal error and -exit. +.IP +.nf +\f[C] +If this option is given on the command-line (i.e., not in **DC_ENV_ARGS**, +see the **ENVIRONMENT VARIABLES** section), then after processing all +expressions and files, dc(1) will exit, unless **-** (**stdin**) was given +as an argument at least once to **-f** or **-\[rs]-file**, whether on the +command-line or in **DC_ENV_ARGS**. However, if any other **-e**, +**-\[rs]-expression**, **-f**, or **-\[rs]-file** arguments are given after **-f-** +or equivalent is given, dc(1) will give a fatal error and exit. + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]-f\f[R] \f[I]file\f[R], \f[B]--file\f[R]=\f[I]file\f[R] -Reads in \f[I]file\f[R] and evaluates it, line by line, as though it +.PP +: Reads in \f[I]file\f[R] and evaluates it, line by line, as though it were read through \f[B]stdin\f[R]. If expressions are also given (see above), the expressions are evaluated in the order given. -.RS -.PP -If this option is given on the command-line (i.e., not in -\f[B]DC_ENV_ARGS\f[R], see the \f[B]ENVIRONMENT VARIABLES\f[R] section), -then after processing all expressions and files, dc(1) will exit, unless -\f[B]-\f[R] (\f[B]stdin\f[R]) was given as an argument at least once to -\f[B]-f\f[R] or \f[B]--file\f[R]. -However, if any other \f[B]-e\f[R], \f[B]--expression\f[R], -\f[B]-f\f[R], or \f[B]--file\f[R] arguments are given after -\f[B]-f-\f[R] or equivalent is given, dc(1) will give a fatal error and -exit. -.PP -This is a \f[B]non-portable extension\f[R]. -.RE +.IP +.nf +\f[C] +If this option is given on the command-line (i.e., not in **DC_ENV_ARGS**, +see the **ENVIRONMENT VARIABLES** section), then after processing all +expressions and files, dc(1) will exit, unless **-** (**stdin**) was given +as an argument at least once to **-f** or **-\[rs]-file**. However, if any other +**-e**, **-\[rs]-expression**, **-f**, or **-\[rs]-file** arguments are given after +**-f-** or equivalent is given, dc(1) will give a fatal error and exit. + +This is a **non-portable extension**. +\f[R] +.fi .PP All long options are \f[B]non-portable extensions\f[R]. .SH STDOUT @@ -185,7 +206,7 @@ Input is processed immediately when entered. .PP \f[B]ibase\f[R] is a register (see the \f[B]REGISTERS\f[R] section) that determines how to interpret constant numbers. -It is the \[lq]input\[rq] base, or the number base used for interpreting +It is the \[dq]input\[dq] base, or the number base used for interpreting input numbers. \f[B]ibase\f[R] is initially \f[B]10\f[R]. The max allowable value for \f[B]ibase\f[R] is \f[B]16\f[R]. @@ -195,7 +216,7 @@ programs with the \f[B]T\f[R] command. .PP \f[B]obase\f[R] is a register (see the \f[B]REGISTERS\f[R] section) that determines how to output results. -It is the \[lq]output\[rq] base, or the number base used for outputting +It is the \[dq]output\[dq] base, or the number base used for outputting numbers. \f[B]obase\f[R] is initially \f[B]10\f[R]. The max allowable value for \f[B]obase\f[R] is \f[B]DC_BASE_MAX\f[R] and @@ -237,265 +258,332 @@ The valid commands are listed below. .SS Printing .PP These commands are used for printing. -.TP +.PP \f[B]p\f[R] -Prints the value on top of the stack, whether number or string, and -prints a newline after. -.RS .PP +: Prints the value on top of the stack, whether number or string, and +prints a newline after. +.IP +.nf +\f[C] This does not alter the stack. -.RE -.TP +\f[R] +.fi +.PP \f[B]n\f[R] -Prints the value on top of the stack, whether number or string, and pops -it off of the stack. -.TP +.PP +: Prints the value on top of the stack, whether number or string, and +pops it off of the stack. +.PP \f[B]P\f[R] -Pops a value off the stack. -.RS .PP +: Pops a value off the stack. +.IP +.nf +\f[C] If the value is a number, it is truncated and the absolute value of the -result is printed as though \f[B]obase\f[R] is \f[B]UCHAR_MAX+1\f[R] and -each digit is interpreted as an ASCII character, making it a byte -stream. -.PP +result is printed as though **obase** is **UCHAR_MAX+1** and each digit is +interpreted as an ASCII character, making it a byte stream. + If the value is a string, it is printed without a trailing newline. + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]f\f[R] -Prints the entire contents of the stack, in order from newest to oldest, -without altering anything. -.RS .PP +: Prints the entire contents of the stack, in order from newest to +oldest, without altering anything. +.IP +.nf +\f[C] Users should use this command when they get lost. -.RE +\f[R] +.fi .SS Arithmetic .PP These are the commands used for arithmetic. -.TP +.PP \f[B]+\f[R] -The top two values are popped off the stack, added, and the result is +.PP +: The top two values are popped off the stack, added, and the result is pushed onto the stack. The \f[I]scale\f[R] of the result is equal to the max \f[I]scale\f[R] of both operands. -.TP +.PP \f[B]-\f[R] -The top two values are popped off the stack, subtracted, and the result -is pushed onto the stack. +.PP +: The top two values are popped off the stack, subtracted, and the +result is pushed onto the stack. The \f[I]scale\f[R] of the result is equal to the max \f[I]scale\f[R] of both operands. -.TP +.PP \f[B]*\f[R] -The top two values are popped off the stack, multiplied, and the result -is pushed onto the stack. +.PP +: The top two values are popped off the stack, multiplied, and the +result is pushed onto the stack. If \f[B]a\f[R] is the \f[I]scale\f[R] of the first expression and \f[B]b\f[R] is the \f[I]scale\f[R] of the second expression, the \f[I]scale\f[R] of the result is equal to \f[B]min(a+b,max(scale,a,b))\f[R] where \f[B]min()\f[R] and \f[B]max()\f[R] return the obvious values. -.TP +.PP \f[B]/\f[R] -The top two values are popped off the stack, divided, and the result is -pushed onto the stack. -The \f[I]scale\f[R] of the result is equal to \f[B]scale\f[R]. -.RS .PP -The first value popped off of the stack must be non-zero. -.RE -.TP -\f[B]%\f[R] -The top two values are popped off the stack, remaindered, and the result +: The top two values are popped off the stack, divided, and the result is pushed onto the stack. -.RS +The \f[I]scale\f[R] of the result is equal to \f[B]scale\f[R]. +.IP +.nf +\f[C] +The first value popped off of the stack must be non-zero. +\f[R] +.fi .PP -Remaindering is equivalent to 1) Computing \f[B]a/b\f[R] to current -\f[B]scale\f[R], and 2) Using the result of step 1 to calculate -\f[B]a-(a/b)*b\f[R] to \f[I]scale\f[R] -\f[B]max(scale+scale(b),scale(a))\f[R]. +\f[B]%\f[R] .PP +: The top two values are popped off the stack, remaindered, and the +result is pushed onto the stack. +.IP +.nf +\f[C] +Remaindering is equivalent to 1) Computing **a/b** to current **scale**, and +2) Using the result of step 1 to calculate **a-(a/b)\[rs]*b** to *scale* +**max(scale+scale(b),scale(a))**. + The first value popped off of the stack must be non-zero. -.RE -.TP +\f[R] +.fi +.PP \f[B]\[ti]\f[R] -The top two values are popped off the stack, divided and remaindered, +.PP +: The top two values are popped off the stack, divided and remaindered, and the results (divided first, remainder second) are pushed onto the stack. This is equivalent to \f[B]x y / x y %\f[R] except that \f[B]x\f[R] and \f[B]y\f[R] are only evaluated once. -.RS -.PP +.IP +.nf +\f[C] The first value popped off of the stack must be non-zero. + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]\[ha]\f[R] -The top two values are popped off the stack, the second is raised to the -power of the first, and the result is pushed onto the stack. -The \f[I]scale\f[R] of the result is equal to \f[B]scale\f[R]. -.RS .PP +: The top two values are popped off the stack, the second is raised to +the power of the first, and the result is pushed onto the stack. +The \f[I]scale\f[R] of the result is equal to \f[B]scale\f[R]. +.IP +.nf +\f[C] The first value popped off of the stack must be an integer, and if that value is negative, the second value popped off of the stack must be non-zero. -.RE -.TP +\f[R] +.fi +.PP \f[B]v\f[R] -The top value is popped off the stack, its square root is computed, and -the result is pushed onto the stack. -The \f[I]scale\f[R] of the result is equal to \f[B]scale\f[R]. -.RS .PP +: The top value is popped off the stack, its square root is computed, +and the result is pushed onto the stack. +The \f[I]scale\f[R] of the result is equal to \f[B]scale\f[R]. +.IP +.nf +\f[C] The value popped off of the stack must be non-negative. -.RE -.TP +\f[R] +.fi +.PP \f[B]_\f[R] -If this command \f[I]immediately\f[R] precedes a number (i.e., no spaces -or other commands), then that number is input as a negative number. -.RS .PP -Otherwise, the top value on the stack is popped and copied, and the copy -is negated and pushed onto the stack. -This behavior without a number is a \f[B]non-portable extension\f[R]. -.RE -.TP +: If this command \f[I]immediately\f[R] precedes a number (i.e., no +spaces or other commands), then that number is input as a negative +number. +.IP +.nf +\f[C] +Otherwise, the top value on the stack is popped and copied, and the copy is +negated and pushed onto the stack. This behavior without a number is a +**non-portable extension**. +\f[R] +.fi +.PP \f[B]b\f[R] -The top value is popped off the stack, and if it is zero, it is pushed +.PP +: The top value is popped off the stack, and if it is zero, it is pushed back onto the stack. Otherwise, its absolute value is pushed onto the stack. -.RS +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]|\f[R] -The top three values are popped off the stack, a modular exponentiation -is computed, and the result is pushed onto the stack. -.RS .PP +: The top three values are popped off the stack, a modular +exponentiation is computed, and the result is pushed onto the stack. +.IP +.nf +\f[C] The first value popped is used as the reduction modulus and must be an -integer and non-zero. -The second value popped is used as the exponent and must be an integer -and non-negative. -The third value popped is the base and must be an integer. +integer and non-zero. The second value popped is used as the exponent and +must be an integer and non-negative. The third value popped is the base and +must be an integer. + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]G\f[R] -The top two values are popped off of the stack, they are compared, and a -\f[B]1\f[R] is pushed if they are equal, or \f[B]0\f[R] otherwise. -.RS .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP +: The top two values are popped off of the stack, they are compared, and +a \f[B]1\f[R] is pushed if they are equal, or \f[B]0\f[R] otherwise. +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi +.PP \f[B]N\f[R] -The top value is popped off of the stack, and if it a \f[B]0\f[R], a +.PP +: The top value is popped off of the stack, and if it a \f[B]0\f[R], a \f[B]1\f[R] is pushed; otherwise, a \f[B]0\f[R] is pushed. -.RS +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B](\f[R] -The top two values are popped off of the stack, they are compared, and a -\f[B]1\f[R] is pushed if the first is less than the second, or +.PP +: The top two values are popped off of the stack, they are compared, and +a \f[B]1\f[R] is pushed if the first is less than the second, or \f[B]0\f[R] otherwise. -.RS +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]{\f[R] -The top two values are popped off of the stack, they are compared, and a -\f[B]1\f[R] is pushed if the first is less than or equal to the second, -or \f[B]0\f[R] otherwise. -.RS .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP +: The top two values are popped off of the stack, they are compared, and +a \f[B]1\f[R] is pushed if the first is less than or equal to the +second, or \f[B]0\f[R] otherwise. +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi +.PP \f[B])\f[R] -The top two values are popped off of the stack, they are compared, and a -\f[B]1\f[R] is pushed if the first is greater than the second, or +.PP +: The top two values are popped off of the stack, they are compared, and +a \f[B]1\f[R] is pushed if the first is greater than the second, or \f[B]0\f[R] otherwise. -.RS +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]}\f[R] -The top two values are popped off of the stack, they are compared, and a -\f[B]1\f[R] is pushed if the first is greater than or equal to the +.PP +: The top two values are popped off of the stack, they are compared, and +a \f[B]1\f[R] is pushed if the first is greater than or equal to the second, or \f[B]0\f[R] otherwise. -.RS +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]M\f[R] -The top two values are popped off of the stack. +.PP +: The top two values are popped off of the stack. If they are both non-zero, a \f[B]1\f[R] is pushed onto the stack. If either of them is zero, or both of them are, then a \f[B]0\f[R] is pushed onto the stack. -.RS +.IP +.nf +\f[C] +This is like the **&&** operator in bc(1), and it is *not* a short-circuit +operator. + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is like the \f[B]&&\f[R] operator in bc(1), and it is \f[I]not\f[R] -a short-circuit operator. -.PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]m\f[R] -The top two values are popped off of the stack. +.PP +: The top two values are popped off of the stack. If at least one of them is non-zero, a \f[B]1\f[R] is pushed onto the stack. If both of them are zero, then a \f[B]0\f[R] is pushed onto the stack. -.RS -.PP -This is like the \f[B]||\f[R] operator in bc(1), and it is \f[I]not\f[R] -a short-circuit operator. -.PP -This is a \f[B]non-portable extension\f[R]. -.RE +.IP +.nf +\f[C] +This is like the **||** operator in bc(1), and it is *not* a short-circuit +operator. + +This is a **non-portable extension**. +\f[R] +.fi .SS Stack Control .PP These commands control the stack. -.TP +.PP \f[B]c\f[R] -Removes all items from (\[lq]clears\[rq]) the stack. -.TP +.PP +: Removes all items from (\[dq]clears\[dq]) the stack. +.PP \f[B]d\f[R] -Copies the item on top of the stack (\[lq]duplicates\[rq]) and pushes +.PP +: Copies the item on top of the stack (\[dq]duplicates\[dq]) and pushes the copy onto the stack. -.TP +.PP \f[B]r\f[R] -Swaps (\[lq]reverses\[rq]) the two top items on the stack. -.TP +.PP +: Swaps (\[dq]reverses\[dq]) the two top items on the stack. +.PP \f[B]R\f[R] -Pops (\[lq]removes\[rq]) the top value from the stack. +.PP +: Pops (\[dq]removes\[dq]) the top value from the stack. .SS Register Control .PP These commands control registers (see the \f[B]REGISTERS\f[R] section). -.TP +.PP \f[B]s\f[R]\f[I]r\f[R] -Pops the value off the top of the stack and stores it into register +.PP +: Pops the value off the top of the stack and stores it into register \f[I]r\f[R]. -.TP +.PP \f[B]l\f[R]\f[I]r\f[R] -Copies the value in register \f[I]r\f[R] and pushes it onto the stack. +.PP +: Copies the value in register \f[I]r\f[R] and pushes it onto the stack. This does not alter the contents of \f[I]r\f[R]. -.TP +.PP \f[B]S\f[R]\f[I]r\f[R] -Pops the value off the top of the (main) stack and pushes it onto the +.PP +: Pops the value off the top of the (main) stack and pushes it onto the stack of register \f[I]r\f[R]. The previous value of the register becomes inaccessible. -.TP +.PP \f[B]L\f[R]\f[I]r\f[R] -Pops the value off the top of the stack for register \f[I]r\f[R] and +.PP +: Pops the value off the top of the stack for register \f[I]r\f[R] and push it onto the main stack. The previous value in the stack for register \f[I]r\f[R], if any, is now accessible via the \f[B]l\f[R]\f[I]r\f[R] command. @@ -504,68 +592,86 @@ accessible via the \f[B]l\f[R]\f[I]r\f[R] command. These commands control the values of \f[B]ibase\f[R], \f[B]obase\f[R], and \f[B]scale\f[R]. Also see the \f[B]SYNTAX\f[R] section. -.TP +.PP \f[B]i\f[R] -Pops the value off of the top of the stack and uses it to set +.PP +: Pops the value off of the top of the stack and uses it to set \f[B]ibase\f[R], which must be between \f[B]2\f[R] and \f[B]16\f[R], inclusive. -.RS +.IP +.nf +\f[C] +If the value on top of the stack has any *scale*, the *scale* is ignored. +\f[R] +.fi .PP -If the value on top of the stack has any \f[I]scale\f[R], the -\f[I]scale\f[R] is ignored. -.RE -.TP \f[B]o\f[R] -Pops the value off of the top of the stack and uses it to set +.PP +: Pops the value off of the top of the stack and uses it to set \f[B]obase\f[R], which must be between \f[B]2\f[R] and \f[B]DC_BASE_MAX\f[R], inclusive (see the \f[B]LIMITS\f[R] section). -.RS +.IP +.nf +\f[C] +If the value on top of the stack has any *scale*, the *scale* is ignored. +\f[R] +.fi .PP -If the value on top of the stack has any \f[I]scale\f[R], the -\f[I]scale\f[R] is ignored. -.RE -.TP \f[B]k\f[R] -Pops the value off of the top of the stack and uses it to set +.PP +: Pops the value off of the top of the stack and uses it to set \f[B]scale\f[R], which must be non-negative. -.RS +.IP +.nf +\f[C] +If the value on top of the stack has any *scale*, the *scale* is ignored. +\f[R] +.fi .PP -If the value on top of the stack has any \f[I]scale\f[R], the -\f[I]scale\f[R] is ignored. -.RE -.TP \f[B]I\f[R] -Pushes the current value of \f[B]ibase\f[R] onto the main stack. -.TP +.PP +: Pushes the current value of \f[B]ibase\f[R] onto the main stack. +.PP \f[B]O\f[R] -Pushes the current value of \f[B]obase\f[R] onto the main stack. -.TP +.PP +: Pushes the current value of \f[B]obase\f[R] onto the main stack. +.PP \f[B]K\f[R] -Pushes the current value of \f[B]scale\f[R] onto the main stack. -.TP +.PP +: Pushes the current value of \f[B]scale\f[R] onto the main stack. +.PP \f[B]T\f[R] -Pushes the maximum allowable value of \f[B]ibase\f[R] onto the main +.PP +: Pushes the maximum allowable value of \f[B]ibase\f[R] onto the main stack. -.RS +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]U\f[R] -Pushes the maximum allowable value of \f[B]obase\f[R] onto the main +.PP +: Pushes the maximum allowable value of \f[B]obase\f[R] onto the main stack. -.RS +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]V\f[R] -Pushes the maximum allowable value of \f[B]scale\f[R] onto the main -stack. -.RS .PP -This is a \f[B]non-portable extension\f[R]. -.RE +: Pushes the maximum allowable value of \f[B]scale\f[R] onto the main +stack. +.IP +.nf +\f[C] +This is a **non-portable extension**. +\f[R] +.fi .SS Strings .PP The following commands control strings. @@ -582,233 +688,292 @@ Strings can also be executed as macros. For example, if the string \f[B][1pR]\f[R] is executed as a macro, then the code \f[B]1pR\f[R] is executed, meaning that the \f[B]1\f[R] will be printed with a newline after and then popped from the stack. -.TP -\f[B][\f[R]_characters_\f[B]]\f[R] -Makes a string containing \f[I]characters\f[R] and pushes it onto the -stack. -.RS .PP -If there are brackets (\f[B][\f[R] and \f[B]]\f[R]) in the string, then -they must be balanced. -Unbalanced brackets can be escaped using a backslash (\f[B]\[rs]\f[R]) -character. +\f[B][\f[R]\f[I]characters\f[R]\f[B]]\f[R] .PP +: Makes a string containing \f[I]characters\f[R] and pushes it onto the +stack. +.IP +.nf +\f[C] +If there are brackets (**\[rs][** and **\[rs]]**) in the string, then they must be +balanced. Unbalanced brackets can be escaped using a backslash (**\[rs]\[rs]**) +character. + If there is a backslash character in the string, the character after it -(even another backslash) is put into the string verbatim, but the -(first) backslash is not. -.RE -.TP -\f[B]a\f[R] -The value on top of the stack is popped. -.RS +(even another backslash) is put into the string verbatim, but the (first) +backslash is not. +\f[R] +.fi .PP -If it is a number, it is truncated and its absolute value is taken. -The result mod \f[B]UCHAR_MAX+1\f[R] is calculated. -If that result is \f[B]0\f[R], push an empty string; otherwise, push a -one-character string where the character is the result of the mod -interpreted as an ASCII character. +\f[B]a\f[R] .PP -If it is a string, then a new string is made. -If the original string is empty, the new string is empty. -If it is not, then the first character of the original string is used to -create the new string as a one-character string. -The new string is then pushed onto the stack. +: The value on top of the stack is popped. +.IP +.nf +\f[C] +If it is a number, it is truncated and its absolute value is taken. The +result mod **UCHAR_MAX+1** is calculated. If that result is **0**, push an +empty string; otherwise, push a one-character string where the character is +the result of the mod interpreted as an ASCII character. + +If it is a string, then a new string is made. If the original string is +empty, the new string is empty. If it is not, then the first character of +the original string is used to create the new string as a one-character +string. The new string is then pushed onto the stack. + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]x\f[R] -Pops a value off of the top of the stack. -.RS .PP +: Pops a value off of the top of the stack. +.IP +.nf +\f[C] If it is a number, it is pushed back onto the stack. -.PP + If it is a string, it is executed as a macro. -.PP + This behavior is the norm whenever a macro is executed, whether by this command or by the conditional execution commands below. -.RE -.TP +\f[R] +.fi +.PP \f[B]>\f[R]\f[I]r\f[R] -Pops two values off of the stack that must be numbers and compares them. +.PP +: Pops two values off of the stack that must be numbers and compares +them. If the first value is greater than the second, then the contents of register \f[I]r\f[R] are executed. -.RS +.IP +.nf +\f[C] +For example, **0 1>a** will execute the contents of register **a**, and +**1 0>a** will not. + +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). +\f[R] +.fi .PP -For example, \f[B]0 1>a\f[R] will execute the contents of register -\f[B]a\f[R], and \f[B]1 0>a\f[R] will not. -.PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). -.RE -.TP \f[B]>\f[R]\f[I]r\f[R]\f[B]e\f[R]\f[I]s\f[R] -Like the above, but will execute register \f[I]s\f[R] if the comparison -fails. -.RS .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). +: Like the above, but will execute register \f[I]s\f[R] if the +comparison fails. +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]!>\f[R]\f[I]r\f[R] -Pops two values off of the stack that must be numbers and compares them. +.PP +: Pops two values off of the stack that must be numbers and compares +them. If the first value is not greater than the second (less than or equal to), then the contents of register \f[I]r\f[R] are executed. -.RS +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). +\f[R] +.fi .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). -.RE -.TP \f[B]!>\f[R]\f[I]r\f[R]\f[B]e\f[R]\f[I]s\f[R] -Like the above, but will execute register \f[I]s\f[R] if the comparison -fails. -.RS .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). +: Like the above, but will execute register \f[I]s\f[R] if the +comparison fails. +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]<\f[R]\f[I]r\f[R] -Pops two values off of the stack that must be numbers and compares them. +.PP +: Pops two values off of the stack that must be numbers and compares +them. If the first value is less than the second, then the contents of register \f[I]r\f[R] are executed. -.RS +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). +\f[R] +.fi .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). -.RE -.TP \f[B]<\f[R]\f[I]r\f[R]\f[B]e\f[R]\f[I]s\f[R] -Like the above, but will execute register \f[I]s\f[R] if the comparison -fails. -.RS .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). +: Like the above, but will execute register \f[I]s\f[R] if the +comparison fails. +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]!<\f[R]\f[I]r\f[R] -Pops two values off of the stack that must be numbers and compares them. +.PP +: Pops two values off of the stack that must be numbers and compares +them. If the first value is not less than the second (greater than or equal to), then the contents of register \f[I]r\f[R] are executed. -.RS +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). +\f[R] +.fi .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). -.RE -.TP \f[B]!<\f[R]\f[I]r\f[R]\f[B]e\f[R]\f[I]s\f[R] -Like the above, but will execute register \f[I]s\f[R] if the comparison -fails. -.RS .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). +: Like the above, but will execute register \f[I]s\f[R] if the +comparison fails. +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]=\f[R]\f[I]r\f[R] -Pops two values off of the stack that must be numbers and compares them. +.PP +: Pops two values off of the stack that must be numbers and compares +them. If the first value is equal to the second, then the contents of register \f[I]r\f[R] are executed. -.RS +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). +\f[R] +.fi .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). -.RE -.TP \f[B]=\f[R]\f[I]r\f[R]\f[B]e\f[R]\f[I]s\f[R] -Like the above, but will execute register \f[I]s\f[R] if the comparison -fails. -.RS .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). +: Like the above, but will execute register \f[I]s\f[R] if the +comparison fails. +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]!=\f[R]\f[I]r\f[R] -Pops two values off of the stack that must be numbers and compares them. +.PP +: Pops two values off of the stack that must be numbers and compares +them. If the first value is not equal to the second, then the contents of register \f[I]r\f[R] are executed. -.RS +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). +\f[R] +.fi .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). -.RE -.TP \f[B]!=\f[R]\f[I]r\f[R]\f[B]e\f[R]\f[I]s\f[R] -Like the above, but will execute register \f[I]s\f[R] if the comparison -fails. -.RS .PP -If either or both of the values are not numbers, dc(1) will raise an -error and reset (see the \f[B]RESET\f[R] section). +: Like the above, but will execute register \f[I]s\f[R] if the +comparison fails. +.IP +.nf +\f[C] +If either or both of the values are not numbers, dc(1) will raise an error +and reset (see the **RESET** section). + +This is a **non-portable extension**. +\f[R] +.fi .PP -This is a \f[B]non-portable extension\f[R]. -.RE -.TP \f[B]?\f[R] -Reads a line from the \f[B]stdin\f[R] and executes it. +.PP +: Reads a line from the \f[B]stdin\f[R] and executes it. This is to allow macros to request input from users. -.TP +.PP \f[B]q\f[R] -During execution of a macro, this exits the execution of that macro and -the execution of the macro that executed it. +.PP +: During execution of a macro, this exits the execution of that macro +and the execution of the macro that executed it. If there are no macros, or only one macro executing, dc(1) exits. -.TP +.PP \f[B]Q\f[R] -Pops a value from the stack which must be non-negative and is used the +.PP +: Pops a value from the stack which must be non-negative and is used the number of macro executions to pop off of the execution stack. If the number of levels to pop is greater than the number of executing macros, dc(1) exits. .SS Status .PP These commands query status of the stack or its top value. -.TP -\f[B]Z\f[R] -Pops a value off of the stack. -.RS .PP -If it is a number, calculates the number of significant decimal digits -it has and pushes the result. +\f[B]Z\f[R] .PP +: Pops a value off of the stack. +.IP +.nf +\f[C] +If it is a number, calculates the number of significant decimal digits it +has and pushes the result. + If it is a string, pushes the number of characters the string has. -.RE -.TP +\f[R] +.fi +.PP \f[B]X\f[R] -Pops a value off of the stack. -.RS .PP -If it is a number, pushes the \f[I]scale\f[R] of the value onto the -stack. +: Pops a value off of the stack. +.IP +.nf +\f[C] +If it is a number, pushes the *scale* of the value onto the stack. + +If it is a string, pushes **0**. +\f[R] +.fi .PP -If it is a string, pushes \f[B]0\f[R]. -.RE -.TP \f[B]z\f[R] -Pushes the current stack depth (before execution of this command). +.PP +: Pushes the current stack depth (before execution of this command). .SS Arrays .PP These commands manipulate arrays. -.TP +.PP \f[B]:\f[R]\f[I]r\f[R] -Pops the top two values off of the stack. +.PP +: Pops the top two values off of the stack. The second value will be stored in the array \f[I]r\f[R] (see the \f[B]REGISTERS\f[R] section), indexed by the first value. -.TP +.PP \f[B];\f[R]\f[I]r\f[R] -Pops the value on top of the stack and uses it as an index into the +.PP +: Pops the value on top of the stack and uses it as an index into the array \f[I]r\f[R]. The selected value is then pushed onto the stack. .SH REGISTERS @@ -823,8 +988,8 @@ their stack. .PP In non-extended register mode, a register name is just the single character that follows any command that needs a register name. -The only exception is a newline (\f[B]`\[rs]n'\f[R]); it is a parse -error for a newline to be used as a register name. +The only exception is a newline (\f[B]\[aq]\[rs]n\[aq]\f[R]); it is a +parse error for a newline to be used as a register name. .SS Extended Register Mode .PP Unlike most other dc(1) implentations, this dc(1) provides nearly @@ -835,7 +1000,7 @@ If extended register mode is enabled (\f[B]-x\f[R] or normal single character registers are used \f[I]unless\f[R] the character immediately following a command that needs a register name is a space (according to \f[B]isspace()\f[R]) and not a newline -(\f[B]`\[rs]n'\f[R]). +(\f[B]\[aq]\[rs]n\[aq]\f[R]). .PP In that case, the register name is found according to the regex \f[B][a-z][a-z0-9_]*\f[R] (like bc(1) identifiers), and it is a parse @@ -880,59 +1045,71 @@ always at least twice as large as the integer type used to store digits. .SH LIMITS .PP The following are the limits on dc(1): -.TP +.PP \f[B]DC_LONG_BIT\f[R] -The number of bits in the \f[B]long\f[R] type in the environment where +.PP +: The number of bits in the \f[B]long\f[R] type in the environment where dc(1) was built. This determines how many decimal digits can be stored in a single large integer (see the \f[B]PERFORMANCE\f[R] section). -.TP +.PP \f[B]DC_BASE_DIGS\f[R] -The number of decimal digits per large integer (see the +.PP +: The number of decimal digits per large integer (see the \f[B]PERFORMANCE\f[R] section). Depends on \f[B]DC_LONG_BIT\f[R]. -.TP +.PP \f[B]DC_BASE_POW\f[R] -The max decimal number that each large integer can store (see +.PP +: The max decimal number that each large integer can store (see \f[B]DC_BASE_DIGS\f[R]) plus \f[B]1\f[R]. Depends on \f[B]DC_BASE_DIGS\f[R]. -.TP +.PP \f[B]DC_OVERFLOW_MAX\f[R] -The max number that the overflow type (see the \f[B]PERFORMANCE\f[R] +.PP +: The max number that the overflow type (see the \f[B]PERFORMANCE\f[R] section) can hold. Depends on \f[B]DC_LONG_BIT\f[R]. -.TP +.PP \f[B]DC_BASE_MAX\f[R] -The maximum output base. +.PP +: The maximum output base. Set at \f[B]DC_BASE_POW\f[R]. -.TP +.PP \f[B]DC_DIM_MAX\f[R] -The maximum size of arrays. +.PP +: The maximum size of arrays. Set at \f[B]SIZE_MAX-1\f[R]. -.TP +.PP \f[B]DC_SCALE_MAX\f[R] -The maximum \f[B]scale\f[R]. +.PP +: The maximum \f[B]scale\f[R]. Set at \f[B]DC_OVERFLOW_MAX-1\f[R]. -.TP +.PP \f[B]DC_STRING_MAX\f[R] -The maximum length of strings. +.PP +: The maximum length of strings. Set at \f[B]DC_OVERFLOW_MAX-1\f[R]. -.TP +.PP \f[B]DC_NAME_MAX\f[R] -The maximum length of identifiers. +.PP +: The maximum length of identifiers. Set at \f[B]DC_OVERFLOW_MAX-1\f[R]. -.TP +.PP \f[B]DC_NUM_MAX\f[R] -The maximum length of a number (in decimal digits), which includes +.PP +: The maximum length of a number (in decimal digits), which includes digits after the decimal point. Set at \f[B]DC_OVERFLOW_MAX-1\f[R]. -.TP +.PP Exponent -The maximum allowable exponent (positive or negative). +.PP +: The maximum allowable exponent (positive or negative). Set at \f[B]DC_OVERFLOW_MAX\f[R]. -.TP +.PP Number of vars -The maximum number of vars/arrays. +.PP +: The maximum number of vars/arrays. Set at \f[B]SIZE_MAX-1\f[R]. .PP These limits are meant to be effectively non-existent; the limits are so @@ -942,101 +1119,115 @@ In fact, memory should be exhausted before these limits should be hit. .SH ENVIRONMENT VARIABLES .PP dc(1) recognizes the following environment variables: -.TP +.PP \f[B]DC_ENV_ARGS\f[R] -This is another way to give command-line arguments to dc(1). +.PP +: This is another way to give command-line arguments to dc(1). They should be in the same format as all other command-line arguments. These are always processed first, so any files given in \f[B]DC_ENV_ARGS\f[R] will be processed before arguments and files given on the command-line. -This gives the user the ability to set up \[lq]standard\[rq] options and +This gives the user the ability to set up \[dq]standard\[dq] options and files to be used at every invocation. The most useful thing for such files to contain would be useful functions that the user might want every time dc(1) runs. Another use would be to use the \f[B]-e\f[R] option to set \f[B]scale\f[R] to a value other than \f[B]0\f[R]. -.RS +.IP +.nf +\f[C] +The code that parses **DC_ENV_ARGS** will correctly handle quoted arguments, +but it does not understand escape sequences. For example, the string +**\[dq]/home/gavin/some dc file.dc\[dq]** will be correctly parsed, but the string +**\[dq]/home/gavin/some \[rs]\[dq]dc\[rs]\[dq] file.dc\[dq]** will include the backslashes. + +The quote parsing will handle either kind of quotes, **\[aq]** or **\[dq]**. Thus, +if you have a file with any number of single quotes in the name, you can use +double quotes as the outside quotes, as in **\[dq]some \[aq]dc\[aq] file.dc\[dq]**, and vice +versa if you have a file with double quotes. However, handling a file with +both kinds of quotes in **DC_ENV_ARGS** is not supported due to the +complexity of the parsing, though such files are still supported on the +command-line where the parsing is done by the shell. +\f[R] +.fi .PP -The code that parses \f[B]DC_ENV_ARGS\f[R] will correctly handle quoted -arguments, but it does not understand escape sequences. -For example, the string \f[B]\[lq]/home/gavin/some dc file.dc\[rq]\f[R] -will be correctly parsed, but the string \f[B]\[lq]/home/gavin/some -\[dq]dc\[dq] file.dc\[rq]\f[R] will include the backslashes. -.PP -The quote parsing will handle either kind of quotes, \f[B]\[cq]\f[R] or -\f[B]\[lq]\f[R]. Thus, if you have a file with any number of single -quotes in the name, you can use double quotes as the outside quotes, as -in \f[B]\[rq]some `dc' file.dc\[dq]\f[R], and vice versa if you have a -file with double quotes. -However, handling a file with both kinds of quotes in -\f[B]DC_ENV_ARGS\f[R] is not supported due to the complexity of the -parsing, though such files are still supported on the command-line where -the parsing is done by the shell. -.RE -.TP \f[B]DC_LINE_LENGTH\f[R] -If this environment variable exists and contains an integer that is +.PP +: If this environment variable exists and contains an integer that is greater than \f[B]1\f[R] and is less than \f[B]UINT16_MAX\f[R] (\f[B]2\[ha]16-1\f[R]), dc(1) will output lines to that length, including the backslash newline combo. The default line length is \f[B]70\f[R]. -.TP +.PP \f[B]DC_EXPR_EXIT\f[R] -If this variable exists (no matter the contents), dc(1) will exit +.PP +: If this variable exists (no matter the contents), dc(1) will exit immediately after executing expressions and files given by the \f[B]-e\f[R] and/or \f[B]-f\f[R] command-line options (and any equivalents). .SH EXIT STATUS .PP dc(1) returns the following exit statuses: -.TP +.PP \f[B]0\f[R] -No error. -.TP +.PP +: No error. +.PP \f[B]1\f[R] -A math error occurred. +.PP +: A math error occurred. This follows standard practice of using \f[B]1\f[R] for expected errors, since math errors will happen in the process of normal execution. -.RS -.PP -Math errors include divide by \f[B]0\f[R], taking the square root of a -negative number, attempting to convert a negative number to a hardware -integer, overflow when converting a number to a hardware integer, and -attempting to use a non-integer where an integer is required. +.IP +.nf +\f[C] +Math errors include divide by **0**, taking the square root of a negative +number, attempting to convert a negative number to a hardware integer, +overflow when converting a number to a hardware integer, and attempting to +use a non-integer where an integer is required. + +Converting to a hardware integer happens for the second operand of the power +(**\[rs]\[ha]**) operator. +\f[R] +.fi .PP -Converting to a hardware integer happens for the second operand of the -power (\f[B]\[ha]\f[R]) operator. -.RE -.TP \f[B]2\f[R] -A parse error occurred. -.RS .PP -Parse errors include unexpected \f[B]EOF\f[R], using an invalid -character, failing to find the end of a string or comment, and using a -token where it is invalid. -.RE -.TP +: A parse error occurred. +.IP +.nf +\f[C] +Parse errors include unexpected **EOF**, using an invalid character, failing +to find the end of a string or comment, and using a token where it is +invalid. +\f[R] +.fi +.PP \f[B]3\f[R] -A runtime error occurred. -.RS .PP -Runtime errors include assigning an invalid number to \f[B]ibase\f[R], -\f[B]obase\f[R], or \f[B]scale\f[R]; give a bad expression to a -\f[B]read()\f[R] call, calling \f[B]read()\f[R] inside of a -\f[B]read()\f[R] call, type errors, and attempting an operation when the -stack has too few elements. -.RE -.TP +: A runtime error occurred. +.IP +.nf +\f[C] +Runtime errors include assigning an invalid number to **ibase**, **obase**, +or **scale**; give a bad expression to a **read()** call, calling **read()** +inside of a **read()** call, type errors, and attempting an operation when +the stack has too few elements. +\f[R] +.fi +.PP \f[B]4\f[R] -A fatal error occurred. -.RS .PP -Fatal errors include memory allocation errors, I/O errors, failing to -open files, attempting to use files that do not have only ASCII -characters (dc(1) only accepts ASCII characters), attempting to open a -directory as a file, and giving invalid command-line options. -.RE +: A fatal error occurred. +.IP +.nf +\f[C] +Fatal errors include memory allocation errors, I/O errors, failing to open +files, attempting to use files that do not have only ASCII characters (dc(1) +only accepts ASCII characters), attempting to open a directory as a file, +and giving invalid command-line options. +\f[R] +.fi .PP The exit status \f[B]4\f[R] is special; when a fatal error occurs, dc(1) always exits and returns \f[B]4\f[R], no matter what mode dc(1) is in. @@ -1064,7 +1255,7 @@ In interactive mode, dc(1) attempts to recover from errors (see the .SH TTY MODE .PP If \f[B]stdin\f[R], \f[B]stdout\f[R], and \f[B]stderr\f[R] are all -connected to a TTY, dc(1) turns on \[lq]TTY mode.\[rq] +connected to a TTY, dc(1) turns on \[dq]TTY mode.\[dq] .PP TTY mode is required for history to be enabled (see the \f[B]COMMAND LINE HISTORY\f[R] section). @@ -1084,7 +1275,7 @@ If dc(1) is in TTY mode (see the \f[B]TTY MODE\f[R] section), it will reset (see the \f[B]RESET\f[R] section). Otherwise, it will clean up and exit. .PP -Note that \[lq]current input\[rq] can mean one of two things. +Note that \[dq]current input\[dq] can mean one of two things. If dc(1) is processing input from \f[B]stdin\f[R] in TTY mode, it will ask for more input. If dc(1) is processing input from a file in TTY mode, it will stop |