Characters Escape & Unescape

Escape Level
Escape Quote
JSON Compatible
ES6 Compatible
Uppercase Hex

Escapes Special Characters in a string so that they do not cause conflicts. For example, Don't stop me now becomes Don\'t stop me now.

Supports the following escape sequences:

  • \n (Line feed/newline)

  • \r (Carriage return)

  • \t (Horizontal tab)

  • \b (Backspace)

  • \f (Form feed)

  • \xnn (Hex, where n is 0-f)

  • \\ (Backslash)

  • \' (Single quote)

  • \" (Double quote)

  • \unnnn (Unicode character)

  • \u{nnnnnn} (Unicode code point)


Unescapes Characters in a string that have been escaped. For example, Don\'t stop me now becomes Don't stop me now.

Supports the following escape sequences:

  • \n (Line feed/newline)

  • \r (Carriage return)

  • \t (Horizontal tab)

  • \b (Backspace)

  • \f (Form feed)

  • \nnn (Octal, where n is 0-7)

  • \xnn (Hex, where n is 0-f)

  • \\ (Backslash)

  • \' (Single quote)

  • \" (Double quote)

  • \unnnn (Unicode character)

  • \u{nnnnnn} (Unicode code point)

 

References

https://wikipedia.org/wiki/Escape_sequence

Featured Tools

Featured tools that you might find useful.

Popular Tools

List of popular tools that users love and frequently use.

New Tools

The latest tools added to our collection, designed for you.

Topics

The tools grouped by topics to quickly find what you need.
Hill Cipher is a polygraphic substitution cipher based on linear algebra. Invented by Lester S. Hill in 1929, it was the first polygraphic cipher in which it was practical (though barely) to operate on more than three symbols at once. It used matrices and matrix multiplication to mix up the plaintext.

Hill Cipher

Hill Cipher is a polygraphic substitution cipher based on linear algebra. Invented by Lester S. Hill in 1929, it was the first polygraphic cipher in which it was practical (though barely) to operate on more than three symbols at once. It used matrices and matrix multiplication to mix up the plaintext.
Homophonic Substitution Cipher is a substitution cipher in which single plaintext letters can be replaced by any of several different ciphertext letters. They are generally much more difficult to break than standard substitution ciphers.

Homophonic Substitution Cipher

Homophonic Substitution Cipher is a substitution cipher in which single plaintext letters can be replaced by any of several different ciphertext letters. They are generally much more difficult to break than standard substitution ciphers.
Playfair Cipher is a manual symmetric encryption technique and was the first literal digram substitution cipher. It encrypts pairs of letters (bigrams or digrams), instead of single letters as in the simple substitution cipher and rather more complex Vigenère cipher systems then in use.

Playfair Cipher

Playfair Cipher is a manual symmetric encryption technique and was the first literal digram substitution cipher. It encrypts pairs of letters (bigrams or digrams), instead of single letters as in the simple substitution cipher and rather more complex Vigenère cipher systems then in use.
Polybius Square Cipher is essentially identical to the simple substitution cipher, except that each plaintext character is enciphered as 2 ciphertext characters. It can ususally be detected if there are only 5 or 6 different characters in the ciphertext.

Polybius Square Cipher

Polybius Square Cipher is essentially identical to the simple substitution cipher, except that each plaintext character is enciphered as 2 ciphertext characters. It can ususally be detected if there are only 5 or 6 different characters in the ciphertext.