Reduced & Modified Instruction Set Wrapper for C and C++

This R&D project intends to address / remedy:
1: The availability of unsafe functions in C/C++
2: Certain overly complex Functionalities in C/C++


Project Goals :

1: This project thus intends to derive a subset of C and C++ (initially catering enthusiasts, hobbyists, students and novices) AND allow a safe coding platform, where unsafe functions (intrinsic to the language), are filtered out / not allowed to go through into compilation stage. The Wrapper that will be developed under this project, will thus filter out all such "flagged" functionalities.

(Thus for example, all string manipulation functions which are know to be potentially unsafe will be excluded.)

2: Many novices/ new developers, finds the C/C++ memory pointer syntax overly cryptic and convoluted. For example we have Pointers, Pointers to Pointers,  References etc. etc. Thus for example when one gets into scenarios the such of, double indirections (and beyond), many finds it overly convoluted.

Thus to simplify the memory access synthax, a Set of more intuitive keywords will be introduced. 
For example (Mem&Of), (&Of-->), (Val@-->)

Which when translated into English:
Keyword English Translation
 (Mem&Of)  Memory Address Of
 (&Of-->)  Address Of Memory Pointer/ Location
 (Val@-->)  Value At Memory Pointer/ Location

Thus the new keywords would hopefully assist, specially a novice user to C/C++ get a better intuitive meaning of what the variables holds, what the operators does / return etc.

A modified notation to more clearly denote/ distinguish, elements / variable that can grow dynamically at run time AND those that are fixed in length (aka length / size defined/ set at compile time), will be introduced.

Thus for example the three dots in the following:
 CADAssembly[SubComponent ...]
 CADSubComponent[Element ...]
would represent dynamic arrays that can grow / shrink at runtime (aka. SubComponents and Elements can be added /removed at run time, and thus the array/ container can grow/ shrink in size, when the user adds / removes components from the CAD drawing / diagram).

Whereas in the following; ChessBoard, represents an Array that will not grow/ shrink in size during run time.
const int ROWS = 8:
const int COLUMNS = 8;
ChessBoard[ROWS][COLUMNS];

Likewise notations will be defined to more clearly denote, pointers to dynamic arrays etc.

A GUI component will be introduced to view / inspect dynamic and memory elements in a visual manner. For example the double star notation used in the argv element, is not immediately clear to a novice. Thus this GUI component will assist to visualize, the double indirection to the command line arguments.

3: The Wrapper will next Convert the above "more Intuitive Synthax", into the Native C/C++ Synthax and call the appropriate compiler to compile the Converted code.

4: This revised language synthax should have sufficient functionality/ depth, to call (for example) standard OS APIs, as well as industry standard libraries (ex: OpenGL, OpenCL, OpenCV etc.)

5: The Wrapper GUI, would check for violations of the Set of Reduced Instruction Set Rules, and provide / issue appropriate errors and warnings... (and only proceed onto submission to compilation, only once the identified errors/ faults have been fixed).

6: The possibility of developing "a common industry standard", to define Library and API Function Call pre/post requisites, will be looked into. Thus for example, if a given library function requires the caller to free some resources after calling the said function, such would be clearly mentioned in the said function's header, via a standardized notation. Thus with this approach, either the pre-compiler or the synthax checker would have sufficient information to do validation checks as to whether the program has carried out the requisite pre/ post conditions.

For example if a function GETRESOURCEHANDLE requires the caller to free the aquired RESOURCE HANDLE, before calling the function a second time, such will be documented inside the said function's header. Or if a function is not thread safe, such could be stated / specified inside it's header. Thus either at pre-compilation or during the synthax checking stages such validation checks, could be carried out and appropriate errors detected.

Thus this stage of the project will focus on developing a standardized notation to describe such pre/post conditions.

Note: This project, would in most likelyhood be of an Academic Persuit, (the such of a GNU Open Source Project).

At stage 1 (initial stage) a new compiler will NOT be developed, but instead a Wrapper will be developed over the existing C/C++ compiler(s) (ex : gcc). This Wrapper will thus filter out content that is allowed to pass through, to the compilation stage and convert the keywords of the Simplified Instruction Set C/C++, into their native C/C++ via Lookup Translation Tables. At this stage of the project, the Syntax and Keywords of this new simplified C/C++ language will be finalised.

In the subsequent (second stage), the existing gcc source code would be upgraded/ modified, to compile this new/ modified C/C++ language.

Comments

Post a Comment

Popular posts from this blog

The DONX Framework &
The Dimensional Closure Principle :
A Counter-Cantorian Approach to Infinite Sets via Eℕ

Image
1. Introduction The nature and hierarchy of infinite sets have fascinated mathematicians since Georg Cantor’s foundational work in the late 19th century. Cantor’s revolutionary theory introduced the concept of different sizes, or cardinalities, of infinity - notably distinguishing the countably infinite set of natural numbers, denoted ℕ, from the uncountably infinite set of real numbers, ℝ. This distinction rests on the fundamental insight that while ℕ can be put into a one-to-one correspondence with any of its infinite subsets, no such correspondence can exist between ℕ and ℝ. Cantor’s diagonalization argument formally proves the uncountability of ℝ, establishing a strict hierarchy of infinities with ℝ being strictly “larger” than ℕ. However, classical set theory inherently assumes that every element of ℕ is a finite natural number, possessing a finite representation - for example, a finite string of digits in base 10. This assumption aligns well with our standard, intuitive unders...
Read more

A New Perspective on Infinity via a 2D Hilbert Hotel

Image
Challenging Cantor: A New Perspective on Infinity via a 2D Hilbert Hotel Synopsis Part I: Georg Cantor's diagonal argument is widely used in Set Theory, to demonstrate the uncountability of real numbers. However, a critical examination reveals potential flaws in its logic. This article presents a compelling alternative perspective, using a "2D Hilbert Hotel" analogy to visualize the relationship between natural and real numbers, offering a more intuitive perspective of infinite cardinalities. [Def : Any set X that has the same cardinality as the set of the Natural numbers, or  |  X | = | ℕ | = ℵ 0 is defined as a countably infinite set .] In-Depth Detail: Introduction: Georg Cantor's diagonal argument is widely used in literature as a proof of the uncountability of real numbers, establishing that the set of real numbers is a "larger" infinity than the set of natural numbers.  (Note: This diagonal argument was a simplified approach to this validation, which...
Read more

Testing Feasibility of FTL Data Communication via Quantum Entanglement

  Synopsis: As per current mainstream physics... Physical phenomenon needs to satisfy: 1. Principle of Locality 2. No-Communication Theorem 3. Speed of light in a vacuum is a constant c Thus under these postulates principles and theorems, it would be infeasible to transfer information faster than the speed of light. The following experimental setup would attempt to verify / challenge  the validity of this constraint via attempting to transfer information via entangled particles. I do agree that this is a preposterous proposition, but do hear me out... Specially with the results of Bell Inequality Experiments, it is now evident that the correlation between entangled particles is near instantaneous (aka the correlation does occur faster than the speed of light). Thus... [17 Nov 2025 Note : The following would probably not work apparently due to the entanglement between the particles breaking / decoherence , in the process...] Experimental Setup: A particle generator (placed b...
Read more