![]() Regular Languages and Lexical AnalysisĪ regular language is one for which a finite state machine can serve as a parser. We will be concerned with two classes of formal languages: the regular languages and the context free languages. ![]() The effort that the parser has to go through is an indication of the complexity of the language. A (formal) parser is a tool that takes in a string and returns a TRUE or a FALSE depending on whether the string is in the language or not. Lex and Yacc runs on nike.cs.uga.edu and most UNIX machines.īackground: Overview of Lexical and Parsing ToolsĪ programming language is a set of strings. Here are some hints on getting familiar with the tools. The main objective for this assignment, is of-course for you to familiarize yourself with the compiler tools Lex and Yacc (or Flex and Bison). If you use resources other than the class materials, indicate what you used along with your answer. You may consult (but not copy) any outside resources you including books, papers, web sites and people. ![]() You must work on this project individually, but you may discuss this assignment with other students in the class and ask and provide help in useful ways, preferable over our email list so we can all benefit from your great ideas. Project 1: Project 1: Lex & Yacc - Compiler Tools Assignment Day
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |