A formal language is a structured set of strings of symbols that adhere to specific syntactic and grammatical rules. Unlike natural languages, which can be ambiguous and context-dependent, formal languages are designed to eliminate such ambiguities, making them useful in various fields like mathematics, l'informatique, and logic.
Formal languages are composed of symbols from a defined alphabet, combined according to rules that specify how these symbols can be arranged. The rules help define the syntax of the language, which dictates the valid constructions of strings. For example, in langages de programmation, a formal language specifies how commands and expressions must be structured for the code to be correctly interpreted by a compiler or interpreter.
Les langages formels peuvent être classés en plusieurs types en fonction de leur complexité et des types de règles qu’ils utilisent. Les classifications les plus courantes incluent :
- Langages réguliers : Définis par des expressions régulières et reconnus par des automates finis.
- Langages hors contexte : Generated by context-free grammars and can be recognized by pushdown automata, commonly used in programming language paradigms.
- Langages sensibles au contexte : More complex languages that require context to be correctly interpreted, recognized by linear-bounded automata.
In computer science, formal languages are foundational for designing programming languages, creating compilers, and developing algorithms. They facilitate clear communication of instructions to computers, ensuring that the logic of a program is unambiguous and executable.