# Integer literal

In computer science, an integer literal is a type of literal for an integer whose value is directly represented in source code. For example, in the assignment statement `x = 1`, the string `1` is an integer literal indicating the value 1, while in the statement `x = 0x10` the string `0x10` is an integer literal indicating the value 16, which is represented by `10` in hexadecimal (indicated by the `0x` prefix).

By contrast, in `x = cos(0)`, the expression `cos(0)` evaluates to 1 (as the cosine of 0), but the value 1 is not literally included in the source code. More simply, in `x = 2 + 2,` the expression `2 + 2` evaluates to 4, but the value 4 is not literally included. Further, in `x = "1"` the `"1"` is a string literal, not an integer literal, because it is in quotes. The value of the string is `1`, which happens to be an integer string, but this is semantic analysis of the string literal – at the syntactic level `"1"` is simply a string, no different from `"foo"`.

## Parsing

Recognizing a string (sequence of characters in the source code) as an integer literal is part of the lexical analysis (lexing) phase, while evaluating the literal to its value is part of the semantic analysis phase. Within the lexer and phrase grammar, the token class is often denoted `integer`, with the lowercase indicating a lexical-level token class, as opposed to phrase-level production rule (such as `ListOfIntegers`). Once a string has been lexed (tokenized) as an integer literal, its value cannot be determined syntactically (it is just an integer), and evaluation of its value becomes a semantic question.

Integer literals are generally lexed with regular expressions, as in Python.[1]

## Evaluation

As with other literals, integer literals are generally evaluated at compile time, as part of the semantic analysis phase. In some cases this semantic analysis is done in the lexer, immediately on recognition of an integer literal, while in other cases this is deferred until the parsing stage, or until after the parse tree has been completely constructed. For example, on recognizing the string `0x10` the lexer could immediately evaluate this to 16 and store that (a token of type `integer` and value 16), or defer evaluation and instead record a token of type `integer` and value `0x10`.

Once literals have been evaluated, further semantic analysis in the form of constant folding is possible, meaning that literal expressions involving literal values can be evaluated at the compile phase. For example, in the statement `x = 2 + 2` after the literals have been evaluated and the expression `2 + 2` has been parsed, it can then be evaluated to 4, though the value 4 does not itself appear as a literal.

## Affixes

Integer literals frequently have prefixes indicating base, and less frequently suffixes indicating type.[1] For example, `0x10ULL` indicates the value 16 (because hexadecimal) as an unsigned long long integer in C++.

Common prefixes include:

• `0x` or `0X` for hexadecimal (base 16);
• `0`, `0o` or `0O` for octal (base 8);
• `0b` or `0B` for binary (base 2).

Common suffixes include:

• `l` or `L` for long integer;
• `ll` or `LL` for long long integer;
• `u` or `U` for unsigned integer.

These affixes are somewhat similar to sigils, though sigils attach to identifiers (names), not literals.

## Digit separators

In some languages, integer literals may contain digit separators to allow digit grouping into more legible forms. If this is available, it can usually be done for floating point literals as well. This is particularly useful for bit fields, and makes it easier to see the size of large numbers (such as a million) at a glance by subitizing rather than counting digits. It is also useful for numbers that are typically grouped, such as credit card number or social security numbers.[lower-alpha 1] Very long numbers can be further grouped by doubling up separators.

Typically decimal numbers (base-10) are grouped in three digit groups (representing one of 1000 possible values), binary numbers (base-2) in four digit groups (one nibble, representing one of 16 possible values), and hexadecimal numbers (base-16) in two digit groups (each digit is one nibble, so two digits are one byte, representing one of 256 possible values). Numbers from other systems (such as id numbers) are grouped following whatever convention is in use.

### Examples

In Ada,[2][3] D, Java (from version 7),[4] Julia, Perl, Ruby, Eiffel, and C# (from version 7.0), integer literals and float literals can be separated with an underscore (`_`). There, can be, some restrictions on placement; for example, in Java they cannot appear at the start or end of the literal, nor next to a decimal point. Note that while the period, comma, and (thin) spaces are used in normal writing for digit separation, these conflict with their existing use in programming languages as radix point, list separator (and in C/C++, the comma operator), and token separator.

Examples include:

```int oneMillion = 1_000_000;
int creditCardNumber = 1234_5678_9012_3456;
int socialSecurityNumber = 123_45_6789;
```

In C++14 (2014), the apostrophe character may be used to separate digits arbitrarily in numeric literals.[5] The underscore was initially proposed, with an initial proposal in 1993,[6] and again for C++11,[7] following other languages. However, this caused conflict with user-defined literals, so the apostrophe was proposed instead, as an "upper comma" (which is used in some other contexts).[8][9]

```auto integer_literal = 1'000'000;
auto binary_literal = 0b0100'1100'0110;
auto very_long_binary_literal =
0b0000'0001'0010'0011''0100'0101'0110'0111;
```

## Notes

1. Typically sensitive numbers such as these would not be included as literals, however.

## References

1. "Underscores in Numeric Literals". Retrieved 2015-08-12.
2. Crowl, Lawrence; Smith, Richard; Snyder, Jeff; Vandevoorde, Daveed (25 September 2013). "N3781 Single-Quotation-Mark as a Digit Separator" (PDF).
3. John Max Skaller (March 26, 1993). "N0259: A Proposal to allow Binary Literals, and some other small changes to Chapter 2: Lexical Conventions." (PDF).
4. Lawrence Crowl (2007-05-02). "N2281: Digit Separators".
5. Daveed Vandevoorde (2012-09-21). "N3448: Painless Digit Separation" (PDF).
6. Lawrence Crowl (2012-12-19). "N3499: Digit Separators".