Compilers can compile a huge amount of source code. This giant code is translated into AST at the compilation stage. I believe that if the code is huge, this AST will also become huge.
Can we assume that the compiler will never run out of memory on a modern computer by building an AST and storing it in memory?
With virtual memory, the compiler / linker tools really don't have to worry much about the amount of memory.
, , , [ ] - , .
, VM . , .
[ , . . .]
, .
, : , , .
? , . , . .
Source: https://habr.com/ru/post/1655760/More articles:sparkr 2.0 read.df throws path error does not exist - apache-spark-2.0Asymptotic notation big (O) and Big (Omega) - algorithmПроблема выбора селектора CSS с подсветкой - htmlTesting the asynchronous iOS module (waitForExpectations failing) in xCode 8 / Swift 3 - iosAlgorithm for calculating the shortest path between two points on the surface of a three-dimensional grid - algorithmUnrecognized LLDB behavior in Android Studio 2.2 - androidhttps://translate.googleusercontent.com/translate_c?depth=1&pto=aue&rurl=translate.google.com&sl=ru&sp=nmt4&tl=en&u=https://fooobar.com/questions/1655762/convert-negative-seconds-to-hourminutesecond&usg=ALkJrhiPgjQfiB8KgS3y4Izq3Hm8FyXsEAHow to play YouTube video in popup popup in android - androidHow to make a marker with a custom image dragged into MapboxGL? - mapboxSlack API and slack user application always become invalid - oauth with botkit database - slack-apiAll Articles