Timeline for Tools for modelling compilers
Current License: CC BY-SA 4.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 23, 2020 at 16:53 | answer | added | vonbrand | timeline score: 1 | |
Feb 23, 2020 at 16:37 | comment | added | vonbrand | @DanielMGessel, TeX uses an ad hoc hand-written parser (surprisingly, as Knuth did fundamental work in parsing, and his professors were famously miffed that as an undergraduate he did more working on compilers during break than they did in a full year). | |
Feb 22, 2020 at 16:52 | comment | added | user46107 | If your thesis is focused on a specific compiler (can you share which it is?) it may use very ad-hoc or fully formal techniques - you have to dig into the code. If you can expand discussion to compilation in general, you are on safe ground, as the theory is very much applied in real implementations. | |
Feb 22, 2020 at 16:07 | comment | added | sesodesa | @Daniel No, I suppose it wouldn't. But the result produced by this compiler is not LaTeX (nor TeX macro expansions), so the tokens produced by the lexing stage have to be parsed somehow, no? | |
Feb 22, 2020 at 15:22 | comment | added | user46107 | Compilers have a front end and a back end. The concepts you mention are used in front end stages, lexical analysis and parsing, often via tools like lex/flex and yacc/bison. Back ends, doing optimization and code generation, use less formal methods. Interestingly, I believe Latex, based on Tex, is a macro system and I’m not sure whether it uses a parser at all... | |
Feb 22, 2020 at 14:46 | history | edited | sesodesa | CC BY-SA 4.0 |
Used a LaTeX macro, where appropriate.
|
Feb 22, 2020 at 13:10 | review | First posts | |||
Feb 22, 2020 at 13:34 | |||||
Feb 22, 2020 at 13:06 | history | asked | sesodesa | CC BY-SA 4.0 |