Category:Formal languages

A

• ► Algorithms on strings‎ (8 C, 7 P)

D

• ► Dependently typed languages‎ (12 P)

F

• ► Formal theories‎ (2 C, 3 P)

G

• ► Grammar frameworks‎ (1 C, 53 P)

G cont.

• ► Graph rewriting‎ (6 P)

L

• ► Logical symbols‎ (2 C, 11 P)

P

• ► Parsing‎ (3 C, 24 P)
• ► Parsing algorithms‎ (24 P)

P cont.

• ► Pattern matching‎ (4 C, 25 P)
• ► Problems on strings‎ (7 P)

A

• Abstract family of acceptors
• Abstract family of languages
• Abstract rewriting system
• Abstract semantic graph
• Abstract syntax tree
• Action algebra
• Adaptive grammar
• Affix grammar
• Agent Communications Language
• Alphabet (computer science)
• Ambiguous grammar
• Antimatroid
• Aperiodic finite state automaton
• Arden's Rule
• Attribute grammar
• Augmented Backus–Naur Form

B

• Bach language
• Backus–Naur Form
• Bigram
• Boolean grammar

C

• Categorial grammar
• Chomsky hierarchy
• Chomsky normal form
• Chomsky–Schützenberger theorem
• Compiler Description Language
• Concatenation
• Cone (formal languages)
• Conference on Implementation and Application of Automata
• Conjunctive grammar
• Context change potential
• Context-free grammar
• Context-free language
• Context-sensitive grammar
• Context-sensitive language
• Controlled grammar
• Convolution (computer science)

D

• Definite clause grammar
• Descriptional Complexity of Formal Systems
• Descriptive interpretation
• Deterministic context-free grammar
• Deterministic context-free language
• Diff
• Discontinuous-constituent phrase structure grammar
• Dyck language

E

• EARMARK
• ECLR-attributed grammar
• Empty string
• Erasing rule
• Extended Affix Grammar
• Extended Backus–Naur Form

F

• Finite state transducer
• Finite thickness
• Formal grammar
• Formal language
• Formal proof
• Formal system
• Formation rule
• Free monoid
• Free partially commutative group

G

• Gellish English
• Generalized context-free grammar

G cont.

• Generalized star height problem
• Global index grammar
• Grammar systems theory
• Grammars
• Greibach normal form

H

• Head grammar
• History monoid

I

• Indexed grammar
• Indexed language
• Intended interpretation
• International Conference on Developments in Language Theory
• Interpretation (logic)
• Introduction to Automata Theory, Languages, and Computation

J

• Junction Grammar

K

• Kleene algebra
• Kleene star
• Kuroda normal form

L

• L-attributed grammar
• L-system
• Language equation
• Language identification in the limit
• Left quotient
• Left recursion
• Levi's lemma
• Lexical grammar
• Linear grammar
• List of formal language and literal string topics
• Literal movement grammar
• Locally catenative sequence
• Longest increasing subsequence
• Longest repeated substring problem
• LR-attributed grammar

M

• Markup language
• Matrix grammar
• Maximal pair
• Metacharacter
• Metasyntax
• Mildly context-sensitive language
• Minimalist grammar
• Mizar system
• Montague grammar
• Myhill–Nerode theorem

N

• Nested word
• Non-logical symbol
• Noncontracting grammar
• Normal form (abstract rewriting)

O

• Ockham algebra
• Ogden's lemma
• Omega language
• Omega-regular language
• Operator-precedence grammar

P

• Parikh's theorem
• Parser combinator
• Parser Grammar Engine
• Parsing expression grammar
• Permutation automaton
• Picture language
• Post canonical system
• Prefix grammar
• Proof (truth)
• Pumping lemma

P cont.

• Pumping lemma for context-free languages
• Pumping lemma for regular languages

Q

• Quasi-quotation

R

• Range concatenation grammars
• Rational language
• Recognizable language
• Recursive language
• Recursive languages and sets
• Recursively enumerable language
• Regular expression
• Regular grammar
• Regular language
• Regular tree grammar
• Regulated rewriting
• Rewriting
• Right quotient

S

• S-attributed grammar
• SCIgen
• Semantics encoding
• Semi-Thue system
• Semiautomaton
• Shortest common supersequence
• Simple precedence grammar
• SLR grammar
• Smallest grammar problem
• Sparse language
• Star height
• Star height problem
• Star-free language
• Stochastic context-free grammar
• Stochastic language
• Straight-line grammar
• String (computer science)
• String operations
• Strong generative capacity
• Symbol (formal)
• Synchronous context-free grammar
• Syntactic monoid
• Syntactic predicate
• Syntax (logic)
• Syntax diagram

T

• Tell-tale
• Terminal and nonterminal symbols
• Terminal yield
• Top-down parsing language
• Trace monoid
• Trace theory
• Two-level grammar

U

• Unary language
• Union of two regular languages
• Uniquely inversible grammar
• Unrestricted grammar
• Useless rules

V

• Van Wijngaarden grammar

W

• Weak generative capacity
• Weighted context-free grammar
• Well-formed formula
• Wirth syntax notation
• Wirth-Weber precedence relationship

Ω

• Ω-language