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
108
109
|
\documentclass[fleqn,debug]{microstructure}
\author{DistressNetwork°}
\begin{document}
\resetv{-3\unit}\section{Header Level One}
\subsection{Header Level Two}
\subsubsection{Header Level Three}
\hr
Paragraph \bold{(Bold)} \italic{(Italic)} \sout{(Strikethrough)} \mono{(Monospace)} \inmath{\mathrm{(Inline\ Math)}}
\link{https://en.wikipedia.org/wiki/Hyperlink}{Link} \hspace{\unit}
Footnote/Citation Reference\footnote{Footnote/Citation Content (With \link{https://en.wikipedia.org/wiki/Hyperlink}{Link} To Resource)}
\begin{itemize}
\item Unordered List Level One
\begin{itemize}
\item Unordered List Level Two
\begin{itemize}
\item Unordered List Level Three
\end{itemize}
\end{itemize}
\end{itemize}
\begin{enumerate}
\item Ordered List Level One
\begin{enumerate}
\item Ordered List Level Two
\begin{enumerate}
\item Ordered List Level Three
\end{enumerate}
\end{enumerate}
\end{enumerate}
\begin{description}
\item[Description] Level One
\begin{description}
\item[Description] Level Two
\begin{description}
\item[Description] Level Three
\end{description}
\end{description}
\end{description}
%\begin{quote}
% Block Quote
%\end{quote}
\begin{codeblock}
int main() {
printf("Code Block\n");
printf("Line inside the same code block which is much longer than the line preceding it");
exit(0);
}
\end{codeblock}
\begin{math}
f(s) = \int_{0}^{\infty}\left[\mathrm{Math\ Block}\right]\, e^{-st}\, dt
\end{math}
\newpage
\resetv{-3\unit}\section{Paragraph Test}
In mathematics, computer science, and linguistics, a \bold{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 \italic{well-formed words} or \italic{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 \bold{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.
\section{Table Test}
\begin{table}{x x x}
\bold{Header 1} & \bold{Header 2} & \bold{Header 3} \\
\cline{1-3}
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. & \italic{(Nabokov, 1962)}
\end{table}
\reset\section{Tab Alignment Test}
\begin{tabbing}
\aligntwo
One \> Two
\end{tabbing}
\begin{tabbing}
\alignthree
One \> Two \> Three
\end{tabbing}
\begin{tabbing}
\alignfour
One \> Two \> Three \> Four
\end{tabbing}
\newpage
\resetv{-3\unit}\section{Image Test}
\begin{figure}
\reset\includegraphics[height=3.5in]{image.png}
\caption{Image Caption}
\end{figure}
\end{document}
|
