Week 2

  Week 2 I was tasked to actually make the scanner, so I took the scanner that we did in class, copy and pasted to another file and started to look at the text and Identify the super fiscal things of the code. The keywords, the letters used, the punctuation, numbers, etc. I'm making the scanner print out numbers for what it sees so for">" it might print "4" so I know it recognized it as what I want it to. Learning from my first scanner and make sure that it takes spaces, tabs, comments, and doesn't bug out. It also takes anything unknown and prints it so I know it doesn't recognize it, until its all numbers and it makes the pattern that I want. The next step will be to make the grammar and create a parser for the language. I've made some progress on the scanner and trying to debug because I'm having trouble running the scanner.

rnum { printf("1: %s\n", yytext) ;}

str { printf("3: %s\n", yytext); }

[-+]?[0-9]*\.[0-9]+ {printf("18: %s\n", yytext) ;}

[0-9]+  {printf("25: %s\n", yytext) ;}


Some of the code above. The code above is just some of the regular expressions. I want the code to find the keyword and print a number and the keyword, but its having trouble. Okay after some debugging I got it to work using the same main as our class activity.

rnum  return(REAL);

str  return(STRING);

[-+]?[0-9]*\.[0-9]+  return(REAL_CONST);

[0-9]+   return(INT_CONST);

[A-Za-z]+  return(ID);

That's what it looks like now. I took the token that was used for my class assignment and applied it to my own code so it makes sense. So, for week 3 I will try taking the next steps and show my Professor to see what he thinks.


Comments

  1. EricaFebruary 13, 2022 at 8:19 PM

    This is really cool, but a bit short and I formal. I need a little more detail and a visual of some sort would be great.

    ReplyDelete

Post a Comment

Popular posts from this blog

Week 9

Image
 Today I looked at some interesting videos of some leetcode videos, which use problems that show up at coding interviews. I watched a guy who was prepping for interviews by running through these problems and talking about them. First Video was about locating islands. (pic of the instructions below) So hopefully you can see how the first input has only one island because all the ones are surrounded by zeros. It's kinda hard to see at first but it helped when he points out why in the video. He talks about the problem and comes up with a pretty straightforward solution. He says he will use a breadth first search(BFS), which I've done a bit of research on before in my week 6 of last years blog. Breadth first search when used on binary search trees takes a node and searches all of its nodes, so I can see how it can apply to this problem. Breadth first search will take one island(1) and search all the 1s connected, which is an island, so when it can't find anymore it means there ...
Read more

Week 10

Image
 This week I found an interesting problem that was exactly like a problem I did in my class this semester, csc 230, but instead of mips I did it in java. The problem is fizzbuzz where you take a number and if the number is a multiple of 3 print fizz and it its a multiple of 5 print buzz and if its a multiple of both print fizzbuzz. There are two method one(first one) is the one that was in a video where I discovered the problem and the second one is me doing it the way I thought of. The problem was pretty easy but the way it did intrigued me because It was different than mine his felt much more clever than mine. What he does is creates variable fizz and buzz so when fizz equals 3 and buzz equals 5 we reset and add to the arraylist but its cool that he does this by using variables to keep track of the fizz and buzz. So fizz for the first 10 will look like this 0,1,2,0,1,2,0,1,2,0,1 for buzz its 0,1,2,3,4,0,1,2,3,4,0 at all zeros after the first zero will add the respective word....
Read more

Week 11

Image
 Today I did another leetcode problem. Like last week I found a similar problem to one I've done in class but with a different language but instead of mips this time it is in C++. I'm starting to think my 240 teacher was making us do these problems on purpose haha... anyway, the problem this time is called valid parenthesis or matching brackets is what my 240 teacher called it. I knew the basic rundown of the problem and tried to code it. But to give a brief rundown we are checking if all brackets "("  or "{"  or "[" are closed correctly. Fortunately, I was able to directly translate the code for the most part, so we can see the tiny differences between c++ and java.  We see in the two pictures below that c++ looks a little different. In java we see the stack as new stack but in C++ #include stack and we dont need to new. In C++ the string as treated a char arrays so we dont need to do charAt in C++ they already are characters and in this respect i...
Read more