You need to create a structure called Employee with the following properties: 1 – Name 2- Age 3- Salary 4- Status Final Assignment Menu : Enter n number of employees details (name ,age ,salary, status(if age>=60 , status=retired… if age<60 status=working)) Calculate salary after tax (if retired tax=5%, if working tax=8%) Salary after deduction (let user enter employee name and amount of deduction) Annual salary (user enter a name) Print retired employees details Print working employees details Print employees all details (name ,age ,salary ,salary after tax, status) To exit the program Notes: Create a function for each option Make your program user friendly. Use comments when needed. The Printing should be well organised. You must use methods and arrays. in c program in simple way

yes, 🙏

Good evening, everyone! I'm currently facing difficulties with a recent project I've been developing. I'm aiming to implement a terminal calculator entirely in C. So far, I've created a lexer that generates tokens for operators and numbers provided in the formula by the user. However, I'm struggling with implementing the parser. My intention is to develop the parser in a way that it 'processes' these tokens and creates an Abstract Syntax Tree (AST) which is gonna be used by an interpreter to calculate the result. Despite numerous failed attempts, I haven't been able to arrive at an implementation that works. Even after searching for references, I couldn't find anything specific enough to help solve my problem. I'd greatly appreciate it if anyone in the group could assist me with this implementation or provide any useful references. Below is the code related to the application: https://gist.github.com/Anthhon/06e5cd4d19f0c7b271526384e6dfbcf0

I bet there are a lot of material out there on the matter

You can also use bison parser generator to generate the parser for you

The main issue lies in the logic behind generating the AST. Currently, the calculator stores all tokens in a list without a specific form or order. I'm struggling in devising a method to generate the AST structure efficiently. My struggle is in creating and arranging the AST nodes in accordance with the mathematical order of operations. I attempted to review other C-based calculators on GitHub, but most of them are not implemented in a similar manner or are quite challenging to comprehend. I also tried to make a solution by myself and my approach involved categorizing all operations and assigning them distinct "priority values." Then, I planned to organize them within a Tree Structure. (but this would need a double check to avoid duplicate values and etc.) However, I'm concerned that this approach might overly complicate the solution.

I'm gonna search about that to see if it's useful, thanks!

You can take a look into https://craftinginterpreters.com It's a nice book that is gonna dive you into a programming language implementation, which is the next step after the calculator

Do you know any free alternative?

Do you know any free alternative?

it is fun as the topic comes up when I am writing an interpreter

Yet another one?

I'm lost, which compiler?

This is crazy

Do you use an "of-the-shelf" JIT?

Well, I am the infinite source of my own insanity, academics also help sometimes

Ahahahahaha, no, I am even removing the standard library of C++ from the dependencies

Do you have a job?😂 (This is getting pretty offtopic)

Maniac

will you eventually rewrite your compiler in your own language?

Hi guys, i wanna know what's the next step after oop using c#, pls

Hi guys, i wanna know what's the next step after oop using c#, pls

Good evening, everyone! I'm currently facing difficulties with a recent project I've been developing. I'm aiming to implement a terminal calculator entirely in C. So far, I've created a lexer that generates tokens for operators and numbers provided in the formula by the user. However, I'm struggling with implementing the parser. My intention is to develop the parser in a way that it 'processes' these tokens and creates an Abstract Syntax Tree (AST) which is gonna be used by an interpreter to calculate the result. Despite numerous failed attempts, I haven't been able to arrive at an implementation that works. Even after searching for references, I couldn't find anything specific enough to help solve my problem. I'd greatly appreciate it if anyone in the group could assist me with this implementation or provide any useful references. Below is the code related to the application: https://gist.github.com/Anthhon/06e5cd4d19f0c7b271526384e6dfbcf0

Good evening, everyone! I'm currently facing difficulties with a recent project I've been developing. I'm aiming to implement a terminal calculator entirely in C. So far, I've created a lexer that generates tokens for operators and numbers provided in the formula by the user. However, I'm struggling with implementing the parser. My intention is to develop the parser in a way that it 'processes' these tokens and creates an Abstract Syntax Tree (AST) which is gonna be used by an interpreter to calculate the result. Despite numerous failed attempts, I haven't been able to arrive at an implementation that works. Even after searching for references, I couldn't find anything specific enough to help solve my problem. I'd greatly appreciate it if anyone in the group could assist me with this implementation or provide any useful references. Below is the code related to the application: https://gist.github.com/Anthhon/06e5cd4d19f0c7b271526384e6dfbcf0

Good evening, everyone! I'm currently facing difficulties with a recent project I've been developing. I'm aiming to implement a terminal calculator entirely in C. So far, I've created a lexer that generates tokens for operators and numbers provided in the formula by the user. However, I'm struggling with implementing the parser. My intention is to develop the parser in a way that it 'processes' these tokens and creates an Abstract Syntax Tree (AST) which is gonna be used by an interpreter to calculate the result. Despite numerous failed attempts, I haven't been able to arrive at an implementation that works. Even after searching for references, I couldn't find anything specific enough to help solve my problem. I'd greatly appreciate it if anyone in the group could assist me with this implementation or provide any useful references. Below is the code related to the application: https://gist.github.com/Anthhon/06e5cd4d19f0c7b271526384e6dfbcf0

https://git.nekoit.xyz/Archivist/UserScript

Develop a Windows-based C++ application with the following specifications: 1. The application should be capable of executing other programs as subprocesses. 2. Before initiating any subprocess, the program must perform a pre-check. Specifically, it should attempt to suspend the Steam.exe process in a case-insensitive manner. 3. If the suspension of Steam.exe is unsuccessful, the software must gracefully exit with error code 1. 4. On successful suspension of Steam.exe, the application should proceed to resume the Steam process. 5. If the application is launched without a valid executable path, it should enter a background state, awaiting executable files. 6. Ensure that only one instance of the software is allowed to run. During the first instance, the application should start in the background, waiting for executable files. 7. In the case of a second instance attempting to run, it should gracefully exit after passing its arguments to the first running instance. The first instance, already in operation and waiting for commands, should receive the arguments and initiate the subprocess corresponding to the provided executable path. Importantly, the second instance should not perform the Steam.exe check and should exit after passing the arguments.

Develop a Windows-based C++ application with the following specifications: 1. The application should be capable of executing other programs as subprocesses. 2. Before initiating any subprocess, the program must perform a pre-check. Specifically, it should attempt to suspend the Steam.exe process in a case-insensitive manner. 3. If the suspension of Steam.exe is unsuccessful, the software must gracefully exit with error code 1. 4. On successful suspension of Steam.exe, the application should proceed to resume the Steam process. 5. If the application is launched without a valid executable path, it should enter a background state, awaiting executable files. 6. Ensure that only one instance of the software is allowed to run. During the first instance, the application should start in the background, waiting for executable files. 7. In the case of a second instance attempting to run, it should gracefully exit after passing its arguments to the first running instance. The first instance, already in operation and waiting for commands, should receive the arguments and initiate the subprocess corresponding to the provided executable path. Importantly, the second instance should not perform the Steam.exe check and should exit after passing the arguments.

Hello guys, i Need some help with Windows10 EPROCESS and ETHREAD kernel strutture, there isnt a good documentation

There is no good documentation on purpose, the point of opaque structures is to not have an explorable structure the API user would mess up with

Yeah im developing a kernel mode driver and i need change data structure of a created thread

Hello guys, i Need some help with Windows10 EPROCESS and ETHREAD kernel strutture, there isnt a good documentation

ur making a cheat or what

Yeah im developing a kernel mode driver and i need change data structure of a created thread

For control flow.

A bit of a stupid question, the structure _ETHREAD on the vergiliusproject site declares a _CLIENT_ID substructure but the compiler doesn't find it. PETHREAD is a pointer to _ETHREAD struct

if you want the full struct, https://www.vergiliusproject.com/

This site is just viewing existing ntoskrnl.pdb from ms site