# A report on Formal language

Alphabet and are well-formed according to a specific set of rules.

- Formal language34 related topics with Alpha

## Programming language

7 linksA programming language is any set of rules that converts strings, or graphical program elements in the case of visual programming languages, to various kinds of machine code output.

## Logic

8 linksStudy of correct reasoning or good arguments.

Study of correct reasoning or good arguments.

One prominent approach associates their difference with the study of arguments expressed in formal or informal languages.

## String (computer science)

7 linksTraditionally a sequence of characters, either as a literal constant or as some kind of variable.

Traditionally a sequence of characters, either as a literal constant or as some kind of variable.

In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set called an alphabet.

## Formal system

6 linksAbstract structure used for inferring theorems from axioms according to a set of rules.

Abstract structure used for inferring theorems from axioms according to a set of rules.

Each formal system uses primitive symbols (which collectively form an alphabet) to finitely construct a formal language from a set of axioms through inferential rules of formation.

## Symbol (formal)

5 linksFundamental concept in logic, tokens of which may be marks or a configuration of marks which form a particular pattern.

Fundamental concept in logic, tokens of which may be marks or a configuration of marks which form a particular pattern.

Although the term "symbol" in common use refers at some times to the idea being symbolized, and at other times to the marks on a piece of paper or chalkboard which are being used to express that idea; in the formal languages studied in mathematics and logic, the term "symbol" refers to the idea, and the marks are considered to be a token instance of the symbol.

## Formal grammar

4 linksIn formal language theory, a grammar (when the context is not given, often called a formal grammar for clarity) describes how to form strings from a language's alphabet that are valid according to the language's syntax.

## Context-free grammar

4 linksSet of all strings of terminal symbols that can be derived, by repeated rule applications, from some particular nonterminal symbol ("start symbol").Nonterminal symbols are used during the derivation process, but do not appear in its final result string.

Set of all strings of terminal symbols that can be derived, by repeated rule applications, from some particular nonterminal symbol ("start symbol").Nonterminal symbols are used during the derivation process, but do not appear in its final result string.

Languages generated by context-free grammars are known as context-free languages (CFL).

## Regular expression

6 linksSequence of characters that specifies a search pattern in text.

Sequence of characters that specifies a search pattern in text.

Regular expression techniques are developed in theoretical computer science and formal language theory.

## Mathematical logic

7 linksStudy of formal logic within mathematics.

Study of formal logic within mathematics.

These systems, though they differ in many details, share the common property of considering only expressions in a fixed formal language.

## Well-formed formula

3 linksIn mathematical logic, propositional logic and predicate logic, a well-formed formula, abbreviated WFF or wff, often simply formula, is a finite sequence of symbols from a given alphabet that is part of a formal language.