Theory of Computation

[vivid drum]

<@&987246717831381062> please have a look, thanks.

[noble vale]

Checkout JFlap on github

[reef nova]

Brooo I also did that and was so excited....

I made a parser for expression evaluation

Then made a parser for XML files

Now I wanna make an assembler

But too distracted by other things lol

[dusty terrace]

yep, compiler design is a very big consumer of theory of computation. You probably learnt about deterministic finite automatons and context free grammars in your theory of comp class, those concepts are generally used to implement lexers (they use finite automatons, regular expressions) and parsers (these relies on the context free grammar abstractions)

you should be getting plenty of practical work applying finite automatons and cfgs in your compiler design class so i wouldn't stress too much

[vivid drum]

@gloomy moon

Your question has been closed due to inactivity.

If it was not resolved yet, feel free to just post a message below
to reopen it, or create a new thread.

Note that usually the reason for nobody calling back is that your
question may have been not well asked and hence no one felt confident
enough answering.

When you reopen the thread, try to use your time to improve the quality
of the question by elaborating, providing details, context, all relevant code
snippets, any errors you are getting, concrete examples and perhaps also some
screenshots. Share your attempt, explain the expected results and compare
them to the current results.

Also try to make the information easily accessible by sharing code
or assignment descriptions directly on Discord, not behind a link or
PDF-file; provide some guidance for long code snippets and ensure
the code is well formatted and has syntax highlighting. Kindly read through
https://stackoverflow.com/help/how-to-ask for more.

With enough info, someone knows the answer for sure 👍