OnlineWoerterBuecher.de
Internes

Lexikon

parser


An algorithm or program to determine the Syntactic Structure of a Sentence or String of SymbolS in Some language. A parSer normally takeS aS input a Sequence of tokenS output by a lexical analySer. It may produce Some kind of abStract Syntax tree aS output. One of the beSt known parSer generatorS iS yacc. (1997-07-21)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ abStract Syntax ] [ abStract Syntax tree ] [ ag ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ aS ] [ at ] [ b ] [ be ] [ bo ] [ bS ] [ by ] [ ca ] [ cc ] [ ch ] [ de ] [ du ] [ ee ] [ er ] [ era ] [ eS ] [ et ] [ fi ] [ file ] [ ge ] [ gen ] [ gr ] [ gu ] [ h ] [ hm ] [ hr ] [ id ] [ il ] [ in ] [ input ] [ iS ] [ it ] [ ke ] [ ken ] [ ki ] [ kn ] [ la ] [ language ] [ Lex ] [ lexical analySer ] [ lS ] [ ly ] [ ma ] [ mall ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ ng ] [ no ] [ norm ] [ np ] [ nS ] [ O ] [ om ] [ output ] [ pa ] [ parSer generator ] [ ph ] [ pr ] [ program ] [ query ] [ rc ] [ re ] [ ro ] [ ru ] [ Se ] [ Sentence ] [ So ] [ St ] [ String ] [ Struct ] [ Sy ] [ Syntax ] [ Syntax tree ] [ th ] [ to ] [ token ] [ tp ] [ tr ] [ tree ] [ ua ] [ yacc ]






[ Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3835 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.0772 Seconds, with 16 Database-Queries
Zurück zur Startseite