1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
title: Style Template
bomber: BOMBER TEXT
leading: Title and/or Leading Phrase
opts: cm
# Header Level One
## Header Level Two
Paragraph **(Bold)** *(Italic)* ~~Strikethrough~~ `(Monospace)`
[Link]()
Footnote/Citation Reference[^fn]
[^fn]: Footnote/Citation Content (With [Link]() To Resource)
- List Level One
- List Level Two
- List Level Three
> 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");
exit(0);
}
```
![f(s) = \int_{0}^{\infty}\left[\mathrm{\LaTeX\ Math}\right]\, e^{-st}\, dt](%tex)
(and some  as well)
# “Ü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.
# 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. | *(Nabokov, 1962)*
# Image Test
# Citation & Caption Formatting
- [Chicago-like](https://www.scribbr.com/chicago-style/citation-examples/)
```
citation
= author-field ' ' title-field (' ' date-field)? (' ' medium-field)? (' ' note '.')*
author-field
= (author | author-pair | author-list) '.'
author-pair
= author ' & ' author
author-list
= author (', ' author)+
title-field
= '“' title '.”'
date-field
= year ('-' month '-' day)? '.'
year
= [0-9]{4}
month
= [0-1][0-9]
day
= [0-3][0-9]
medium-field
= medium (', ' details)? '.'
```
Values of `author`, `title`, `medium`, `details`, and `note` are specific to the works they describe.
|
