Notations used to state ideas about programs precisely. Big O notation describes how the running time or memory of an algorithm grows with the size of its input, a regular expression is a compact pattern language for matching text, and Backus-Naur form is a notation for writing down the grammar of a programming language. Each lets a statement be checked by anyone who knows the rules of the notation.
Browse By
Mathematical and Formal Notations
Filter Results3 entries
Sources
Wikipedia: Big O notation
WikipediaHas Member: Big O Notation, LeadQuote, Has Member: Big O Notation, Lead
Big O notation is a mathematical notation that describes the approximate size of a function on a domain.
Wikipedia: Regular expression
Wikimedia FoundationHas Member: Regular Expression, LeadQuote, Has Member: Regular Expression, Lead
A regular expression (shortened as regex or regexp), sometimes referred to as a rational expression, is a sequence of characters that specifies a match pattern in text.
Backus-Naur form, Wikipedia
Has Member: Backus-Naur Form, LeadQuote, Has Member: Backus-Naur Form, Lead
In computer science, Backus-Naur form or Pāṇini-Backus Form (BNF or PBF, pronounced ), also known as Backus normal form, is a notation system for defining the syntax of programming languages and other formal languages, developed by John Backus and Peter Naur.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.