In conventional computer language parsing, languages are traditionallyexpressed in formal grammars and parsed with LR(k) or LL(k)algorithms. However, the size, complexity and ambiguities of naturallanguage processing make these tools unsuitable for natural languageprocessing (NLP).
In this thesis we explore how suitable these tools are for expressingand parsing Esperanto. We present a morphology parser for Esperanto,as well as a syntax parser. We discuss ways of improving this parsertechnique. We present a formal grammar for Esperanto. Furthermore, wesuggest an extension to EBNF which will make it more suitable fornatural language processing.