Kết xuấtvi

∨

Translation status: Tiếng Việt reader-locale proof. Code fences render through the vi pipeline; prose is canonical Latin.

Bitwise or and est-negation operators.

Syntax: <expression> ∨ <expression> | <expression> non est <expression>

Category#

logic

Examples#

radix/corpus/operatores/logica.fab (canonical · operator-group)#

Bitwise or and est-negation operators.

# =============================================================================
# ∨ — Bitwise or and est-negation operators.
# =============================================================================
#
# What this teaches:
#   • Bitwise or — `∨` combines bit flags; distinct from logical short-circuit `aut` and `vel`.
#   • Negated est — `non est` checks that a value is not null or not equal to a target.
#
# Common mistakes:
#   • Confusing ∨ (bitwise or) with aut (exclusive or) or vel (inclusive or).
#
# See also: ∧, ⊻, ¬, et, aut, vel, non est, est
# =============================================================================

# operatores/logica — ∨ and non est
#
# GRAMMAR:
#   binaryExpr :← expr ('∨' | 'non' 'est') expr
#
# EXPECTED OUTPUT:
#   14, verum, falsum
#
# BACKEND:
#   Cross-ref boolean short-circuit: et/et.fab, aut/binarius.fab, vel/binarius.fab.
#   Negated est parses as `expr non est target`.

main {
    const _ vexilla ← 0b1010
    const _ persona ← 0b1100
    const _ velata ← vexilla ∨ persona
    # 14 (0b1110)
    print velata

    const string ∪ null praesens ← "salve"
    const string ∪ null absens ← null
    const _ habetValorem ← praesens not is null
    # verum
    print habetValorem

    const _ caretValorem ← absens not is null
    # falsum
    print caretValorem
}

Expected output:

14
verum
falsum