Skip to search formSkip to main contentSkip to account menu

Expr

Known as: Expr (Unix) 
expr is a command line Unix utility which evaluates an expression and outputs the corresponding value. It first appeared in Unix v7. Syntax: expr… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Boolean expressionC shellExit statusList of Unix commands

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Reference attribute grammar controlled graph rewriting: motivation and overview
Reference attribute grammars are a well-known language engineering technique for the implementation of semantic analyses… 
2013
2013
Evaluation finale du rendement et des paramètres phytosanitaires de lignées de soja [ Glycine max (L.) Merrill] dans deux zones agro écologiques de savane de Côte d’Ivoire
L’engouement suscite par la culture du soja chez les producteurs dans les regions de savane de Cote d’Ivoire a fait place vers la… 
Highly Cited
2010
Highly Cited
2010
Dimensioning and worst-case analysis of cluster-tree sensor networks
Modeling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their… 
2009
2009
Bits Through Relay Cascades with Half-Duplex Constraint
Consider a relay cascade, i.e. a network where the source node, the sink node and a certain number of intermediate relay nodes… 
2007
2007
Most Complex Boolean Functions Detected by the Specialized Normal Form
It is well known that Exclusive Sum-Of-Products (ESOP) expressions for Boolean functions require on average the smallest number… 
2004
2004
Ignition of premixed hydrogen/air by heated counterflow under reduced and elevated pressures
2003
2003
Escape from the tyranny of the textbook: Adaptive object inclusion in AHA!
Adaptation in on-line textbooks makes it possible to allow learners to study the textbook in different ways without encountering… 
Highly Cited
2000
Highly Cited
2000
An Approach to Symbolic Worst-Case Execution Time Analysis
1987
1987
Functional Unification Grammar Revisited
In this paper, we show that one benefit of FUG, the ability to state global constraints on choice separately from syntactic rules… 
1964
1964
The syntax of programming languages
  • 1964
  • Corpus ID: 56937490
Syntax P: PROG programs V: IDENT identifiers S: STMT statements I: INT integer constants E: EXP expressions P ⇒ S S ⇒ S1 ; S2 | V… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)