LogFAQs > #922720510

LurkerFAQs, Active DB, DB1, DB2, DB3, DB4, Database 5 ( 01.01.2019-12.31.2019 ), DB6, DB7, DB8, DB9, DB10, DB11, DB12, Clear

Topic List	Page List: 1
Topic	Ok, college is a joke.
Yellow 06/03/19 3:14:17 AM #34:	Sahuagin posted... Yellow posted... What is, the library linking? languages are recursive for one thing. maybe you know that and can already parse complex expressions, but otherwise I would start with a simple arithmetic expression parser. other than that, there's all kinds of complex things that are not so easy. type inference, scopes, closures, lambdas. or even, what about something simple like a class? I wrote a math string solver at one point that used pemdas. My interpreter did subroutines, so recursion worked. I had multiple hashtables (planned) for scopes that were disposed at the respective at the end of methods. It was slow, as it worked with the string the whole time, so I'd probably compile it into objects representing values and object references before running. For classes I'd probably define a class with object representing all methods objects properties and such, but I never did get around to working with that. I guess you'd just have to follow the logic of a compiler. It would basically be Java at that point. :P --- https://www.youtube.com/watch?v=jZNqaAh6iLU <cite>Yellow posted [p:922720510] in Ok, colleg... [t:77749654]...</cite> <quote><cite>Sahuagin posted...</cite> <quote><cite>Yellow posted...</cite> <quote>What is, the library linking?</quote> languages are recursive for one thing. maybe you know that and can already parse complex expressions, but otherwise I would start with a simple arithmetic expression parser. other than that, there's all kinds of complex things that are not so easy. type inference, scopes, closures, lambdas. or even, what about something simple like a class?</quote> I wrote a math string solver at one point that used pemdas. My interpreter did subroutines, so recursion worked. I had multiple hashtables (planned) for scopes that were disposed at the respective at the end of methods. It was slow, as it worked with the string the whole time, so I'd probably compile it into objects representing values and object references before running. For classes I'd probably define a class with object representing all methods objects properties and such, but I never did get around to working with that. I guess you'd just have to follow the logic of a compiler. It would basically be Java at that point. :P --- https://www.youtube.com/watch?v=jZNqaAh6iLU</quote> ... Copied to Clipboard!
Topic List	Page List: 1