- To: gcc-help@xxxxxxxxxxx
- Subject: Complexity of gcc compiler
- From: vikram_sp <vikramforum@xxxxxxxxx>
- Date: Wed, 16 May 2012 04:28:47 -0700 (PDT)
- Comment: DKIM? See http://www.dkim.org
- Comment: DomainKeys? See http://antispam.yahoo.com/domainkeys
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.
[Linux C Programming]
[Linux Kernel]
[eCos]
[Fedora Development]
[Fedora Announce]
[Autoconf]
[The DWARVES Debugging Tools]
[Yosemite Campsites]
[Yosemite News]
[Linux GCC]