Complexity of gcc compiler

vikram_sp vikramforum@yahoo.com
Wed May 16 11:29:00 GMT 2012


I am wondering what may be the COMPLEXITY of GCC compiler in big Oh 
notation or other notation. 
I have some intuition that lexical analyzer's complexity is O(n) and that of
parser is O(n^3). Optimization is NPC. Code generator might have some 
log(n) factor. 
Taking these things in accounts what is the time complexity of compilers
in general and GCC in particular.
Likewise space complexity may also be given thought?

-----
Vikram
-- 
View this message in context: http://old.nabble.com/Complexity-of-gcc-compiler-tp33857388p33857388.html
Sent from the gcc - Help mailing list archive at Nabble.com.



More information about the Gcc-help mailing list