How to resolve the algorithm Non-decimal radices/Input step by step in the Erlang programming language
How to resolve the algorithm Non-decimal radices/Input step by step in the Erlang programming language
Table of Contents
Problem Statement
It is common to have a string containing a number written in some format, with the most common ones being decimal, hexadecimal, octal and binary. Such strings are found in many places (user interfaces, configuration files, XML data, network protocols, etc.) This task requires parsing of such a string (which may be assumed to contain nothing else) using the language's built-in facilities if possible. Parsing of decimal strings is required, parsing of other formats is optional but should be shown (i.e., if the language can parse in base-19 then that should be illustrated). The solutions may assume that the base of the number in the string is known. In particular, if your language has a facility to guess the base of a number by looking at a prefix (e.g. "0x" for hexadecimal) or other distinguishing syntax as it parses it, please show that. The reverse operation is in task Non-decimal radices/Output For general number base conversion, see Non-decimal radices/Convert.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Non-decimal radices/Input step by step in the Erlang programming language
Source code in the erlang programming language
You may also check:How to resolve the algorithm Check that file exists step by step in the C++ programming language
You may also check:How to resolve the algorithm First perfect square in base n with n unique digits step by step in the C programming language
You may also check:How to resolve the algorithm Entropy/Narcissist step by step in the Julia programming language
You may also check:How to resolve the algorithm Parsing/Shunting-yard algorithm step by step in the J programming language
You may also check:How to resolve the algorithm Compound data type step by step in the SIMPOL programming language