Article 6DVK2 Parsing, precedence and recursion

Parsing, precedence and recursion

by
xlfs-0.2
from LinuxQuestions.org on (#6DVK2)
yes and no.

the "theoretical C parser syntax"** does not select the order

the full monte is: it is parsed and that triggers a handler that routine converts fully parsed expressions to ASM (byacc operations)

that handler routine is responsible for OPERATOR ORDERING (logic and math ordering), not the parser. so again C is not parsed to ASM. It is parsed into expressions for handlers that do the rest which then invoke each individual expression into ASM via binutils requests (gcc itself doesn't know how to make an asm instruction - it has a sublanguge for requesting it be done).

and that is why you don't see it in K&R C parsing syntax.

(if it were responsible it'd be plain as day and you wouldn't miss it)

GCC still works the same way "kinda". a byacc parser triggers bottom-up parsed tokens to handlers. it's in the byacc tutorial and an example calculator made using it.

GCC is not a C compiler anymore - it's a badly hacked C++13.x - it no longer really compiles C. (and when it does it's 100x slower than an authentic C compiler)
External Content
Source RSS or Atom Feed
Feed Location https://feeds.feedburner.com/linuxquestions/latest
Feed Title LinuxQuestions.org
Feed Link https://www.linuxquestions.org/questions/
Reply 0 comments