|
- A* search algorithm - Wikipedia
A* pathfinding algorithm navigating around a randomly-generated maze Illustration of A* search for finding a path between two points on a graph From left to right, a heuristic that prefers points closer to the goal is used increasingly A* is an informed search algorithm, or a best-first search, meaning that it is formulated in terms of weighted graphs: starting from a specific starting node
- Comparison of parser generators - Wikipedia
This is a list of notable lexer generators and parser generators for various language classes
- Online algorithm - Wikipedia
Online algorithm In computer science, an online algorithm[1] is one that can process its input piece-by-piece in a serial fashion, i e , in the order that the input is fed to the algorithm, without having the entire input available from the start
- Programming Language Design and Implementation - Wikipedia
The Programming Language Design and Implementation (PLDI) conference is an annual computer science conference organized by the Association for Computing Machinery (ACM) which focuses on the study of algorithms, programming languages and compilers It is sponsored by the SIGPLAN special interest group on programming languages
- Principles of Compiler Design - Wikipedia
Principles of Compiler Design, by Alfred Aho and Jeffrey Ullman, is a classic textbook on compilers for computer programming languages Both of the authors won the 2020 Turing Award for their work on compilers
- Algorithm - Wikipedia
Algorithms are often studied abstractly, without referencing any specific programming language or implementation Algorithm analysis resembles other mathematical disciplines as it focuses on the algorithm's properties, not implementation
- List of algorithms - Wikipedia
List of algorithms An algorithm is fundamentally a set of rules or defined procedures that is typically designed and used to solve a specific problem or a broad set of problems
|
|
|