| slovo | definícia |
syntax
(encz) | syntax,skladba n: [lingv.] Zdeněk Brož |
syntax
(encz) | syntax,syntax Zdeněk Brož |
syntax
(czen) | syntax,syntax Zdeněk Brož |
Syntax
(gcide) | Syntax \Syn"tax\, n. [L. syntaxis, Gr. ?, fr. ? to put together
in order; sy`n with + ? to put in order; cf. F. syntaxe. See
Syn-, and Tactics.]
1. Connected system or order; union of things; a number of
things jointed together; organism. [Obs.]
[1913 Webster]
They owe no other dependence to the first than what
is common to the whole syntax of beings. --Glanvill.
[1913 Webster]
2. That part of grammar which treats of the construction of
sentences; the due arrangement of words in sentences in
their necessary relations, according to established usage
in any language.
[1913 Webster] |
syntax
(wn) | syntax
n 1: the grammatical arrangement of words in sentences [syn:
syntax, sentence structure, phrase structure]
2: a systematic orderly arrangement
3: studies of the rules for forming admissible sentences |
syntax
(foldoc) | syntax
The structure of valid strings in a given language,
as described by a grammar. For example, the syntax of a
binary number could be expressed as
binary_number = bit [ binary_number ]
bit = "0" | "1"
meaning that a binary number is a bit optionally followed by a
binary number and a bit is a literal zero or one digit.
The meaning of the language is given by its semantics.
See also abstract syntax, concrete syntax.
(1994-10-31)
|
| | podobné slovo | definícia |
syntax
(encz) | syntax,skladba n: [lingv.] Zdeněk Brožsyntax,syntax Zdeněk Brož |
syntax checker
(encz) | syntax checker, n: |
syntax error
(encz) | syntax error, n: |
syntax language
(encz) | syntax language, n: |
syntaxes
(encz) | syntaxes, |
syntax
(czen) | syntax,syntax Zdeněk Brož |
Syntaxis
(gcide) | Syntaxis \Syn*tax"is\, n.
Syntax. [R.] --B. Jonson.
[1913 Webster] |
syntax
(wn) | syntax
n 1: the grammatical arrangement of words in sentences [syn:
syntax, sentence structure, phrase structure]
2: a systematic orderly arrangement
3: studies of the rules for forming admissible sentences |
syntax checker
(wn) | syntax checker
n 1: a program to check natural language syntax |
syntax error
(wn) | syntax error
n 1: an error of language resulting from code that does not
conform to the syntax of the programming language; "syntax
errors can be recognized at compilation time"; "a common
syntax error is to omit a parenthesis" |
syntax language
(wn) | syntax language
n 1: a language used to describe the syntax of another language |
abstract syntax
(foldoc) | abstract syntax
A form of representation of data that is
independent of machine-oriented structures and encodings and
also of the physical representation of the data. Abstract
syntax is used to give a high-level description of programs
being compiled or messages passing over a communications link.
A compiler's internal representation of a program will
typically be an abstract syntax tree. The abstract syntax
specifies the tree's structure is specified in terms of
categories such as "statement", "expression" and
"identifier". This is independent of the source syntax
(concrete syntax) of the language being compiled (though it
will often be very similar).
A parse tree is similar to an abstract syntax tree but it
will typically also contain features such as parentheses which
are syntactically significant but which are implicit in the
structure of the abstract syntax tree.
(1998-05-26)
|
abstract syntax notation 1
(foldoc) | Abstract Syntax Notation 1
ASN.1
X.208
(ASN.1, X.208, X.680) An
ISO/ITU-T standard for transmitting structured data on
networks, originally defined in 1984 as part of {CCITT
X.409} '84. ASN.1 moved to its own standard, X.208, in 1988
due to wide applicability. The substantially revised 1995
version is covered by the X.680 series.
ASN.1 defines the abstract syntax of information but does
not restrict the way the information is encoded. Various
ASN.1 encoding rules provide the transfer syntax (a
concrete representation) of the data values whose {abstract
syntax} is described in ASN.1. The standard ASN.1 encoding
rules include BER (Basic Encoding Rules - X.209), CER
(Canonical Encoding Rules), DER (Distinguished Encoding
Rules) and PER (Packed Encoding Rules).
ASN.1 together with specific ASN.1 encoding rules facilitates
the exchange of structured data especially between
application programs over networks by describing data
structures in a way that is independent of machine
architecture and implementation language.
OSI Application layer protocols such as X.400 MHS
electronic mail, X.500 directory services and SNMP use
ASN.1 to describe the PDUs they exchange.
Documents describing the ASN.1 notations: ITU-T Rec. X.680,
ISO 8824-1; ITU-T Rec. X.681, ISO 8824-2; ITU-T
Rec. X.682, ISO 8824-3; ITU-T Rec. X.683, ISO 8824-4
Documents describing the ASN.1 encoding rules: ITU-T
Rec. X.690, ISO 8825-1; ITU-T Rec. X.691, ISO 8825-2.
[M. Sample et al, "Implementing Efficient Encoders and
Decoders for Network Data Representations", IEEE Infocom 93
Proc, v.3, pp. 1143-1153, Mar 1993. Available from Logica,
UK].
See also snacc.
(2005-07-03)
|
abstract syntax tree
(foldoc) | abstract syntax tree
(AST) A data structure representing something which
has been parsed, often used as a compiler or
interpreter's internal representation of a program while it
is being optimised and from which code generation is
performed. The range of all possible such structures is
described by the abstract syntax.
(1994-11-08)
|
concrete syntax
(foldoc) | concrete syntax
The syntax of a language including all the
features visible in the source code such as parentheses
and delimiters. The concrete syntax is used when parsing
the program or other input, during which it is usually
converted into some kind of abstract syntax tree (conforming
to an abstract syntax).
In communications, concrete syntax is called {transfer
syntax}.
(1997-07-21)
|
infix syntax
(foldoc) | infix notation
infix syntax
One of the possible orderings of functions and
operands: in infix notation the functions are placed between
their operands, such as "1+2". Although infix notation is
limited to binary functions most languages mix infix notation
with prefix or postfix notation, as a form of {syntactic
sugar}.
(1997-01-17)
|
metasyntax
(foldoc) | metasyntax
Syntax used to describe syntax. The best known
example is BNF and its variants such as EBNF.
A metasyntactic variable is a variable used in
metasyntax.
(1999-04-06)
|
postfix syntax
(foldoc) | postfix notation
postfix syntax
Reverse Polish Notation
reverse polish syntax
RPN
(Or "Reverse Polish Notation", RPN) One of the
possible orderings of functions and operands: in postfix
notation the functions are preceded by all their operands.
For example, what may normally be written as "1+2" becomes "1
2 +". Postfix notation is well suited for stack based
architectures but modern compilers reduced this advantage
considerably.
The best-known language with postfix syntax is FORTH. Some
Hewlett-Packard calculators use it, e.g. HP-25, HP-29C,
HP-41C, HP-23SII.
Compare: infix notation, prefix notation.
(2003-06-23)
|
prefix syntax
(foldoc) | prefix notation
prefix syntax
(Or "prefix syntax") One of the possible orderings
of functions and operands: in prefix notation the function
precedes all its operands. For example, what may normally be
written as "1+2" becomes "(+ 1 2)". A few languages (e.g.,
lisp) have strictly prefix syntax, many more employ prefix
notation in combination with infix notation.
The opposite, postfix notation, is somewhat rarer.
(2014-07-08)
|
reverse polish syntax
(foldoc) | postfix notation
postfix syntax
Reverse Polish Notation
reverse polish syntax
RPN
(Or "Reverse Polish Notation", RPN) One of the
possible orderings of functions and operands: in postfix
notation the functions are preceded by all their operands.
For example, what may normally be written as "1+2" becomes "1
2 +". Postfix notation is well suited for stack based
architectures but modern compilers reduced this advantage
considerably.
The best-known language with postfix syntax is FORTH. Some
Hewlett-Packard calculators use it, e.g. HP-25, HP-29C,
HP-41C, HP-23SII.
Compare: infix notation, prefix notation.
(2003-06-23)
|
syntax
(foldoc) | syntax
The structure of valid strings in a given language,
as described by a grammar. For example, the syntax of a
binary number could be expressed as
binary_number = bit [ binary_number ]
bit = "0" | "1"
meaning that a binary number is a bit optionally followed by a
binary number and a bit is a literal zero or one digit.
The meaning of the language is given by its semantics.
See also abstract syntax, concrete syntax.
(1994-10-31)
|
syntax directed translation
(foldoc) | syntax directed translation
A technique where the structure of a language processor (e.g. a
compiler) is based on the structure of the language's
abstract syntax. There might be one procedure in the
translator corresponding to each category in the abstract
syntax. That procedure is responsible for processing
constructs of that category. Each procedure would call others
corresponding to the construct's subconstituents and then
combine their results to give the overall result for that
construct.
|
syntax tree
(foldoc) | syntax tree
A tree representing the
abstract syntax of some tokens in a language.
(1998-11-12)
|
syntax-case
(foldoc) | Syntax-Case
A macro system for Scheme by R. Kent Dybvig
. It is superior to the low-level system
described in the Revised^4 Report (R4RS). Pattern variables
are ordinary identifiers with essentially the same status as
lexical variable names and macro keywords. The syntax
is modified to recognise and handle references to pattern
variables. Version 2.1 works with Chez Scheme and the
Macintosh port runs under MacGambit 2.0
(ftp://iuvax.cs.indiana.edu/pub/scheme/syntax-case.tar.Z).
Macintosh (ftp://maya.dei.unipd.it/pub/mac/gambit/).
["Syntactic Abstraction in Scheme",
Robert Hieb, R. Kent Dybvig and Carl Bruggeman
IUCS TR #355, 6/92 (revised 7/3/92)].
["Writing Hygienic Macros in Scheme with Syntax-Case", R. Kent
Dybvig, IUCS TR #356, 6/92 (revised 7/3/92)].
(1992-07-06)
|
syntax/semantic language
(foldoc) | Syntax/Semantic Language
S/SL
(S/SL) A high level specification language for
recursive descent parsers developed by J.R. Cordy
and R.C. Holt at the
University of Toronto in 1980.
S/SL is a small language that supports cheap recursion and
defines input, output, and error token names (& values),
semantic mechanisms (class interfaces whose methods are really
escapes to routines in a host programming language but allow
good abstraction in the pseudo-code) and a pseudo-code program
that defines the syntax of the input language by the token
stream the program accepts. Alternation, control flow and
one-symbol look-ahead constructs are part of the language.
The S/SL processor compiles this pseudo-code into a table
(byte-codes) that is interpreted by the S/SL table-walker
(interpreter). The pseudo-code language processes the input
language in recursive descent LL1 style but extensions allow
it to process any LRk language relatively easily. S/SL is
designed to provide excellent syntax error recovery and
repair. It is more powerful and transparent than yacc but
slower.
S/SL has been used to implement production commercial
compilers for languages such as PL/I, Euclid, Turing,
Ada, and COBOL, as well as interpreters, {command
processors}, and domain specific languages of many kinds.
(ftp://ftp.cs.queensu.ca/pub/cordy/ssl).
["Specification of S/SL: Syntax/Semantic Language", J.R. Cordy
and R.C. Holt, Computer Systems Research Institute, University
of Toronto, 1980].
["An Introduction to S/SL: Syntax/Semantic Language",
R.C. Holt, J.R. Cordy, and D.B. Wortman; ACM Transactions on
Programming Languages and Systems (TOPLAS), Vol 4, No. 2,
April 1982, pp 149-178].
["Hierarchic Syntax Error Repair", D.T. Barnard and R.C. Holt,
International Journal of Computing and Information Sciences,
Vol. 11, No. 4, August 1982, Pages 231-258.]
(2003-10-30)
|
transfer syntax
(foldoc) | transfer syntax
The actual representation of data as it
is transmitted over a network (as opposed to {abstract
syntax}).
(1998-05-19)
|
|