|
|
| Line 1: |
Line 1: |
| {{lowercase|title=dc (Unix)}}
| | Eusebio Stanfill is what's written on my birth qualification although it is certainly not the name on private birth certificate. Idaho is our birth install. I work as an arrangement clerk. As a man what I really like is conducting but I'm thinking through to starting something new. You can also find my website here: http://circuspartypanama.com<br><br>Feel free to surf to my page [http://circuspartypanama.com clash of clans hack download] |
| '''dc''' is a [[cross-platform]] [[reverse Polish notation|reverse-polish]] '''d'''esk '''c'''alculator which supports [[arbitrary-precision arithmetic]].<ref>{{man|1|dc||an arbitrary precision calculator}}</ref> It is one of the oldest [[Unix]] utilities, predating even the invention of the [[C (programming language)|C programming language]]; like other utilities of that vintage, it has a powerful set of features but an extremely terse syntax.<ref>{{cite web
| |
| |url=http://plan9.bell-labs.com/7thEdMan/vol2/dc
| |
| |title=The sources for the manual page for 7th Edition Unix dc
| |
| }}</ref><ref>{{cite web
| |
| |author=Ritchie, Dennis M.
| |
| |date=Sep 1979
| |
| |url=http://cm.bell-labs.com/cm/cs/who/dmr/hist.html
| |
| |title=The Evolution of the Unix Timesharing System
| |
| }}</ref>
| |
| Traditionally, the more user-friendly (with its [[infix notation]]) [[bc programming language|bc]] calculator program was implemented on top of dc, although more modern implementations are related in the opposite fashion: dc uses bc's library for arithmetic.<ref>{{cite web
| |
| |url= http://directory.fsf.org/project/bc/
| |
| |title=Free Software Directory: BC
| |
| |accessdate=5 Jan 2009
| |
| }}</ref>
| |
| | |
| This article provides some examples in an attempt to give a general flavour of the language; for a complete list of commands and syntax, one should consult the [[man page]] for one's specific implementation.
| |
| | |
| ==Basic operations==
| |
| To multiply four and five in dc (note that most of the whitespace is optional):
| |
| | |
| 4 5 *
| |
| p
| |
| | |
| ''' Notes: Saved in a file, such as cal.txt, the command: dc cal.txt, calculates the result. Run "q" to exit from dc.
| |
| | |
| You can also get the result with the commands:
| |
| | |
| echo "4 5 * p" |dc
| |
| or
| |
| | |
| dc -
| |
| 4 5*pq
| |
| | |
| This translates into "push four and five onto the stack, then, with the multiplication operator, pop two elements from the stack, multiply them and push the result back on the stack." Then the 'p' command is used to examine (print out to the screen) the top element on the stack. The 'q' command quits the invoked instance of dc. Note that numbers must be spaced from each other even as some operators need not be.
| |
| | |
| The [[arithmetic precision]] is changed with the command 'k', which sets the number of fractional digits (the number of digits following the [[radix point|point]]) to be used for arithmetic operations. Since the default precision is zero, this sequence of commands produces '0' as a result:
| |
|
| |
| 2 3 / p
| |
| | |
| By adjusting the precision with 'k', arbitrary number of decimal places can be produced. This command sequence outputs '.66666'.
| |
| | |
| 5 k
| |
| 2 3 / p
| |
| | |
| To evaluate <math>\sqrt{(12 + (-3)^4)\over11}-22</math>: ('v' computes the square root of the top of the stack and '_' is used to input a negative number):
| |
| | |
| 12 _3 4 ^ + 11 / v 22 -
| |
| p
| |
| | |
| To swap the top two elements of the stack, use the 'r' command. To duplicate the top element, use the 'd' command.
| |
| | |
| ==Input/Output==
| |
| To read a line from [[stdin]], use the '?' command. This will evaluate the line as if it were a ''dc'' command, and so it is necessary that it be syntactically correct and potentially be a security problem since the '!' ''dc'' command will allow arbitrary command execution.
| |
| | |
| As mentioned above, 'p' will print the top of the stack with a newline after it. 'n' will pop the top of the stack and output it without a trailing newline. 'f' will dump the entire stack with one entry per line. | |
| | |
| ''dc'' also supports arbitrary input and output [[radix|radices]]. The 'i' command will pop the top of the stack and use it for the input base. Hex digits must be in upper case to avoid collisions with ''dc'' commands and are not limited to A-F if the input radix is larger than 16. The 'o' command does the same for the output base, but keep in mind that the input base will affect the parsing of every numeric value afterwards so it is usually advisable to set the output base first. To read the values, the 'K', 'I' and 'O' commands will push the current precision, input radix and output radix on to the top of the stack.
| |
| | |
| As an example, to convert from hex to binary:
| |
| | |
| 16i2o DEADBEEFp
| |
| | |
| outputs <tt>11011110101011011011111011101111</tt>.
| |
| | |
| ==Language Features==
| |
| | |
| ===Registers===
| |
| In addition to these basic arithmetic and stack operations, dc includes support for [[Macro (computer science)|macros]], conditionals and storing of results for later retrieval.
| |
| | |
| The mechanism underlying macros and conditionals is the '''register''', which in dc is a storage location with a single character name which can be stored to and retrieved from: 'sc' pops the top of the stack and stores it in register c, and 'lc' pushes the value of register c onto the stack. For example:
| |
| | |
| 3 sc 4 lc * p
| |
| | |
| Registers can also be treated as secondary stacks, so values can be pushed and popped between them and the main stack using the 'S' and 'L' commands.
| |
| | |
| ===Strings===
| |
| String values are enclosed in '[' and ']' characters and may be pushed on the stack and stored in registers. The 'a' command will convert the low order byte of the numeric value into an [[ASCII#ASCII printable characters|ASCII]] character, or if the top of the stack is a string it will replace it with the first character of the string. There are no ways to build up strings or perform string manipulation other than executing it with the 'x' command, or printing it with the 'P' command.
| |
| | |
| The '#' character begins a comment to the end of the line.
| |
| | |
| ===Macros===
| |
| Macros are then implemented by allowing registers and stack entries to be strings as well as numbers. A string can be printed, but it can also be executed (i.e. processed as a sequence of dc commands). So for instance we can store a macro to add one and then multiply by 2 into register m:
| |
| | |
| [1 + 2 *] sm
| |
| | |
| and then (using the 'x' command which executes the top of the stack) we can use it like this:
| |
| | |
| 3 lm x p
| |
| | |
| ===Conditionals===
| |
| Finally, we can use this macro mechanism to provide conditionals. The command '=r' will pop two values from the stack, and execute the macro stored in register 'r' only if they are equal. So this will print the string 'equal' only if the top of the stack is equal to 5:
| |
| <pre>
| |
| [[equal]p] sm 5 =m
| |
| </pre>
| |
| | |
| Other conditionals are '>', '!>', '<', '!<', '!=', which will execute the specified macro if the top two values on the stack are greater, less than or equal to ("not greater"), less than, greater than or equal to ("not less than"), and not equals, respectively.
| |
| | |
| ===Loops===
| |
| Looping is then possible by defining a macro which (conditionally) reinvokes itself. A simple factorial of the top of the stack might be implemented as:
| |
| | |
| # F(x): return x!
| |
| # if x-1 > 1
| |
| # return x * F(x-1)
| |
| # otherwise
| |
| # return x
| |
| [d1-d1<F*]dsFxp
| |
| | |
| The '1Q' command will exit from a macro, allowing an early return. 'q' will quit from two levels of macros (and ''dc'' itself if there are less than two levels on the call stack). 'z' will push the current stack depth before the 'z' operation.
| |
| | |
| ==Examples==
| |
| | |
| Print prime numbers :
| |
| <source lang="bash">
| |
| echo '2p3p[dl!d2+s!%0=@l!l^!<#]s#[s/0ds^]s@[p]s&[ddvs^3s!l#x0<&2+l.x]ds.x'|dc
| |
| </source>
| |
| As an example of a relatively simple program in dc, this command (in 1 line):
| |
| <source lang="bash">
| |
| dc -e '[[Enter a number (metres), or 0 to exit]psj]sh[q]sz[lhx?d0=z10k39.370079*.5+0k12~1/rn[ feet ]
| |
| Pn[ inches]P10Pdx]dx'
| |
| </source>
| |
| | |
| will convert distances from metres to feet and inches; the bulk of it is concerned with prompting for input, printing output in a suitable format and looping round to convert another number.
| |
| | |
| As an example, here is an implementation of the [[Euclidean algorithm]] to find the [[Greatest common divisor|GCD]]:
| |
| <source lang="bash">
| |
| dc -e '??[dSarLa%d0<a]dsax+p' # shortest
| |
| dc -e '[a=]P?[b=]P?[dSarLa%d0<a]dsax+[GCD:]Pp' # easier-to-read version
| |
| </source>
| |
| Computing the [[factorial]] of an input value, <math>n! = \prod_{i=1}^n i</math>
| |
| <source lang="bash">
| |
| dc -e '?[q]sQ[d1=Qd1-lFx*]dsFxp'
| |
| </source>
| |
| | |
| A more complex example performs [[Diffie-Hellman key exchange]]. This was popular as a [[signature block]] among [[cypherpunk]]s during the [[ITAR]] debates:<ref>{{cite web
| |
| |url=http://www.cypherspace.org/adam/rsa/perl-dh.html
| |
| |title=Diffie-Hellman in 2 lines of Perl
| |
| |accessdate=5 Jan 2009
| |
| |author=Adam Back
| |
| }}</ref>
| |
| <source lang="perl">
| |
| #!/usr/bin/perl -- -export-a-crypto-system-sig Diffie-Hellman-2-lines
| |
| ($g,$e,$m)=@ARGV,$m||die"$0 gen exp mod\n";print`echo "16dio1[d2%Sa2/d0<X+d
| |
| *La1=z\U$m%0]SX$e"[$g*]\EszlXx+p|dc`
| |
| </source>
| |
| | |
| A commented version is slightly easier to understand and shows how to use loops, conditionals, and the 'q' command to return from a macro. With a modern version of dc, the '|' command can be used to do arbitrary precision modular exponentiation without needing to write the X function.
| |
| <source lang="perl">
| |
| #!/usr/bin/perl
| |
| | |
| my ($g,$e,$m) = map { "\U$_" } @ARGV; | |
| die "$0 gen exp mod\n" unless $m;
| |
| | |
| print `echo $g $e $m | dc -e '
| |
| # Hex input and output
| |
| 16dio
| |
| # Read m, e and g from stdin on one line
| |
| ?SmSeSg
| |
| | |
| # Function z: return g * top of stack
| |
| [lg*]sz
| |
| | |
| # Function Q: remove the top of the stack and return 1
| |
| [sb1q]sQ
| |
| | |
| # Function X(e): recursively compute g^e % m
| |
| # It is the same as Sm^Lm%, but handles arbitrarily large exponents.
| |
| # Stack at entry: e
| |
| # Stack at exit: g^e % m
| |
| # Since e may be very large, this uses the property that g^e % m ==
| |
| # if( e == 0 )
| |
| # return 1
| |
| # x = (g^(e/2)) ^ 2
| |
| # if( e % 2 == 1 )
| |
| # x *= g
| |
| # return x %
| |
| [
| |
| d 0=Q # return 1 if e==0 (otherwise, stack: e)
| |
| d 2% Sa # Store e%2 in a (stack: e)
| |
| 2/ # compute e/2
| |
| lXx # call X(e/2)
| |
| d* # compute X(e/2)^2
| |
| La1=z # multiply by g if e%2==1
| |
| lm % # compute (g^e) % m
| |
| ] SX
| |
| | |
| le # Load e from the register
| |
| lXx # compute g^e % m
| |
| p # Print the result
| |
| '`;
| |
| </source>
| |
| | |
| == See also ==
| |
| * [[bc programming language]]
| |
| * [[Calculator input methods]]
| |
| * [[HP calculators]]
| |
| * [[Orpie]], an RPN calculator
| |
| * [[Stack machine]]
| |
| | |
| ==References==
| |
| {{reflist}}
| |
| | |
| ==External links==
| |
| *Package [http://packages.debian.org/search?keywords=dc&searchon=names&exact=1&suite=all§ion=all dc] in [[Debian GNU/Linux]] repositories
| |
| *[http://gnuwin32.sourceforge.net/packages/bc.htm Native Windows port] of ''[[bc programming language|bc]]'', which includes ''dc''.
| |
| | |
| {{unix commands}}
| |
| | |
| [[Category:Cross-platform software]]
| |
| [[Category:Unix software]]
| |
| [[Category:Free mathematics software]]
| |
| [[Category:Numerical programming languages]]
| |
| [[Category:Stack-oriented programming languages]]
| |