Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
List of algorithms
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Programming language theory=== {{further|Programming language theory}} * [[C3 linearization]]: an algorithm used primarily to obtain a consistent linearization of a multiple inheritance hierarchy in object-oriented programming * [[Chaitin's algorithm]]: a bottom-up, graph coloring register allocation algorithm that uses cost/degree as its spill metric * [[Hindley-Milner type inference|Hindley–Milner type inference algorithm]] * [[Rete algorithm]]: an efficient pattern matching algorithm for implementing [[Start symbol (formal languages)|production rule]] systems * [[Sethi-Ullman algorithm]]: generates optimal code for arithmetic expressions ====Parsing==== {{further|Parsing}} * [[CYK algorithm]]: an O(n<sup>3</sup>) algorithm for parsing [[context-free grammar]]s in [[Chomsky normal form]] * [[Earley parser]]: another O(n<sup>3</sup>) algorithm for parsing any [[context-free grammar]] * [[GLR parser]]: an algorithm for parsing any [[context-free grammar]] by [[Masaru Tomita]]. It is tuned for deterministic grammars, on which it performs almost [[linear time]] and O(n<sup>3</sup>) in worst case. * [[Inside-outside algorithm]]: an O(n<sup>3</sup>) algorithm for re-estimating production probabilities in [[probabilistic context-free grammar]]s * [[LL parser]]: a relatively simple [[linear time]] parsing algorithm for a limited class of [[context-free grammar]]s * [[LR parser]]: A more complex [[linear time]] parsing algorithm for a larger class of [[context-free grammar]]s. Variants: ** [[Canonical LR parser]] ** [[Look-ahead LR parser|LALR (look-ahead LR) parser]] ** [[Operator-precedence parser]] ** [[Simple LR parser|SLR (Simple LR) parser]] ** [[Simple precedence parser]] * [[Packrat parser]]: a [[linear time]] parsing algorithm supporting some [[context-free grammar]]s and [[parsing expression grammar]]s * [[Recursive descent parser]]: a [[top-down parsing|top-down parser]] suitable for LL(''k'') grammars * [[Shunting-yard algorithm]]: converts an infix-notation math expression to postfix * [[Pratt parser]] * [[Lexical analysis]]
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
List of algorithms
(section)
Add topic