Skip to main content
Share Your Experience: Take the 2024 Developer Survey
3 votes

How to prove a function is a bijection (name mangling)?

Let $\Sigma$ be an alphabet including underscore, decimal digits, letters, and parentheses (e.g. the printable ASCII characters). Define a mangling function $f:(\Sigma^* \times \Sigma^*) \to \Sigma^*$ ...
Kai's user avatar
  • 908
1 vote

can programming language be described by ambiguous grammar, if yes, will that cause any problem?

Grammars are just a tool. An ambiguous grammar is not a problem if the programming language demands that statements are to be parsed in a specific way, even though the grammar doesn't require it. In C,...
gnasher729's user avatar
  • 30.4k

Only top scored, non community-wiki answers of a minimum length are eligible