build me a programming language

description of any programming language using some kind of formal grammar such as BNF, Finite Automata, or State Transition Diagrams (or some combination of all three), along with an informal description of some aspects of the new language. Your language design document will include a statement of the considerations that led you to this design, as well as a brief rationale for that design. Language Properties: The language will need some method of getting and displaying information on a dumb terminal. You will need to consider the problem of conditional statements. How does data get defined (static or inferential typing). Is this an REPL language or a compiled language? What are the architectural considerations? Is it a procedural or declarative language? Will it require automatic garbage collection? Additional Guidance: You do not need to create a compiler for your language design. Keep the design as simple as possible, but not simpler. Present your design in the most concise way possible. Footnote any outside sources you reference to help in the design. Will the language support simple mathematical capabilities? Will the language support string capabilities? Does the language conform to the model of context-free languages described in our textbook? How is data described? Declared data types? Infered data types? Are there any features for internal control and reliability?