Assignment-3/scanner.l

192 lines
6.2 KiB
Plaintext

/*
* Lexer definition for simplified Python syntax.
*/
%{
#include <iostream>
#include <stack>
#include <cstdlib>
#include "tree.hpp"
#include "parser.hpp"
/*
* We'll use this stack to keep track of indentation level, as described in
* the Python docs:
*
* https://docs.python.org/3/reference/lexical_analysis.html#indentation
*/
std::stack<int> _indent_stack;
%}
%option noyywrap
%option yylineno
%%
%{
/*
* These lines go at the top of the lexing function. We only want to
* initialize the indentation level stack once by pushing a 0 onto it (the
* indentation stack should never be empty, except immediately after it is
* created).
*/
if (_indent_stack.empty()) {
_indent_stack.push(0);
}
/*
* We also want to initialize a parser state to be sent to the parser on
* each push parse call.
*/
yypstate* pstate = yypstate_new();
YYSTYPE yylval;
YYLTYPE loc;
#define PUSH_TOKEN(token, text) do { \
yylval.str = text ? new std::string(text) : NULL; \
int status = yypush_parse(pstate, token, &yylval, &loc); \
if (status != YYPUSH_MORE) { \
yypstate_delete(pstate); \
return status; \
} \
} while (0)
%}
^[ \t]*\r?\n { /* Skip blank lines */ }
^[ \t]*#.*\r?\n { /* Skip whole-line comments. */ }
#.*$ { /* Skip comments on the same line as a statement. */ }
^[ \t]+ {
/*
* Handle indentation as described in Python docs linked above.
* Note that this pattern treats leading spaces and leading tabs
* equivalently, which could cause some unexpected behavior if
* they're combined in a single line. For the purposes of this
* project, that's OK.
*/
if (_indent_stack.top() < yyleng) {
/*
* If the current indentation level is greater than the
* previous indentation level (stored at the top of the stack),
* then emit an INDENT and push the new indentation level onto
* the stack.
*/
_indent_stack.push(yyleng);
/* std::cout << "INDENT" << std::endl; */
PUSH_TOKEN(INDENT, NULL);
} else {
/*
* If the current indentation level is less than or equal to
* the previous indentation level, pop indentation levels off
* the stack until the top is equal to the current indentation
* level. Emit a DEDENT for each element popped from the stack.
*/
while (!_indent_stack.empty() && _indent_stack.top() != yyleng) {
_indent_stack.pop();
/* std::cout << "DEDENT" << std::endl; */
PUSH_TOKEN(DEDENT, NULL);
}
/*
* If we popped everythin g off the stack, that means the
* current indentation level didn't match any on the stack,
* which is an indentation error.
*/
if (_indent_stack.empty()) {
std::cerr << "Error: Incorrect indentation on line "
<< yylineno << std::endl;
return 1;
}
}
}
^[^ \t\n]+ {
/*
* If we find a line that's not indented, pop all indentation
* levels off the stack, and emit a DEDENT for each one. Then,
* call REJECT, so the next rule matching this token is also
* applied.
*/
while(_indent_stack.top() != 0) {
_indent_stack.pop();
/* std::cout << "DEDENT" << std::endl; */
PUSH_TOKEN(DEDENT, NULL);
}
REJECT;
}
\r?\n {
/* std::cout << "NEWLINE" << std::endl; */
PUSH_TOKEN(NEWLINE, NULL);
}
<<EOF>> {
/*
* If we reach the end of the file, pop all indentation levels
* off the stack, and emit a DEDENT for each one.
*/
while(_indent_stack.top() != 0) {
_indent_stack.pop();
/* std::cout << "DEDENT" << std::endl; */
PUSH_TOKEN(DEDENT, "");
}
int status = yypush_parse(pstate, 0, NULL, NULL);
yypstate_delete(pstate);
return status;
/* yyterminate(); */
}
[ \t] { /* Ignore spaces that haven't been handled above. */ }
"and" { PUSH_TOKEN(AND, NULL); }
"break" { PUSH_TOKEN(BREAK, NULL); }
"def" { PUSH_TOKEN(DEF, NULL); }
"elif" { PUSH_TOKEN(ELIF, NULL); }
"else" { PUSH_TOKEN(ELSE, NULL); }
"for" { PUSH_TOKEN(FOR, NULL); }
"if" { PUSH_TOKEN(IF, NULL); }
"not" { PUSH_TOKEN(NOT, NULL); }
"or" { PUSH_TOKEN(OR, NULL); }
"return" { PUSH_TOKEN(RETURN, NULL); }
"while" { PUSH_TOKEN(WHILE, NULL); }
"True" { PUSH_TOKEN(BOOLEAN, yytext); }
"False" { PUSH_TOKEN(BOOLEAN, yytext); }
[a-zA-Z_][a-zA-Z0-9_]* { PUSH_TOKEN(IDENTIFIER, yytext); }
-?[0-9]*"."[0-9]+ { PUSH_TOKEN(FLOAT, yytext); }
-?[0-9]+ { PUSH_TOKEN(INTEGER, yytext); }
"=" { PUSH_TOKEN(ASSIGN, NULL); }
"+" { PUSH_TOKEN(PLUS, NULL); }
"-" { PUSH_TOKEN(MINUS, NULL); }
"*" { PUSH_TOKEN(TIMES, NULL); }
"/" { PUSH_TOKEN(DIVIDEDBY, NULL); }
"==" { PUSH_TOKEN(EQ, NULL); }
"!=" { PUSH_TOKEN(NEQ, NULL); }
">" { PUSH_TOKEN(GT, NULL); }
">=" { PUSH_TOKEN(GTE, NULL); }
"<" { PUSH_TOKEN(LT, NULL); }
"<=" { PUSH_TOKEN(LTE, NULL); }
"(" { PUSH_TOKEN(LPAREN, NULL); }
")" { PUSH_TOKEN(RPAREN, NULL); }
"," { PUSH_TOKEN(COMMA, NULL); }
":" { PUSH_TOKEN(COLON, NULL); }
. {
std::cerr << "Unrecognized token on line " << yylineno << ": "
<< yytext << std::endl;
PUSH_TOKEN(yytext[0], NULL);
}
%%