Title & Explanatory Phrase

Header Level One

Header Level Two

Paragraph (Bold) (Italic) Strikethrough (Monospace)


Block Quote
Level One

Block Quote
Level Two

Block Quote
Level Three

int main() {
    printf("Code Block\n");
    printf("Line inside the same code block which is much longer than the line preceding it");

(and perhaps Inline math as well, which will inevitably lead to some strange undefined behaviour)

“Ünicøde” Test

(this seems to break the table of contents sometimes)

Paragraph Test

In mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules. The alphabet of a formal language consist of symbols, letters, or tokens that concatenate into strings of the language. Each string concatenated from symbols of this alphabet is called a word, and the words that belong to a particular formal language are sometimes called well-formed words or well-formed formulas. A formal language is often defined by means of a formal grammar such as a regular grammar or context-free grammar, which consists of its formation rules.

The field of formal language theory studies primarily the purely syntactical aspects of such languages—that is, their internal structural patterns. Formal language theory sprang out of linguistics, as a way of understanding the syntactic regularities of natural languages. In computer science, formal languages are used among others as the basis for defining the grammar of programming languages and formalized versions of subsets of natural languages in which the words of the language represent concepts that are associated with particular meanings or semantics.

In computational complexity theory, decision problems are typically defined as formal languages, and complexity classes are defined as the sets of the formal languages that can be parsed by machines with limited computational power. In logic and the foundations of mathematics, formal languages are used to represent the syntax of axiomatic systems, and mathematical formalism is the philosophy that all of mathematics can be reduced to the syntactic manipulation of formal languages in this way.

Table Test

Left Header Center Header Right Header
Left Cell Center Cell Right Cell
Long Cell Test
And blood-black nothingness began to spin, A system of cells interlinked within Cells interlinked
within cells interlinked Within one stem; And dreadfully distinct against the dark, a tall white fountain played.

Image Test

Image Caption

Image Caption

Image Caption

Citation & Caption Formatting

[Author[[, Author[, ...]] & Author]. ]“Title.”[ YYYY[-MM-DD].][ Medium[, details].][ Notes.]