📑 Table of Contents
Parser
Paradigmmultiparadigm - macro, object-oriented
Designed byKonstantin Morshnev (Art. Lebedev Studio)
DeveloperAlexander Petrosyan (Art. Lebedev Studio)
First appeared1997; 29 years ago (1997)
Stable release
3.5.1 / January 10, 2025; 17 months ago (2025-01-10)
Typing disciplinedynamic
OSCross-platform - Windows, Unix-like
LicenseGPL[1]
Websitewww.parser.ru/en/ Edit this at Wikidata
Influenced by
Perl

Parser is a scripting language developed by Art. Lebedev Studio used for web development and server-side scripting.

The reference compiler for the language was developed in C++ by studio employees Konstantin Morshnev and Alexander Petrosyan to automate often repeated tasks, especially maintenance of already existing websites. It was used in many web projects of the studio. In March 2006, revision three was released as free software under a GPL license[1] and it is now used in other websites, mostly in Russia (according to a partial list at the language website).

Originally, Parser was merely a simple macro processing language but revision three introduced object-oriented programming features.

The language supports technologies needed for common web design tasks: XML, Document Object Model (DOM), Perl Compatible Regular Expressions (PCRE) and others.

Parser supports web server integration via:

See also

edit

References

edit
  1. ^ a b "License agreement". Download. Parser. Retrieved 2020-04-15. The Parser® software is distributed under the GNU GPL
edit

📚 Artikel Terkait di Wikipedia

Syntax (programming languages)

make them easier to parse; while the LR parser can parse any DCFL in linear time, the simple LALR parser and even simpler LL parser are more efficient

Shift-reduce parser

shift-reduce parser scans and parses the input text in one forward pass over the text, without backing up. The parser builds up the parse tree incrementally

Domain-specific language

developing programming languages and domain-specific languages (DSLs). Unlike standard parser generators, Xtext generates not only a parser but also a

Parser combinator

In computer programming, a parser combinator is a higher-order function that accepts several parsers as input and returns a new parser as its output. In

Recursive descent parser

In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent)

Parsing

LR parser LALR (look-ahead LR) parser Operator-precedence parser Simple LR parser Simple precedence parser Packrat parser: a linear time parsing algorithm

Earley parser

chart parser that uses dynamic programming. Earley parsers are appealing because they can parse all context-free languages, unlike LR parsers and LL

LL parser

In computer science, an LL parser is a top-down parser for a restricted context-free language. It parses the input from Left to right, performing Leftmost